Multilevel Trie Hashing.

@inproceedings{DBLP:conf/edbt/LitwinZL88,
  author    = {Witold Litwin and
               Djamel Eddine Zegour and
               G{\'e}rard L{\'e}vy},
  editor    = {Joachim W. Schmidt and
               Stefano Ceri and
               Michele Missikoff},
  title     = {Multilevel Trie Hashing},
  booktitle = {Advances in Database Technology - EDBT'88, Proceedings of the
               International Conference on Extending Database Technology, Venice,
               Italy, March 14-18, 1988},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {303},
  year      = {1988},
  isbn      = {3-540-19074-0},
  pages     = {309-335},
  ee        = {db/conf/edbt/LitwinZL88.html},
  crossref  = {DBLP:conf/edbt/88},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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-2 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

References

[BAY72]

Rudolf Bayer, Edward M. McCreight: Organization and Maintenance of Large Ordered Indices. Acta Inf. 1: 173-189(1972) BibTeX

[BAY77]

Rudolf Bayer, Karl Unterauer: Prefix B-Trees. ACM Trans. Database Syst. 2(1): 11-26(1977) BibTeX

[BRI59]

...

[BUR83]

Walter A. Burkhard: Interpolation-Based Index Maintenance. PODS 1983: 76-89 BibTeX

[COM79]

Douglas Comer: The Ubiquitous B-Tree. ACM Comput. Surv. 11(2): 121-137(1979) BibTeX

[DAT86]

C. J. Date: An Introduction to Database Systems, Volume I, 4th Edition. Addison-Wesley 1986
BibTeX

[ELL83]

Carla Schlatter Ellis: Extendible Hashing for Concurrent Operations and Distributed Data. PODS 1983: 106-116 BibTeX

[FAG79]

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) BibTeX

[FLA83]

Philippe Flajolet: On the Performance Evaluation of Extendible Hashing and Trie Searching. Acta Inf. 20: 345-369(1983) BibTeX

[FRE60]

...

[GON84]

...

[KNU73]

...

[KRI84]

Ravi Krishnamurthy, Stephen P. Morgan: Query Processing on Personal Computers: A Pragmatic Approach (Extended Abstract). VLDB 1984: 26-29 BibTeX

[JON81]

...

[LAR78]

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

[LAR82a]

Per-Åke Larson: A Single-File Version of Linear Hashing with Partial Expansions. VLDB 1982: 300-309 BibTeX

[LIT78]

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

[LIT80]

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

[LIT81]

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

[LIT84]

...

[LIT85]

Witold Litwin: TRIE Hashing: Further Properties and Performance. FODO 1985: 77-90 BibTeX

[LIT86]

Witold Litwin, David B. Lomet: The Bounded Disorder Access Method. ICDE 1986: 38-48 BibTeX

[LOM79]

David B. Lomet: Multi-Table Search for B-Tree Files. SIGMOD Conference 1979: 35-42 BibTeX

[LOM81]

David B. Lomet: Digital B-Trees. VLDB 1981: 333-344 BibTeX

[LOM83a]

David B. Lomet: Bounded Index Exponential Hashing. ACM Trans. Database Syst. 8(1): 136-165(1983) BibTeX

[MUL81]

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

[NIE84]

Jürg Nievergelt, Hans Hinterberger, Kenneth C. Sevcik: The Grid File: An Adaptable, Symmetric Multikey File Structure. ACM Trans. Database Syst. 9(1): 38-71(1984) BibTeX

[ORE83]

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

[OUK83]

Aris M. Ouksel, Peter Scheuermann: Storage Mappings for Multidimensional Linear Dynamic Hashing. PODS 1983: 90-105 BibTeX

[RAM84]

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

[REG82]

...

[ROS81]

Arnold L. Rosenberg, Lawrence Snyder: Time- and Space-Optimality in B-Trees. ACM Trans. Database Syst. 6(1): 174-193(1981) BibTeX

[SAM84]

Hanan Samet: The Quadtree and Related Hierarchical Data Structures. ACM Comput. Surv. 16(2): 187-260(1984) BibTeX

[SCH81]

Michel Scholl: New File Organizations Based on Dynamic Hashing. ACM Trans. Database Syst. 6(1): 194-211(1981) BibTeX

[SHO85]

Shou-Hsuan Stephen Huang: Height-Balanced Trees of Order (beta,gamma,delta). ACM Trans. Database Syst. 10(2): 261-284(1985) BibTeX

[TAM82]

Markku Tamminen: Extendible Hashing with Overflow. Inf. Process. Lett. 15(5): 227-232(1982) BibTeX

[TOR83]

Leen Torenvliet, Peter van Emde Boas: The Reconstruction and Optimization of Trie Hashing Functions. VLDB 1983: 142-156 BibTeX

[TRE85]

...

[TRO81]

...

[WIE83]

...

[YAO78]

Andrew Chi-Chih Yao: On Random 2-3 Trees. Acta Inf. 9: 159-170(1978) BibTeX

[ZEG86]

...

Referenced by

1. Andreas Henrich, Hans-Werner Six, Peter Widmayer: The LSD tree: Spatial Access to Multidimensional Point and Nonpoint Objects. VLDB 1989: 45-53