Hashing Schemes for Extendible Arrays
Journal of the ACM (JACM)
Big Buckets Are (Are Not) Better!
Journal of the ACM (JACM)
Perfect hashing functions: a single probe retrieving method for static sets
Communications of the ACM
The reallocation of hash-coded tables
Communications of the ACM
Optimum data base reorganization points
Communications of the ACM
General performance analysis of key-to-address transformation methods using an abstract file concept
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
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
Dynamic data organization for bitmap indices
Proceedings of the 3rd international conference on Scalable information systems
Universal hash functions for an infinite universe and hash trees
Information Processing Letters
Algorithms and theory of computation handbook
| Hi-index | 0.00 |
We propose a new type of hashing which we call virtual hashing. In contrast to any known hashing, a virtual hashing may modify its hashing function. Such changes may be performed when collisions arise. A virtual hashing may then find in one disk access, a record such that several accesses would be needed if the function initially chosen for the file was used. We define virtual hashings which practically independently of the number of such records find in one disk access almost each record of the file.