Dynamic hashing
From MaRDI portal
Publication:4155822
DOI10.1007/BF01931695zbMath0377.68026OpenAlexW3189934495MaRDI QIDQ4155822
Publication date: 1978
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01931695
Information storage and retrieval of data (68P20) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items
Single access hashing with overflow separators for dynamic files ⋮ A uniform model for the storage utilization of B-tree-like structures ⋮ Implicit data structures for linear hashing schemes ⋮ Multidimensional extendible hashing for partial-match queries ⋮ Concatenated hash code selection ⋮ Order preserving extendible hashing and bucket tries ⋮ On the average height of trees in digital search and dynamic hashing ⋮ On the allocation of binary trees to secondary storage ⋮ On the variance of a class of inductive valuations of data structures for digital search ⋮ Page usage in a quadtree index ⋮ Performance analysis of a main memory multi-directory hashing technique ⋮ Universal hash functions for an infinite universe and hash trees ⋮ On adaptive sampling ⋮ On the Horton-Strahler number for random tries ⋮ Hashing with overflow indexing ⋮ Analysis of grid file algorithms ⋮ On search by address computation
Cites Work
