Optimization of Chain Queries.

@inproceedings{DBLP:conf/dasfaa/Greco93,
  author    = {Sergio Greco},
  editor    = {Song C. Moon and
               Hideto Ikeda},
  title     = {Optimization of Chain Queries},
  booktitle = {Proceedings of the 3rd International Conference on Database Systems
               for Advanced Applications (DASFAA), Daejeon, Korea, April 6-8,
               1993},
  publisher = {World Scientific},
  series    = {Advanced Database Research and Development Series},
  volume    = {4},
  year      = {1993},
  isbn      = {981-02-1380-8},
  pages     = {261-268},
  ee        = {db/conf/dasfaa/Greco93.html},
  crossref  = {DBLP:conf/dasfaa/93},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

ACM SIGMOD 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/An2-2 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/aDVD1 or /dvd

References

[1]

Foto N. Afrati, Stavros S. Cosmadakis: Expressiveness of Restricted Recursive Queries (Extended Abstract). STOC 1989: 113-126 BibTeX

[2]

Foto N. Afrati, Christos H. Papadimitriou: The Parallel Complexity of Simple Chain Queries. PODS 1987: 210-213 BibTeX

[3]

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

[4]

François Bancilhon, Raghu Ramakrishnan: Performance Evaluation of Data Intensive Logic Programs. Foundations of Deductive Databases and Logic Programming. 1988: 439-517 BibTeX

[5]

Catriel Beeri, Paris C. Kanellakis, François Bancilhon, Raghu Ramakrishnan: Bounds on the Propagation of Selection into Logic Programs. J. Comput. Syst. Sci. 41(2): 157-180(1990) BibTeX

[6]

Catriel Beeri, Raghu Ramakrishnan: On the Power of Magic. J. Log. Program. 10(1/2/3&4): 255-299(1991) BibTeX

[7]

Guozhu Dong: On Datalog Linearization of Chain Queries. Theoretical Studies in Computer Science 1992: 181-206 BibTeX

[8]

Guozhu Dong: Datalog Expressiveness of Chain Queries: Grammar Tools and Characterizations. PODS 1992: 81-90 BibTeX

[9]

Sergio Greco, Carlo Zaniolo: Optimization of Linear Logic Programs Using Counting Methods. EDBT 1992: 72-87 BibTeX

[10]

Yannis E. Ioannidis, Eugene Wong: Transforming Nonlinear Recursion into Linear Recursion. Expert Database Conf. 1988: 401-421 BibTeX

[11]

John W. Lloyd: Foundations of Logic Programming, 2nd Edition. Springer 1987, ISBN 3-540-18199-7
BibTeX

[12]

Alberto Marchetti-Spaccamela, Antonella Pelaggi, Domenico Saccà: Comparison of Methods for Logic-Query Implementation. J. Log. Program. 10(1/2/3&4): 333-360(1991) BibTeX

[13]

Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman: Argument Reduction by Factoring. VLDB 1989: 173-182 BibTeX

[14]

Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman: Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules. SIGMOD Conference 1989: 235-242 BibTeX

[15]

John E. Hopcroft, Jeffrey D. Ullman: Introduction to Automata Theory, Languages and Computation. Addison-Wesley 1979, ISBN 0-201-02988-X
BibTeX

[16]

Domenico Saccà, Carlo Zaniolo: The Generalized Counting Method for Recursive Logic Queries. Theor. Comput. Sci. 62(1-2): 187-220(1988) BibTeX

[17]

Yatin P. Saraiya: Linearizing Nonlinear Recursions in Polynomial Time. PODS 1989: 182-189 BibTeX

[18]

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

[19]

Peter T. Wood: Factoring Augmented Regular Chain Programs. VLDB 1990: 255-263 BibTeX

[20]

Daniel Troy, Clement T. Yu, Weining Zhang: Linearization of Nonlinear Recursive Rules. IEEE Trans. Software Eng. 15(9): 1109-1119(1989) BibTeX