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

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
• Efficient rebalancing of chromatic search trees
• Building a parallel branch and bound library
• Concurrency and trie hashing
• Compact and localized distributed data structures
• Confluence of processes and systems of objects
• Concurrent operations on \(B^ *\)-trees with overtaking
• Revisiting underapproximate reachability for multipushdown systems
• Resources, concurrency, and local reasoning
• Concurrent manipulation of expanded AVL trees
• 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)