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

Performance Comparison of Index Structures for Multi-Key Retrieval.

Hans-Peter Kriegel: Performance Comparison of Index Structures for Multi-Key Retrieval. SIGMOD Conference 1984: 186-196
@inproceedings{DBLP:conf/sigmod/Kriegel84,
  author    = {Hans-Peter Kriegel},
  editor    = {Beatrice Yormark},
  title     = {Performance Comparison of Index Structures for Multi-Key Retrieval},
  booktitle = {SIGMOD'84, Proceedings of Annual Meeting, Boston, Massachusetts,
               June 18-21, 1984},
  publisher = {ACM Press},
  year      = {1984},
  pages     = {186-196},
  ee        = {http://doi.acm.org/10.1145/602259.602284, db/conf/sigmod/Kriegel84.html},
  crossref  = {DBLP:conf/sigmod/84},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

In this paper, we report on a performance comparison of four software implemented index structures for multi-key retrieval: the inverted file, the grid file and two variants of multldimensional B-trees. It turns out that the recently suggested structures multidimensional B-tree and grid file outperform the traditional inverted file.

Copyright © 1984 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

Online Version (ACM WWW Account required): Full Text in PDF Format

CDROM Version: Load the CDROM "Volume 1 Issue 2, SIGMOD '75-'92" and ...

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX

Printed Edition

Beatrice Yormark (Ed.): SIGMOD'84, Proceedings of Annual Meeting, Boston, Massachusetts, June 18-21, 1984. ACM Press 1984 BibTeX , SIGMOD Record 14(2)
Contents

Online Edition: ACM Digital Library


References

[Car 75]
Alfonso F. Cardenas: Analysis and Performance of Inverted Data Base Structures. Commun. ACM 18(5): 253-263(1975) BibTeX
[Chr 81]
...
[Fl Pu 83]
Philippe Flajolet, Claude Puech: Tree Structures for Partial Match Retrieval. FOCS 1983: 282-288 BibTeX
[Gu Kr 80]
Ralf Hartmut Güting, Hans-Peter Kriegel: Multidimensional B-tree: An Efficient Dynamic File Structure for Exact Match Queries. GI Jahrestagung 1980: 375-388 BibTeX
[Hi Ni 83]
...
[JSBS 83]
...
[Kri 82 a]
...
[Kri 82 b]
...
[KAHH 84]
...
[KMO 84]
Hans-Peter Kriegel, Rita Mannss, Mark H. Overmars: The Inverted File Tree Machine: Efficient Multi-Key Retrieval for VLSI. FODO 1985: 279-291 BibTeX
[NHS 82]
Jürg Nievergelt, Hans Hinterberger, Kenneth C. Sevcik: The Grid File: An Adaptable, Symmetric Multikey File Structure. ACM Trans. Database Syst. 9(1): 38-71(1984) BibTeX
[Sc Ou 82]
Peter Scheuermann, Aris M. Ouksel: Multidimensional B-trees for associative searching in database systems. Inf. Syst. 7(2): 123-137(1982) BibTeX

Referenced by

  1. Ke Wang, Beng Chin Ooi, Sam Yuan Sung: P-Tree: A B-Tree Index for Lists. DASFAA 1999: 221-228
  2. Volker Gaede, Oliver Günther: Multidimensional Access Methods. ACM Comput. Surv. 30(2): 170-231(1998)
  3. Thomas A. Mück, Martin L. Polaschek: The Multikey Type Index for Persistent Object Sets. ICDE 1997: 22-31
  4. Beng Chin Ooi, Jiawei Han, Hongjun Lu, Kian-Lee Tan: Index Nesting - An Efficient Approach to Indexing in Object-Oriented Databases. VLDB J. 5(3): 215-228(1996)
  5. Esa Falkenroth: Computational Indexes for Time Series. SSDBM 1996: 242-251
  6. Himawan Gunadhi, Arie Segev: Efficient Indexing Methods for Temporal Relations. IEEE Trans. Knowl. Data Eng. 5(3): 496-509(1993)
  7. Bernhard Seeger, Hans-Peter Kriegel: The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems. VLDB 1990: 590-601
  8. Henk M. Blanken, Alle IJbema, Paul Meek, Bert van den Akker: The Generalized Grid File: Description and Performance Aspects. ICDE 1990: 380-388
  9. Hans-Peter Kriegel, Bernhard Seeger: PLOP-Hashing: A Grid File without Directory. ICDE 1988: 369-376
  10. Hans-Peter Kriegel, Bernhard Seeger: Multidimensional Dynamic Quantile Hashing is Very Efficient for Non-Uniform Record Distributions. ICDE 1987: 10-17
  11. Hans-Peter Kriegel, Bernhard Seeger: Multidimensional Order Preserving Linear Hashing with Partial Expansions. ICDT 1986: 203-220
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:39:39 2009