Linear Hashing with Priority Splitting: A Method for Improving the Retrieval Performance of Linear Hashing.

@inproceedings{DBLP:conf/icde/RuchteT87,
  author    = {William D. Ruchte and
               Alan L. Tharp},
  title     = {Linear Hashing with Priority Splitting: A Method for Improving
               the Retrieval Performance of Linear Hashing},
  booktitle = {Proceedings of the Third International Conference on Data Engineering,
               February 3-5, 1987, Los Angeles, California, USA},
  publisher = {IEEE Computer Society},
  year      = {1987},
  isbn      = {0-8186-0762-9},
  pages     = {2-9},
  ee        = {db/conf/icde/RuchteT87.html},
  crossref  = {DBLP:conf/icde/87},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1987 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

ACM SIGMOD Anthology

• 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/An2-6 or /cdrom

• 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

References

[1]

Francis A. Williams: Handling Identifiers as Internal Symbols in Language Processors. Commun. ACM 2(6): 21-24(1959)

[2]

Wen-Chin Chen, Jeffrey Scott Vitter: Analysis of New Variants of Coalesced Hashing. ACM Trans. Database Syst. 9(4): 616-645(1984)

[3]

Kuo-Chung Tai, Alan L. Tharp: Computed chaining - A hybrid of direct chaining and open addressing. Inf. Syst. 6(2): 111-116(1981)

[4]

Per-Åke Larson: Dynamic Hashing. BIT 18(2): 184-201(1978)

[5]

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)

[6]

Witold Litwin: Trie Hashing. SIGMOD Conference 1981: 19-29

[7]

Witold Litwin: Linear Hashing: A New Tool for File and Table Addressing. VLDB 1980: 212-223

[8]

Per-Åke Larson: Linear Hashing with Partial Expansions. VLDB 1980: 224-232

[9]

Per-Åke Larson: Linear Hashing with Overflow-Handling by Linear Probing. ACM Trans. Database Syst. 10(1): 75-89(1985)

[10]

Per-Åke Larson: Performance Analysis of a Single-File Version of Linear Hashing. Comput. J. 28(3): 319-329(1985)

[11]

James K. Mullin: Tightly Controlled Linear Hashing without Separate Overflow Storage. BIT 21(4): 390-400(1981)

[12]

Kotagiri Ramamohanarao, Ron Sacks-Davis: Recursive Linear Hashing. ACM Trans. Database Syst. 9(3): 369-391(1984)