Performance of B+-Trees with Partial Expansions.

@article{DBLP:journals/tkde/Baeza-YatesL89,
  author    = {Ricardo A. Baeza-Yates and
               Per-{\AA}ke Larson},
  title     = {Performance of B+-Trees with Partial Expansions},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {1},
  number    = {2},
  year      = {1989},
  pages     = {248-257},
  ee        = {db/journals/tkde/Baeza-YatesL89.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

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

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

References

[1]

...

[2]

Ricardo A. Baeza-Yates: The Expected Behaviour of B+-Trees. Acta Inf. 26(5): 439-471(1989) BibTeX

[3]

Ricardo A. Baeza-Yates: A dynamic storage allocation algorithm suitable for file structures. Inf. Syst. 15(5): 515-521(1990) BibTeX

[4]

...

[5]

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

[6]

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

[7]

...

[8]

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

[9]

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

[10]

Toshiyuki Nakamura, Tetsuo Mizoguchi: An Analysis of Storage Utilization Factor in Block Split Data Structuring Scheme. VLDB 1978: 489-495 BibTeX

[11]

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

Referenced by

1. June S. Park, V. Sridhar: Probabilistic Model and Optimal Reorganization of B+-Tree with Physical Clustering. IEEE Trans. Knowl. Data Eng. 9(5): 826-832(1997)
2. M. V. Ramakrishna: Bounded Disorder File Organization. IEEE Trans. Knowl. Data Eng. 6(1): 79-85(1994)
3. Gabriel Matsliach, Oded Shmueli: A Combined Method for Maintaining Large Indices in Multiprocessor Multidisk Environments. IEEE Trans. Knowl. Data Eng. 6(3): 479-496(1994)
4. Gabriel Matsliach: Performance Analysis of File Organizations that Use Multibucket Data Leaves with Partial Expansions. ACM Trans. Database Syst. 18(1): 157-180(1993)
5. Goetz Graefe: Query Evaluation Techniques for Large Databases. ACM Comput. Surv. 25(2): 73-170(1993)
6. Gabriel Matsliach: Performance Analysis of File Organizations that Use Multi-Bucket Data Leaves with Partial Expansions. PODS 1991: 164-180
7. David B. Lomet, Betty Salzberg: The Performance of a Multiversion Access Method. SIGMOD Conference 1990: 353-363
8. Ricardo A. Baeza-Yates: An Adaptive Overflow Technique for B-trees. EDBT 1990: 16-28