ACM Transactions on Database Systems (TODS)
Order-preserving key transformations
ACM Transactions on Database Systems (TODS)
Order preserving linear hashing using dynamic key statistics
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Data base organization for data management (2nd ed.)
Data base organization for data management (2nd ed.)
Partial expansions for file organizations with an index
ACM Transactions on Database Systems (TODS)
A simple bounded disorder file organization with good performance
ACM Transactions on Database Systems (TODS)
Proceedings of the Twenty-First Annual Hawaii International Conference on Architecture Track
Performance analysis of linear hashing with partial expansions
ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
File organization: the consecutive retrieval property
Communications of the ACM
Distribution-dependent hashing functions and their characteristics
SIGMOD '75 Proceedings of the 1975 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
Multidimensional Dynamic Quantile Hashing is Very Efficient for Non-Uniform Record Distributions
Proceedings of the Third International Conference on Data Engineering
Globally Order Preserving Multidimensional Linear Hashing
Proceedings of the Fourth International Conference on Data Engineering
Key-Sequential Access Methods for Very Large Files Derived from Linear Hashing
Proceedings of the Fifth International Conference on Data Engineering
A Dynamic Hash File for Random and Sequential Accessing
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Dynamic key-ordered file structures for the random and sequential access to very large data/knowledge bases
Alternating Hashing for Expansible Files
IEEE Transactions on Knowledge and Data Engineering
Linear Spiral Hashing for Expansible Files
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
A class of order-preserving dynamic hashing structures is introduced and analyzed. The access method is referred to as the dynamic random-sequential access method (DRSAM) and is derived from linear hashing. A new logical to physical mapping that is based on sequential bucket allocations in hash order is proposed. With respect to previous methods, this allocation technique has the following characteristics: (1) the structure captures the hashed order in consecutive storage areas so that order preserving (OPH) schemes should result in performance improvements for range queries and sequential processing; and (2) it adapts elastic buckets for the control of file growth. Under specific conditions, this approach outperforms the partial expansion method previously proposed by P.-A. Larson (1982).