Static Estimation of Query Sizes in Horn Programs.

@inproceedings{DBLP:conf/icdt/DebrayL90,
  author    = {Saumya K. Debray and
               Nai-Wei Lin},
  editor    = {Serge Abiteboul and
               Paris C. Kanellakis},
  title     = {Static Estimation of Query Sizes in Horn Programs},
  booktitle = {ICDT'90, Third International Conference on Database Theory, Paris,
               France, December 12-14, 1990, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {470},
  year      = {1990},
  isbn      = {3-540-53507-1},
  pages     = {514-528},
  ee        = {db/conf/icdt/DebrayL90.html},
  crossref  = {DBLP:conf/icdt/90},
  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]

Catriel Beeri, Raghu Ramakrishnan: On the Power of Magic. PODS 1987: 269-284 BibTeX

[2]

Stavros Christodoulakis: Estimating Block Transfers and Join Sizes. SIGMOD Conference 1983: 40-54 BibTeX

[3]

Jacques Cohen, Joel Katcoff: Symbolic Solution of Finite-Difference Equations. ACM Trans. Math. Softw. 3(3): 261-271(1977) BibTeX

[4]

Saumya K. Debray, David Scott Warren: Functional Computations in Logic Programs. ACM Trans. Program. Lang. Syst. 11(3): 451-481(1989) BibTeX

[5]

Robert Demolombe: Estimation of the Number of Tuples Satisfying a Query Expressed in Predicate Calculus Language. VLDB 1980: 55-63 BibTeX

[6]

Wen-Chi Hou, Gultekin Özsoyoglu, Baldeo K. Taneja: Statistical Estimators for Relational Algebra Expressions. PODS 1988: 276-287 BibTeX

[7]

John Ivie: Some MACSYMA Programs for Solving Recurrence Relations. ACM Trans. Math. Softw. 4(1): 24-33(1978) BibTeX

[8]

S. Kaplan: Algorithmic Complexity of Logic Programs. ICLP/SLP 1988: 780-793 BibTeX

[9]

Richard J. Lipton, Jeffrey F. Naughton: Estimating the Size of Generalized Transitive Closures. VLDB 1989: 165-171 BibTeX

[10]

Richard J. Lipton, Jeffrey F. Naughton: Query Size Estimation by Adaptive Sampling. PODS 1990: 40-46 BibTeX

[11]

Raghu Ramakrishnan: Magic Templates: A Spellbinding Approach to Logic Programs. ICLP/SLP 1988: 140-159 BibTeX

[12]

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

[13]

David E. Smith, Michael R. Genesereth: Ordering Conjunctive Queries. Artif. Intell. 26(2): 171-215(1985) BibTeX

[14]

Sten-Åke Tärnlund: Horn Clause Computability. BIT 17(2): 215-226(1977) BibTeX

[15]

Allen Van Gelder: Deriving Constraints Among Argument Sizes in Logic Programs. PODS 1990: 47-60 BibTeX

[16]

David H. D. Warren: Efficient Processing of Interactive Relational Data Base Queries expressed in Logic. VLDB 1981: 272-281 BibTeX

Referenced by

1. Weining Zhang, Ke Wang, Siu-Cheung Chau: Data Partition and Parallel Evaluation of Datalog Programs. IEEE Trans. Knowl. Data Eng. 7(1): 163-176(1995)