ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

Predicate Trees: An Approach to Optimize Relational Query Operations.

Georges Gardarin, Patrick Valduriez, Yann Viémont: Predicate Trees: An Approach to Optimize Relational Query Operations. ICDE 1984: 439-444
@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

CDROM Version: Load the CDROM "Volume 2 Issue 6, ICDE 1984-1995" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Printed Edition

Proceedings of the First International Conference on Data Engineering, April 24-27, 1984, Los Angeles, California, USA. IEEE Computer Society 1984, ISBN 0-8186-0533-2
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

References

[BANC80]
François Bancilhon, Michel Scholl: On Designing an I/O Processor for a Relational Data Base Machine. SIGMOD Conference 1980: 93-93g CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[BAYE72]
Rudolf Bayer, Edward M. McCreight: Organization and Maintenance of Large Ordered Indices. Acta Inf. 1: 173-189(1972) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[BENT75]
Jon Louis Bentley, Donald F. Stanat: Analysis of Range Searches in Quad Trees. Inf. Process. Lett. 3(6): 170-173(1975) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[BENT79]
Jon Louis Bentley, Jerome H. Friedman: Data Structures for Range Searching. ACM Comput. Surv. 11(4): 397-409(1979) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[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) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[GARD82]
...
[KARL81]
Kjell Karlsson: Reduced Cover-Trees and their Application in the Sabre Access Path Model. VLDB 1981: 345-353 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[KNUT73]
Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X
CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[LARS80]
Per-Åke Larson: Linear Hashing with Partial Expansions. VLDB 1980: 224-232 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[LITW80]
Witold Litwin: Linear Hashing: A New Tool for File and Table Addressing. VLDB 1980: 212-223 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[LITW81]
Witold Litwin: Trie Hashing. SIGMOD Conference 1981: 19-29 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[NIEV81]
Jürg Nievergelt, Hans Hinterberger, Kenneth C. Sevcik: The Grid File: An Adaptable, Symmetric Multi-Key File Structure. ECI 1981: 236-251 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[PFAL80]
John L. Pfaltz, William J. Berman, Edgar M. Cagley: Partial-Match Retrieval Using Indexed Descriptor Files. Commun. ACM 23(9): 522-528(1980) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[ROHM80]
...
[SCHO81]
Michel Scholl: New File Organizations Based on Dynamic Hashing. ACM Trans. Database Syst. 6(1): 194-211(1981) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[VALD84]
...

Referenced by

  1. Jean-Pierre Cheiney, Christophe de Maindreville: A Parallel Strategy for Transitive Closure usind Double Hash-Based Clustering. VLDB 1990: 347-358
  2. Georges Gardarin, Jean-Pierre Cheiney, Gerald Kiernan, Dominique Pastre, Hervé Stora: Managing Complex Objects in an Extensible Relational DBMS. VLDB 1989: 55-65
  3. Jean-Pierre Cheiney, Christophe de Maindreville: Relational Storage and Efficient Retrieval of Rules in a Deductive DBMS. ICDE 1989: 644-651
  4. Jean-Pierre Cheiney, Gerald Kiernan: A Functional Clustering Method for Optimal Access to Complex Domains in a Relational DBMS. ICDE 1988: 394-401
  5. Jean-Pierre Cheiney, Pascal Faudemay, Rodolphe Michel, Jean-Marc Thévenin: A Reliable Backend Using Multiattribute Clustering and Select-Join Operator. VLDB 1986: 220-227
  6. Matthias Jarke, Jürgen Koch: Query Optimization in Database Systems. ACM Comput. Surv. 16(2): 111-152(1984)
  7. Patrick Valduriez, Yann Viémont: A Multikey Hashing Scheme Using Predicate Trees. SIGMOD Conference 1984: 107-114
  8. Eric Simon, Patrick Valduriez: Design and Implementation of an Extendible Integrity Subsystem. SIGMOD Conference 1984: 9-17

Copyright © Mon Nov 2 20:42:38 2009 by Michael Ley (ley@uni-trier.de)