论文信息 - Storage Overhead of O-Trees, B-Trees and Prefix B-Trees: A Comparative Analysis

Storage Overhead of O-Trees, B-Trees and Prefix B-Trees: A Comparative Analysis

The O-tree is an indexing mechanism closely related to B-trees and Prefix B-trees. In this paper we derive the expected storage overhead of O-Trees under the standard Bernoulli model of randomness, compare the results with the expected overhead of B-trees and Prefix B-trees under the same conditions, and assess the expected relative improvements.

Hosam M. Mahmoud | Ratko Orlandic | H. Mahmoud | R. Orlandic

[1] R. Orlandic. Design, Analysis and Applications of Compact 0-Complete Trees , 1989 .

[2] Ronald Fagin,et al. Extendible hashing—a fast access method for dynamic files , 1979, ACM Trans. Database Syst..

[3] Wojciech Szpankowski,et al. Some Results on V-ary Asymmetric Tries , 1988, J. Algorithms.

[4] Richard Rodgers,et al. Oracle: A Database Developer's Guide , 1991 .

[5] John L. Pfaltz,et al. Compact 0-Complete Trees , 1988, VLDB.

[6] David E. Ferguson. Bit-Tree: a data structure for fast file processing , 1992, CACM.

[7] Douglas Comer,et al. Ubiquitous B-Tree , 1979, CSUR.

[8] Carl Malamud,et al. Ingres: Tools for Building an Information Architecture , 1991 .

[9] John L. Pfaltz,et al. Analysis of Compact 0-Complete Trees: A New Access Method to Large Databases , 1989, FCT.

[10] Reind P. van de Riet,et al. Two Access Methods Using Compact Binary Trees , 1987, IEEE Transactions on Software Engineering.

[11] Hosam M. Mahmoud,et al. Evolution of random search trees , 1991, Wiley-Interscience series in discrete mathematics and optimization.

[12] Hosam M. Mahmoud,et al. Toward a Formal Derivation of the Expected Behavior of Prefix B-Trees , 1995, Probability in the Engineering and Informational Sciences.

[13] Aris M. Ouksel,et al. Implicit Data Structures for Linear Hashing Schemes , 1988, Inf. Process. Lett..

[14] Boris Tamm,et al. Concise Encyclopedia of Software Engineering , 1992 .