Optimal bounded disorder

In this paper we present for the Bounded Disorder file organization a model that relates the secondary overflow bucket size to the primary bucket size of the data nodes (supposedly different from that of overflow) and the whole size of a data node, by considering the tree index. This result is obtai...

Full description

Saved in:
Bibliographic Details
Published inInformation processing letters Vol. 83; no. 3; pp. 151 - 157
Main Authors Baeza-Yates, Ricardo A., Soza-Pollman, Héctor
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 16.08.2002
Elsevier Science
Elsevier Sequoia S.A
Subjects
Applied sciences
B-trees
Bounded disorder
Computer science; control theory; systems
Decision trees
Exact sciences and technology
Hashing
Information systems. Data bases
Mathematical models
Mathematical programming
Memory organisation. Data processing
Optimization
Software
Studies
Hashing
B-trees
Bounded disorder
Storage management
Tree structure
B tree index
Optimization
File layout
Online AccessGet full text

Cover

More Information
Summary:In this paper we present for the Bounded Disorder file organization a model that relates the secondary overflow bucket size to the primary bucket size of the data nodes (supposedly different from that of overflow) and the whole size of a data node, by considering the tree index. This result is obtained by minimizing the cost of inserting data into the structure and enables to compute the optimal overflow bucket size. Both the normal and partial expansion cases are considered and a model for the optimal relation of the parameters involved is developed.
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(01)00326-X