Performance Measures for Ordered Lists in Random-Access Files

DOI10.1145/322154.322159MaRDI QIDQ3853108zbMATH OpenOpenAlexFDO

Authors Haim Mendelson, Uri Yechiali

Publication date 1979

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

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

zbMATH Keywords

chaining methodcollision resolutionhashingmultidimensional generating functionordered listperformance measuresrandom-access filesretrieval performance

Mathematics Subject Classification ID

Theory of operating systems (68N25) Data structures (68P05) Information storage and retrieval of data (68P20) Discrete mathematics in relation to computer science (68R99)

Cited in

(1)

• Lattice path combinatorics and linear probing

This page was built for publication: Performance Measures for Ordered Lists in Random-Access Files

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3853108)