D. S. Batory
ABSTRACT
An analytic method for comparing the performance of B+ trees and indexed sequential files is proposed. Preliminary results indicate that indexed sequential files may be more efficient than B+ trees in certain applications.
- {AHU74} Aho, A.V., Hopcroft, J.E., and Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts, 1974. Google Scholar
Digital Library
- {Bat80a} Batory, D.S. "Optimal File Designs and Reorganization Points", Computer Systems Research Group Tech. Rep. 110, University of Toronto, 1980.Google Scholar
- {Bat80b} Batory, D.S. "An Analytic Model of Physical Databases", Ph.D. Th., University of Toronto, 1980. Google ScholarDigital Library
- {Com79} Comer, D., "The Ubiquitous B-Tree", ACM Computing Surveys 11,2 (June 79), pp. 121--138. Google ScholarDigital Library
- {HaKo80} Hatzopoulos, M. and Kollias, J., "A Dynamic Model for the Optimal Selection of Secondary Indices", Dept. of Applied Mathematics, Univ. of Athens, Athens, Greece, 1980.Google Scholar
- {Knu73} Knuth, D.E., The Art of Computer Programming, Vol 3: Sorting and Searching, Addison-Wesley, Reading, Massachusetts, 1973. Google ScholarDigital Library
- {NaMi78} Nakamura, T. and Mizoguchi, T., "An Analysis of Storage Utilization Factor in Block Split Data Structuring Scheme", Proc. Very Large Data Bases Conf., Berlin 1978, pp. 489--495.Google Scholar
- {Rei76} Reiter, A., "Some Experiments in Directory Organization --- A Simulation Study", Proc. Int. Symp. Computer Performance, Modeling, Measurement, and Evaluation, (March 76), Harvard, pp. 1--6. Google ScholarDigital Library
- {HeSt78} Held, G. and Stonebraker, M., "B-Trees Re-examined", Comm. ACM 21,2 (Feb. 78), pp. 139--142. Google ScholarDigital Library
- {Ram80} Ramirez, R.J., "Efficient Algorithms for Selecting Efficient Data Storage Structures", Ph.D. Th., University of Waterloo, Waterloo, Ontario, 1980. Google ScholarDigital Library
- {Ston80} Stonebraker, M., "Retrospection on a Database System", ACM Trans. Database Syst. 5,2 (June 80), pp. 225--240. Google ScholarDigital Library
- {Yao77} Yao, S.B., "An Attribute Based Model for Database Access Cost Analysis", ACM Trans. Database Syst. 2,1 (March 77), pp. 45--67. Google ScholarDigital Library
- {Yao78} Yao, A.C., "On Random 2-3 Trees", Acta Informatica 9,2 (1978), pp. 159--168.Google ScholarDigital Library
- B+ trees and indexed sequential files: a performance comparison
Recommendations
Fractal prefetching B+-Trees: optimizing both cache and disk performance
SIGMOD '02: Proceedings of the 2002 ACM SIGMOD international conference on Management of dataB+-Trees have been traditionally optimized for I/O performance with disk pages as tree nodes. Recently, researchers have proposed new types of B+-Trees optimized for CPU cache performance in main memory environments, where the tree node sizes are one or ...
Compressed B+-trees
The B+-tree and its variants have been reported as the good index structures for retrieving data. Database systems frequently establish the B+-tree style indices for fast access to data records. However, traditional B+-tree index could be a performance ...
Digital B-trees
VLDB '81: Proceedings of the seventh international conference on Very Large Data Bases - Volume 7A new tree index organization for files, capable of efficiently supporting both random and sequential access, is introduced. The organization, called digital B-tree (DB-tree), is similar in many aspects to B-trees. Its advantage is that it permits much ...
Comments