Performance of B+-Trees with Partial Expansions.
Ricardo A. Baeza-Yates, Per-Åke Larson:
Performance of B+-Trees with Partial Expansions.
IEEE Trans. Knowl. Data Eng. 1(2): 248-257(1989)@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.
CDROM Version: Load the CDROM "Volume 3 Issue 2, TODS 1991-1995, TKDE 1989-1992" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 2" and ...
References
- [1]
- ...
- [2]
- Ricardo A. Baeza-Yates:
The Expected Behaviour of B+-Trees.
Acta Inf. 26(5): 439-471(1989)
- [3]
- Ricardo A. Baeza-Yates:
A dynamic storage allocation algorithm suitable for file structures.
Inf. Syst. 15(5): 515-521(1990)
- [4]
- ...
- [5]
- Douglas Comer:
The Ubiquitous B-Tree.
ACM Comput. Surv. 11(2): 121-137(1979)
- [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)
- [7]
- ...
- [8]
- Per-Åke Larson:
Linear Hashing with Partial Expansions.
VLDB 1980: 224-232
- [9]
- David B. Lomet:
Partial Expansions for File Organizations with an Index.
ACM Trans. Database Syst. 12(1): 65-84(1987)
- [10]
- Toshiyuki Nakamura, Tetsuo Mizoguchi:
An Analysis of Storage Utilization Factor in Block Split Data Structuring Scheme.
VLDB 1978: 489-495
- [11]
- Andrew Chi-Chih Yao:
On Random 2-3 Trees.
Acta Inf. 9: 159-170(1978)
Copyright © Mon Mar 15 04:07:36 2010
by Michael Ley (ley@uni-trier.de)