Concurrent manipulation of binary search trees

DOI10.1145/320613.320619MaRDI QIDQ3883522zbMATH OpenOpenAlexDBLPWikidataFDO

Authors H. T. Kung, Philip L. Lehman

Publication date 1980

Published in ACM Transactions on Database Systems (Search for Journal in Brave)

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

zbMATH Keywords

binary search treesconcurrencydata structuresdatabases

Mathematics Subject Classification ID

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

Cited in

(15)

• Concurrency and trie hashing
• Concurrent manipulation of expanded AVL trees
• Transaction synchronisation in object bases
• Amortization results for chromatic search trees, with an application to priority queues
• Revisiting underapproximate reachability for multipushdown systems
• Efficient rebalancing of chromatic search trees
• Confluence of processes and systems of objects
• Lock-free reference counting
• Compact and localized distributed data structures
• Contention-sensitive data structures and algorithms
• Concurrent operations on \(B^ *\)-trees with overtaking
• Optimal binary search trees
• Building a parallel branch and bound library
• Fast and fair randomized wait-free locks
• Resources, concurrency, and local reasoning

This page was built for publication: Concurrent manipulation of binary search trees

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