Speeding up the Counting Method by Computing Heritage Functions in Topological Order.

@inproceedings{DBLP:conf/adbis/Chen97,
  author    = {Yangjun Chen},
  title     = {Speeding up the Counting Method by Computing Heritage Functions
               in Topological Order},
  booktitle = {Proceedings of the First East-European Symposium on Advances
               in Databases and Information Systems (ADBIS'97), St.-Petersburg,
               September 2-5, 1997. Volume 1: Regular Papers},
  publisher = {Nevsky Dialect},
  year      = {1997},
  pages     = {108-116},
  ee        = {db/conf/adbis/Chen97.html},
  crossref  = {DBLP:conf/adbis/97},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1997 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

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-5 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]

Hussien Aly, Z. Meral Özsoyoglu: Synchronized Counting Method. ICDE 1989: 366-373 BibTeX

[2]

Isaac Balbin, Graeme S. Port, Kotagiri Ramamohanarao, Krishnamurthy Meenakshi: Efficient Bottom-UP Computation of Queries on Stratified Databases. J. Log. Program. 11(3&4): 295-344(1991) 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]

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

[5]

Stefano Ceri, Georg Gottlob, Letizia Tanca: Logic Programming and Databases. Springer 1990, ISBN 3-540-51728-6
BibTeX

[6]

...

[7]

Yangjun Chen: A Bottom-up Query Evaluation Method for Stratified Databases. ICDE 1993: 568-575 BibTeX

[8]

Yangjun Chen, Theo Härder: On the Optimal Top-down Evaluation of Recursive Queries. DEXA 1994: 47-56 BibTeX

[9]

Yangjun Chen, Theo Härder: An Optimal Graph Traversal Algorithm for Evaluating Linear Binary-Chain Programs. CIKM 1994: 34-41 BibTeX

[10]

...

[11]

...

[12]

...

[13]

Ramsey W. Haddad, Jeffrey F. Naughton: Counting Methods for Cyclic Relations. PODS 1988: 333-340 BibTeX

[14]

Jiawei Han, Lawrence J. Henschen: The Level-Cycle Merging Method. DOOD 1989: 65-81 BibTeX

[15]

Jiawei Han: Chain-Split Evaluation in Deductive Databases. IEEE Trans. Knowl. Data Eng. 7(2): 261-273(1995) BibTeX

[16]

...

[17]

Alberto Marchetti-Spaccamela, Antonella Pelaggi, Domenico Saccà: Worst-case Complexity Analysis of Methods for Logic Query Implementation. PODS 1987: 294-301 BibTeX

[18]

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

[19]

Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan: Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs. IEEE Trans. Knowl. Data Eng. 6(4): 501-517(1994) BibTeX

[20]

Ke Wang, Li-Yan Yuan: First-Order Logic Characterization of Program Properties. IEEE Trans. Knowl. Data Eng. 6(4): 518-533(1994) BibTeX

[21]

Domenico Saccà, Carlo Zaniolo: Magic Counting Methods. SIGMOD Conference 1987: 49-59 BibTeX

[22]

Laurent Vieille: From QSQ towards QoSaQ: Global Optimization of Recursive Queries. Expert Database Conf. 1988: 743-778 BibTeX

[23]

Ching-Shyan Wu, Lawrence J. Henschen: Answering Linear Recursive Queries in Cyclic Databases. FGCS 1988: 727-734 BibTeX