Concurrent manipulation of binary search trees

DOI10.1145/320613.320619zbMATH Open0441.68070DBLPjournals/tods/KungL80OpenAlexW2431458507WikidataQ56211929 ScholiaQ56211929MaRDI QIDQ3883522FDOQ3883522

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

data structuresconcurrencydatabasesbinary search trees

Mathematics Subject Classification ID

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

Cited In (14)

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

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)