Partial expansions for file organizations with an index
ACM Transactions on Database Systems (TODS)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Bounded index exponential hashing
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
File Organization: On the Selection of Random Access Index Points for Sequential Files
Journal of the ACM (JACM)
A high performance, universal, key associative access method
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Index maintenance for non-uniform record distributions
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Spiral Storage: Incrementally Augmentable Hash Addressed Storage
Spiral Storage: Incrementally Augmentable Hash Addressed Storage
File organization using composite perfect hashing
ACM Transactions on Database Systems (TODS)
The hB-tree: a multiattribute indexing method with good guaranteed performance
ACM Transactions on Database Systems (TODS)
A compendium of key search references
ACM SIGIR Forum
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Performance analysis of file organizations that use multibucket data leaves with partial expansions
ACM Transactions on Database Systems (TODS)
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Information Processing Letters
New Order Preserving Access Methods for Very Large Files Derived from Linear Hashing
IEEE Transactions on Knowledge and Data Engineering
Bounded Disorder File Organization
IEEE Transactions on Knowledge and Data Engineering
A Combined Method for Maintaining Large Indices in Multiprocessor Multidisk Environments
IEEE Transactions on Knowledge and Data Engineering
Probabilistic Model and Optimal Reorganization of B+-Tree with Physical Clustering
IEEE Transactions on Knowledge and Data Engineering
An Experimental Evaluation of Hybrid Data Structures for Searching
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Clustered Indexing Technique for Multidimensional Index Structures
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
The partitioned exponential file for database storage management
The VLDB Journal — The International Journal on Very Large Data Bases
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
ISB-tree: A new indexing scheme with efficient expected behaviour
Journal of Discrete Algorithms
| Hi-index | 0.00 |
A bounded-disorder (BD) file is one in which data are organized into nodes that are indexed, e.g., by means of a B-tree. The data nodes are multibucket nodes that are accessed by hashing. In this paper we present two important improvements to the BD organization as originally described. First, records in a data node that overflow their designated primary bucket are stored in a single overflow bucket which is itself a bucket of the data node. Second, when file space needs to be increased, partial expansions are used that employ elastic buckets. Analysis and simulation results demonstrate that this variant of the BD organization has utilization, random access performance, and file growth performance that can be competitive with good extendible hashing methods, while supporting high-performance sequential access. The simplicity of the organization results in simple algorithms for realizing the organization.