Virtual Hashing: A Dynamically Changing Hashing.

Witold Litwin: Virtual Hashing: A Dynamically Changing Hashing. VLDB 1978: 517-523

@inproceedings{DBLP:conf/vldb/Litwin78,
  author    = {Witold Litwin},
  editor    = {S. Bing Yao},
  title     = {Virtual Hashing: A Dynamically Changing Hashing},
  booktitle = {Fourth International Conference on Very Large Data Bases, September
               13-15, 1978, West Berlin, Germany},
  publisher = {IEEE Computer Society},
  year      = {1978},
  pages     = {517-523},
  ee        = {db/conf/vldb/Litwin78.html},
  crossref  = {DBLP:conf/vldb/78},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

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.

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the CD and click on the path of your mount point:
/Anthology/vldb7588 or /cdrom

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the DVD and click on the path of your mount point:
/Anthology/aDVD1 or /dvd

Printed Edition

S. Bing Yao (Ed.): Fourth International Conference on Very Large Data Bases, September 13-15, 1978, West Berlin, Germany. IEEE Computer Society 1978
Contents

References

[1]: Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974, ISBN 0-201-00029-6
[2]: Ian F. Blake, Alan G. Konheim: Big Buckets Are (Are Not) Better! J. ACM 24(4): 591-606(1977)
[3]: Carter Bays: The Reallocation of Hash-Coded Tables. Commun. ACM 16(1): 11-14(1973)
[4]: Sakti P. Ghosh, Vincent Y. Lum: Analysis of Collisions when Hashing by Division. Inf. Syst. 1(1): 15-22(1975)
[5]: ...
[6]: ...
[7]: Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X
[8]: ...
[9]: ...
[10]: ...
[11]: ...
[12]: Vincent Y. Lum: General Performance Analysis of Key-to-Address Transformation Methods Using an Abstract File Concept. Commun. ACM 16(10): 603-612(1973)
[13]: ...
[14]: ...
[15]: Arnold L. Rosenberg, Larry J. Stockmeyer: Hashing Schemes for Extendible Arrays. J. ACM 24(2): 199-221(1977)
[16]: Ben Shneiderman: Optimum Data Base Reorganization Points. Commun. ACM 16(6): 362-365(1973)
[17]: Renzo Sprugnoli: Perfect Hashing Functions: A Single Probe Retrieving Method for Static Sets. Commun. ACM 20(11): 841-850(1977)