Hash Trees Versus B-Trees

DOI10.1093/COMJNL/27.3.218MaRDI QIDQ3332288zbMATH OpenOpenAlexFDO

Authors S. Misbah Deen, D. A. Bell

Publication date 1984

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/27.3.218

zbMATH Keywords

indexingfile organizationB-treeshash treesexternal hashing

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05)

Recommendations

• Adaptive hashing
• Optimality in external memory hashing
• Universal hash functions for an infinite universe and hash trees
• Memory management for B-trees
• scientific article; zbMATH DE number 1424317

Cited in

(3)

• Adaptive hashing
• B-Trees and Cache-Oblivious B-Trees with Different-Sized Atomic Keys
• KEY SPACE COMPRESSION USING FORBIDDEN ZONES

This page was built for publication: Hash Trees Versus B-Trees

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