Order preserving extendible hashing and bucket tries

DOI10.1007/BF01932839zbMath0472.68027MaRDI QIDQ1157906

Markku Tamminen

Publication date: 1981

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

data modeldata structuressearch trees21, 419-435 (1981)trie structure

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Related Items (4)

The extendible cell method for closest point problems ⋮ Extendible hashing with overflow ⋮ Analysis of N-trees ⋮ On search by address computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Content-addressable memories
• A note on the analysis of extendible hashing
• Analysis of range searches in quad trees
• Storing a sparse table
• Priority queue administration by sublist index
• External Hashing Schemes for Collections of Data Structures
• Optimal Expected-Time Algorithms for Closest Point Problems
• Hashing functions
• Design and implementation of an efficient priority queue
• Dynamic hashing
• Key-To-Address Transformation Techniques
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
• File structures using hashing functions
• Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting

This page was built for publication: Order preserving extendible hashing and bucket tries