Multilevel Trie Hashing.

Witold Litwin, Djamel Eddine Zegour, Gérard Lévy: Multilevel Trie Hashing. EDBT 1988: 309-335
  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,}

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 2 Issue 2, EDBT, ICDT, MFDBS, DASFAA" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX


Rudolf Bayer, Edward M. McCreight: Organization and Maintenance of Large Ordered Indices. Acta Inf. 1: 173-189(1972) BibTeX
Rudolf Bayer, Karl Unterauer: Prefix B-Trees. ACM Trans. Database Syst. 2(1): 11-26(1977) BibTeX
Walter A. Burkhard: Interpolation-Based Index Maintenance. PODS 1983: 76-89 BibTeX
Douglas Comer: The Ubiquitous B-Tree. ACM Comput. Surv. 11(2): 121-137(1979) BibTeX
C. J. Date: An Introduction to Database Systems, Volume I, 4th Edition. Addison-Wesley 1986
Carla Schlatter Ellis: Extendible Hashing for Concurrent Operations and Distributed Data. PODS 1983: 106-116 BibTeX
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
Philippe Flajolet: On the Performance Evaluation of Extendible Hashing and Trie Searching. Acta Inf. 20: 345-369(1983) BibTeX
Ravi Krishnamurthy, Stephen P. Morgan: Query Processing on Personal Computers: A Pragmatic Approach (Extended Abstract). VLDB 1984: 26-29 BibTeX
Per-Åke Larson: Dynamic Hashing. BIT 18(2): 184-201(1978) BibTeX
Per-Åke Larson: A Single-File Version of Linear Hashing with Partial Expansions. VLDB 1982: 300-309 BibTeX
Witold Litwin: Virtual Hashing: A Dynamically Changing Hashing. VLDB 1978: 517-523 BibTeX
Witold Litwin: Linear Hashing: A New Tool for File and Table Addressing. VLDB 1980: 212-223 BibTeX
Witold Litwin: Trie Hashing. SIGMOD Conference 1981: 19-29 BibTeX
Witold Litwin: TRIE Hashing: Further Properties and Performance. FODO 1985: 77-90 BibTeX
Witold Litwin, David B. Lomet: The Bounded Disorder Access Method. ICDE 1986: 38-48 BibTeX
David B. Lomet: Multi-Table Search for B-Tree Files. SIGMOD Conference 1979: 35-42 BibTeX
David B. Lomet: Digital B-Trees. VLDB 1981: 333-344 BibTeX
David B. Lomet: Bounded Index Exponential Hashing. ACM Trans. Database Syst. 8(1): 136-165(1983) BibTeX
James K. Mullin: Tightly Controlled Linear Hashing without Separate Overflow Storage. BIT 21(4): 390-400(1981) BibTeX
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
Jack A. Orenstein: A Dynamic Hash File for Random and Sequential Accessing. VLDB 1983: 132-141 BibTeX
Aris M. Ouksel, Peter Scheuermann: Storage Mappings for Multidimensional Linear Dynamic Hashing. PODS 1983: 90-105 BibTeX
Kotagiri Ramamohanarao, Ron Sacks-Davis: Recursive Linear Hashing. ACM Trans. Database Syst. 9(3): 369-391(1984) BibTeX
Arnold L. Rosenberg, Lawrence Snyder: Time- and Space-Optimality in B-Trees. ACM Trans. Database Syst. 6(1): 174-193(1981) BibTeX
Hanan Samet: The Quadtree and Related Hierarchical Data Structures. ACM Comput. Surv. 16(2): 187-260(1984) BibTeX
Michel Scholl: New File Organizations Based on Dynamic Hashing. ACM Trans. Database Syst. 6(1): 194-211(1981) BibTeX
Shou-Hsuan Stephen Huang: Height-Balanced Trees of Order (beta,gamma,delta). ACM Trans. Database Syst. 10(2): 261-284(1985) BibTeX
Markku Tamminen: Extendible Hashing with Overflow. Inf. Process. Lett. 15(5): 227-232(1982) BibTeX
Leen Torenvliet, Peter van Emde Boas: The Reconstruction and Optimization of Trie Hashing Functions. VLDB 1983: 142-156 BibTeX
Andrew Chi-Chih Yao: On Random 2-3 Trees. Acta Inf. 9: 159-170(1978) BibTeX

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
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
Lecture Notes in Computer Science: Copyright © by Springer
Digitization of EDBT/ICDT/MFDBS proceedings was supported by the EDBT Endowment.
ACM SIGMOD Anthology: Copyright © by ACM (, Corrections:
DBLP: Copyright © by Michael Ley (, last change: Sat May 16 23:08:34 2009