Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
A multidimensional digital hashing scheme for files with composite keys
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Platypus: Design and Implementation of a Flexible High Performance Object Store
POS-9 Revised Papers from the 9th International Workshop on Persistent Object Systems
Optimal Linear Hashing Files for Orthogonal Range Retrieval
COMPSAC '96 Proceedings of the 20th Conference on Computer Software and Applications
Supporting Load Balancing and Efficient Reorganization During System Scaling
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Indexing set-valued attributes with a multi-level extendible hashing scheme
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
On the scalability of the Erlang term storage
Proceedings of the twelfth ACM SIGPLAN workshop on Erlang
| Hi-index | 0.00 |
A new method for organising dynamic files is presented and its performance is analysed. The scheme is a generalization of W. Litwin's linear (virtual) hashing. The amount of storage space allocated to the file grows and shrinks in a simple fashion according to the number of records actually stored in the file. The storage utilisation is controlled and constantly kept equal to a threshold selected by the user. Because no index or other form of access table is used, retrieval of a record requires only one access in most cases. The analysis reveals that an average search length in the range 1.1 - 1.2 accesses can easily be achieved, even for storage utilisations as high as 85-90 per cent.