Chain-Split Evaluation in Deductive Databases.

@article{DBLP:journals/tkde/Han95,
  author    = {Jiawei Han},
  title     = {Chain-Split Evaluation in Deductive Databases},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {7},
  number    = {2},
  year      = {1995},
  pages     = {261-273},
  ee        = {db/journals/tkde/Han95.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1995 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

Joint ACM SIGMOD / IEEE Computer Society Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An3-3 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

References

[1]

François Bancilhon, David Maier, Yehoshua Sagiv, Jeffrey D. Ullman: Magic Sets and Other Strange Ways to Implement Logic Programs. PODS 1986: 1-15 BibTeX

[2]

François Bancilhon, Raghu Ramakrishnan: An Amateur's Introduction to Recursive Query Processing Strategies. SIGMOD Conference 1986: 16-52 BibTeX

[3]

Catriel Beeri, Paris C. Kanellakis, François Bancilhon, Raghu Ramakrishnan: Bounds on the Propagation of Selection into Logic Programs. PODS 1987: 214-226 BibTeX

[4]

Danette Chimenti, Ruben Gamboa, Ravi Krishnamurthy, Shamim A. Naqvi, Shalom Tsur, Carlo Zaniolo: The LDL System Prototype. IEEE Trans. Knowl. Data Eng. 2(1): 76-90(1990) BibTeX

[5]

Ramsey W. Haddad, Jeffrey F. Naughton: A Counting Algorithm for a Cyclic Binary Query. J. Comput. Syst. Sci. 43(1): 145-169(1991) BibTeX

[6]

Jiawei Han: Constraint-Based Query Evaluation in Deductive Databases. IEEE Trans. Knowl. Data Eng. 6(1): 96-107(1994) BibTeX

[7]

Jiawei Han, Ling Liu, Zhaohui Xie: LogicBase: A System Prototype for Deductive Query Evaluation. Workshop on Programming with Logic Databases (Informal Proceedings), ILPS 1993: 146-160 BibTeX

[8]

Jiawei Han, Wenyu Lu: Asynchronous Chain Recursions. IEEE Trans. Knowl. Data Eng. 1(2): 185-195(1989) BibTeX

[9]

Jiawei Han, Kangsheng Zeng: Automatic generation of compiled forms for linear recursions. Inf. Syst. 17(4): 299-322(1992) BibTeX

[10]

Yannis E. Ioannidis, Raghu Ramakrishnan: Efficient Transitive Closure Algorithms. VLDB 1988: 382-394 BibTeX

[11]

H. V. Jagadish, Rakesh Agrawal, Linda Ness: A Study of Transitive Closure As a Recursion Mechanism. SIGMOD Conference 1987: 331-344 BibTeX

[12]

Ravi Krishnamurthy, Raghu Ramakrishnan, Oded Shmueli: A Framework for Testing Safety and Effective Computability of Extended Datalog (Extended Abstract). SIGMOD Conference 1988: 154-163 BibTeX

[13]

Ravi Krishnamurthy, Carlo Zaniolo: Optimization in a Logic Based Language for Knowledge and Data Intensive Applications. EDBT 1988: 16-33 BibTeX

[14]

Jeffrey F. Naughton: One-Sided Recursions. PODS 1987: 340-348 BibTeX

[15]

Raghu Ramakrishnan, François Bancilhon, Abraham Silberschatz: Safety of Recursive Horn Clauses With Infinite Relations. PODS 1987: 328-339 BibTeX

[16]

Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan: CORAL - Control, Relations and Logic. VLDB 1992: 238-250 BibTeX

[17]

Yehoshua Sagiv: On Testing Effective Computability of Magic Programs. DOOD 1991: 244-262 BibTeX

[18]

Patricia G. Selinger, Morton M. Astrahan, Donald D. Chamberlin, Raymond A. Lorie, Thomas G. Price: Access Path Selection in a Relational Database Management System. SIGMOD Conference 1979: 23-34 BibTeX

[19]

Divesh Srivastava, Raghu Ramakrishnan: Pushing Constraint Selections. J. Log. Program. 16(3): 361-414(1993) BibTeX

[20]

Leon Sterling, Ehud Y. Shapiro: The Art of Prolog - Advanced Programming Techniques. MIT Press 1986, ISBN 0-262-19250-0
BibTeX

[21-1]

Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume I. Computer Science Press 1988, ISBN 0-7167-8158-1
Contents BibTeX

[21-2]

Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume II. Computer Science Press 1989, ISBN 0-7167-8162-X
Contents BibTeX

[22]

...

[23]

...

Referenced by

1. Yangjun Chen: Speeding up the Counting Method by Computing Heritage Functions in Topological Order. ADBIS 1997: 108-116