File structures using hashing functions

DOI10.1145/362686.362693zbMath0216.24203OpenAlexW2039379906WikidataQ127770600 ScholiaQ127770600MaRDI QIDQ5619640

J. Eve, Edward G. jun. Coffman

Publication date: 1970

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/362686.362693

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items

Position heaps for Cartesian-tree matching on strings and tries, Distances in random digital search trees, On-line construction of position heaps, Node profiles of symmetric digital search trees: Concentration properties, The asymptotic distribution of cluster sizes for supercritical percolation on random split trees, Order preserving extendible hashing and bucket tries, Weighted height of random trees, On the variance of a class of inductive valuations of data structures for digital search, The total path length of split trees, Position heaps: a simple and dynamic text indexing data structure, The fluctuations of the giant cluster for percolation on random split trees, The oscillatory distribution of distances in random tries, Universal hash functions for an infinite universe and hash trees, Dynamic hashing, Multiple choice tries and distributed hash tables, On the shape of the fringe of various types of random trees, Inversions in Split Trees and Conditional Galton–Watson Trees, Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure, On the variance of the internal path length of generalized digital trees -- the Mellin convolution approach