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