Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Perfect hashing functions: a single probe retrieving method for static sets
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
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Order-preserving key transformations
ACM Transactions on Database Systems (TODS)
Associative searching in multiple storage units
ACM Transactions on Database Systems (TODS)
A compendium of key search references
ACM SIGIR Forum
A dynamic hash method with signature
ACM Transactions on Database Systems (TODS)
Trie Hashing with Controlled Load
IEEE Transactions on Software Engineering
Interpolation-based index maintenance
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Storage mappings for multidimensional linear dynamic hashing
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
A multikey hashing scheme using predicate trees
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A Dynamic Perfect Hash Function Defined by an Extended Hash Indicator Table
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Query Processing on Personal Computers: A Pragmatic Approach (Extended Abstract)
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
A Performance Evaluation of OID Mapping Techniques
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
An Implementation of Impure Surrogates
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
A Dynamic Hash File for Random and Sequential Accessing
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Toward network data independence
ACM SIGMOD Record
Universal hash functions for an infinite universe and hash trees
Information Processing Letters
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Hashed patricia trie: efficient longest prefix matching in peer-to-peer systems
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Augmented order preserving minimal perfect hash functions for very large digital libraries
CIT'11 Proceedings of the 5th WSEAS international conference on Communications and information technology
Concurrent tries with efficient non-blocking snapshots
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
| Hi-index | 0.00 |
We propose a new algorithm for hashing. Contrary to the usual hashing, ours stores the records in order. Furthermore, the file may be highly dynamic, even may be constituted entirely with insertions. The load factor is typically about 70 %. The search for a record is performed in only one disk access, for files attaining millions of records. No other algorithms providing such a fast search in an ordered file are known.