A Dynamic Hash File for Random and Sequential Accessing.

Jack A. Orenstein: A Dynamic Hash File for Random and Sequential Accessing. VLDB 1983: 132-141

@inproceedings{DBLP:conf/vldb/Orenstein83,
  author    = {Jack A. Orenstein},
  editor    = {Mario Schkolnick and
               Costantino Thanos},
  title     = {A Dynamic Hash File for Random and Sequential Accessing},
  booktitle = {9th International Conference on Very Large Data Bases, October
               31 - November 2, 1983, Florence, Italy, Proceedings},
  publisher = {Morgan Kaufmann},
  year      = {1983},
  isbn      = {0-934613-15-X},
  pages     = {132-141},
  ee        = {db/conf/vldb/Orenstein83.html},
  crossref  = {DBLP:conf/vldb/83},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Linear hashing is a dynamic file organization proposed by Litwin. A version of it classifies records using a suffix of the binary representation of the key. Random accessing is possible but sequential accessing is not. By using a prefix instead, sequential accessing is possible but not always efficient. Other modifications are included to avoid poor performance for sequential accessing. In particular, only a limited number of sparsely filled buckets are allowed to exist. The performance of the new data structure is, in practice, expected to be better than that of the Btree.

Copyright © 1983 by the VLDB Endowment. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.

Online Paper

Download PDF file (www.vldb.org, Darmstadt, Germany)
Download PDF file (www.acm.org, New York, USA)

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

Mario Schkolnick, Costantino Thanos (Eds.): 9th International Conference on Very Large Data Bases, October 31 - November 2, 1983, Florence, Italy, Proceedings. Morgan Kaufmann 1983, ISBN 0-934613-15-X
Contents

References

[Baye72]: Rudolf Bayer, Edward M. McCreight: Organization and Maintenance of Large Ordered Indices. Acta Inf. 1: 173-189(1972)
[Burk83]: Walter A. Burkhard: Index Maintenance for Non-Uniform Record Distributions. PODS 1984: 173-179
[Fagi79]: Ronald Fagin, Jürg Nievergelt, Nicholas Pippenger, H. Raymond Strong: Extendible Hashing - A Fast Access Method for Dynamic Files. ACM Trans. Database Syst. 4(3): 315-344(1979)
[Fred60]: ...
[Knut73]: Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X
[Litw80]: Witold Litwin: Linear Hashing: A New Tool for File and Table Addressing. VLDB 1980: 212-223
[Litw81]: Witold Litwin: Trie Hashing. SIGMOD Conference 1981: 19-29
[Oren82]: ...
[Oren83]: ...
[Ouks83]: Aris M. Ouksel, Peter Scheuermann: Storage Mappings for Multidimensional Linear Dynamic Hashing. PODS 1983: 90-105
[Stan 80]: ...
[Tamm81a]: Markku Tamminen: Order Preserving Extendible Hashing and Bucket Tries. BIT 21(4): 419-435(1981)
[Tamm81b]: ...