HCB-tree: a height compressed B-tree for parallel processing

DOI10.1016/0020-0190(88)90063-4zbMath0665.68011OpenAlexW81621146MaRDI QIDQ1116322

Myoung Ho Kim, Sakti Pramanik

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90063-4

zbMATH Keywords

parallel processingqueueing modelparallel searchingdatabasesB-treestorage structuresynchronized disk

Mathematics Subject Classification ID

Searching and sorting (68P10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05) Information storage and retrieval of data (68P20) Theory of operating systems (68N25)

Cites Work

• On random 2-3 trees
• Organization and maintenance of large ordered indexes
• Unnamed Item
• Unnamed Item

This page was built for publication: HCB-tree: a height compressed B-tree for parallel processing