Predicate Trees: An Approach to Optimize Relational Query Operations.

@inproceedings{DBLP:conf/icde/GardarinVV84,
  author    = {Georges Gardarin and
               Patrick Valduriez and
               Yann Vi{\'e}mont},
  title     = {Predicate Trees: An Approach to Optimize Relational Query Operations},
  booktitle = {Proceedings of the First International Conference on Data Engineering,
               April 24-27, 1984, Los Angeles, California, USA},
  publisher = {IEEE Computer Society},
  year      = {1984},
  isbn      = {0-8186-0533-2},
  pages     = {439-444},
  ee        = {db/conf/icde/GardarinVV84.html},
  crossref  = {DBLP:conf/icde/84},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

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

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-6 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

Printed Edition

References

[BANC80]

François Bancilhon, Michel Scholl: On Designing an I/O Processor for a Relational Data Base Machine. SIGMOD Conference 1980: 93-93g

[BAYE72]

Rudolf Bayer, Edward M. McCreight: Organization and Maintenance of Large Ordered Indices. Acta Inf. 1: 173-189(1972)

[BENT75]

Jon Louis Bentley, Donald F. Stanat: Analysis of Range Searches in Quad Trees. Inf. Process. Lett. 3(6): 170-173(1975)

[BENT79]

Jon Louis Bentley, Jerome H. Friedman: Data Structures for Range Searching. ACM Comput. Surv. 11(4): 397-409(1979)

[FAGI79]

Ronald Fagin, Jürg Nievergelt, Nicholas Pippenger, H. Raymond Strong: Extendible Hashing - A Fast Access Method for Dynamic Files. ACM Trans. Database Syst. 4(3): 315-344(1979)

[GARD82]

...

[KARL81]

Kjell Karlsson: Reduced Cover-Trees and their Application in the Sabre Access Path Model. VLDB 1981: 345-353

[KNUT73]

Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X

[LARS80]

Per-Åke Larson: Linear Hashing with Partial Expansions. VLDB 1980: 224-232

[LITW80]

Witold Litwin: Linear Hashing: A New Tool for File and Table Addressing. VLDB 1980: 212-223

[LITW81]

Witold Litwin: Trie Hashing. SIGMOD Conference 1981: 19-29

[NIEV81]

Jürg Nievergelt, Hans Hinterberger, Kenneth C. Sevcik: The Grid File: An Adaptable, Symmetric Multi-Key File Structure. ECI 1981: 236-251

[PFAL80]

John L. Pfaltz, William J. Berman, Edgar M. Cagley: Partial-Match Retrieval Using Indexed Descriptor Files. Commun. ACM 23(9): 522-528(1980)

[ROHM80]

...

[SCHO81]

Michel Scholl: New File Organizations Based on Dynamic Hashing. ACM Trans. Database Syst. 6(1): 194-211(1981)

[VALD84]

...