Dynamic hashing

DOI10.1007/BF01931695zbMATH Open0377.68026OpenAlexW3189934495MaRDI QIDQ4155822FDOQ4155822

Authors: Per-Ake Larson 

Publication date: 1978

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01931695

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Information storage and retrieval of data (68P20) Algorithms in computer science (68W99)

Cites Work

• Title not available (Why is that?)
• Symmetric binary B-trees: Data structure and maintenance algorithms
• File structures using hashing functions
• Hashing functions

Cited In (17)

• Analysis of grid file algorithms
• On the variance of a class of inductive valuations of data structures for digital search
• A uniform model for the storage utilization of B-tree-like structures
• Implicit data structures for linear hashing schemes
• Universal hash functions for an infinite universe and hash trees
• Multidimensional extendible hashing for partial-match queries
• On adaptive sampling
• Single access hashing with overflow separators for dynamic files
• On the allocation of binary trees to secondary storage
• On the average height of trees in digital search and dynamic hashing
• Page usage in a quadtree index
• Hashing with overflow indexing
• Performance analysis of a main memory multi-directory hashing technique
• On search by address computation
• On the Horton-Strahler number for random tries
• Order preserving extendible hashing and bucket tries
• Concatenated hash code selection

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)