Performance Analysis of File Organizations that Use Multibucket Data Leaves with Partial Expansions.

@article{DBLP:journals/tods/Matsliach93,
  author    = {Gabriel Matsliach},
  title     = {Performance Analysis of File Organizations that Use Multibucket
               Data Leaves with Partial Expansions},
  journal   = {ACM Trans. Database Syst.},
  volume    = {18},
  number    = {1},
  year      = {1993},
  pages     = {157-180},
  ee        = {http://doi.acm.org/10.1145/151284.151289, db/journals/tods/Matsliach93.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1993 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.

Joint ACM SIGMOD / IEEE Computer Society 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/An3-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/aDVD2 or /dvd

Online Edition: ACM Digital Library

References

[1]

Ricardo A. Baeza-Yates, Per-Åke Larson: Performance of B+-Trees with Partial Expansions. IEEE Trans. Knowl. Data Eng. 1(2): 248-257(1989) BibTeX

[2]

Jon Louis Bentley: Multidimensional Binary Search Trees Used for Associative Searching. Commun. ACM 18(9): 509-517(1975) BibTeX

[3]

...

[4]

Douglas Comer: The Ubiquitous B-Tree. ACM Comput. Surv. 11(2): 121-137(1979) BibTeX

[5]

Bernhard Eisenbarth, Nivio Ziviani, Gaston H. Gonnet, Kurt Mehlhorn, Derick Wood: The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees. Information and Control 55(1-3): 125-174(1982) BibTeX

[6]

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) BibTeX

[7]

David B. Lomet: Partial Expansions for File Organizations with an Index. ACM Trans. Database Syst. 12(1): 65-84(1987) BibTeX

[8]

David B. Lomet: A Simple Bounded Disorder File Organization with Good Performance. ACM Trans. Database Syst. 13(4): 525-551(1988) BibTeX

[9]

David B. Lomet, Betty Salzberg: A Robust Multi-Attribute Search Structure. ICDE 1989: 296-304 BibTeX

[10]

Gabriel Matsliach: Performance Analysis of File Organizations that Use Multi-Bucket Data Leaves. Inf. Process. Lett. 36(6): 301-310(1990) BibTeX

[11]

Gabriel Matsliach: Using multi-bucket data leaves with overflow chains-performance analysis. Inf. Syst. 16(5): 497-508(1991) BibTeX

[12]

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

[13]

...

[14]

M. V. Ramakrishna, P. Mukhopadhyay: Analysis of Bounded Disorder File Organization. PODS 1988: 117-125 BibTeX

[15]

Andrew Chi-Chih Yao: On Random 2-3 Trees. Acta Inf. 9: 159-170(1978) BibTeX