Dynamic hashing
From MaRDI portal
Publication:4155822
Cites work
Cited in
(17)- Concatenated hash code selection
- On the allocation of binary trees to secondary storage
- Performance analysis of a main memory multi-directory hashing technique
- On adaptive sampling
- A uniform model for the storage utilization of B-tree-like structures
- Universal hash functions for an infinite universe and hash trees
- On the variance of a class of inductive valuations of data structures for digital search
- Page usage in a quadtree index
- Single access hashing with overflow separators for dynamic files
- On the Horton-Strahler number for random tries
- On search by address computation
- Multidimensional extendible hashing for partial-match queries
- Implicit data structures for linear hashing schemes
- Hashing with overflow indexing
- On the average height of trees in digital search and dynamic hashing
- Order preserving extendible hashing and bucket tries
- Analysis of grid file algorithms
This page was built for publication: Dynamic hashing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4155822)