ACM Transactions on Database Systems (TODS)
On the use of extendible hashing without hashing
Information Processing Letters
Linear hashing with overflow-handling by linear probing
ACM Transactions on Database Systems (TODS)
Partial expansions for file organizations with an index
ACM Transactions on Database Systems (TODS)
Linear hashing with separators—a dynamic hashing scheme achieving one-access
ACM Transactions on Database Systems (TODS)
Yahoo! profile of a web database
Database
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Analysis of dynamic hashing with deferred splitting
ACM Transactions on Database Systems (TODS)
New file organization based on dynamic hashing
ACM Transactions on Database Systems (TODS)
Performance analysis of linear hashing with partial expansions
ACM Transactions on Database Systems (TODS)
Bounded index exponential hashing
ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
File organization: implementation of a method guaranteeing retrieval in one access
Communications of the ACM
New Order Preserving Access Methods for Very Large Files Derived from Linear Hashing
IEEE Transactions on Knowledge and Data Engineering
Linearizing the Directory Growth in Order Preserving Extendible 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
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
A Single-File Version of Linear Hashing with Partial Expansions
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
Spiral Storage: Incrementally Augmentable Hash Addressed Storage
Spiral Storage: Incrementally Augmentable Hash Addressed Storage
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
The goal of dynamic hashing is to design a function and a file structure that allow the address space allocated to the file to be increased and reduced without reorganizing the whole file. In this paper, we propose a new scheme for dynamic hashing in which the growth of a file occurs at a rate of $\frac{n+k}{n}$ per full expansion, where $n$ is the number of pages of the file and $k$ is a given integer constant which is smaller than $n$, as compared to a rate of two in linear hashing. Like linear hashing, the proposed scheme (called linear spiral hashing) requires no index; however, the proposed scheme may or may not add one more physical page, instead of always adding one more page in linear hashing, when a split occurs. Therefore, linear spiral hashing can maintain a more stable performance through the file expansions and have much better storage utilization than linear hashing. From our performance analysis, linear spiral hashing can achieve nearly 97 percent storage utilization as compared to 78 percent storage utilization by using linear hashing, which is also verified by a simulation study.