Implicit data structures for linear hashing schemes

DOI10.1016/0020-0190(88)90058-0zbMath0666.68017OpenAlexW2084052345MaRDI QIDQ1116689

Peter Scheuermann, Mohamed Ouksel

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90058-0

zbMATH Keywords

order-preservinglinear hashingimplicit data structureslinear binary search treeslinear binary trie

Mathematics Subject Classification ID

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

Related Items (2)

A robust and efficient spatial data structure. The nested interpolation- based grid file ⋮ Representing graphs implicitly using almost optimal space

Cites Work

• Multidimensional B-trees: Analysis of dynamic behavior
• Dynamic hashing

This page was built for publication: Implicit data structures for linear hashing schemes