ACM Transactions on Database Systems (TODS)
Linear hashing with overflow-handling by linear probing
ACM Transactions on Database Systems (TODS)
Linear hashing with separators—a dynamic hashing scheme achieving one-access
ACM Transactions on Database Systems (TODS)
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)
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
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
An approach for indexing file names in a directory
Proceedings of the 13th International Conference on Computer Systems and Technologies
| Hi-index | 0.00 |
In this paper, we propose a generalized approach for designing a class of dynamic hashing schemes which require no index and have the growth of a file at a rate of$${\textstyle{{n\,+\,1} \over n}}$$per full expansion, where n is the number of pages of the file, as compared to a rate of two in linear hashing. Based on this generalized approach, we derive a new dynamic hashing scheme called alternating hashing, in which, when a split occurs in page k, the data records in page k will be redistributed to page k and page (k + 1), or page k and page (k驴 1), according to whether the value of level d is even or odd, respectively. (Note that a level is defined as the number of full expansions happened so far.) From our performance analysis, given a fixed load control, the proposed scheme can achieve nearly 97% storage utilization as compared to 78% storage utilization by using linear hashing.