Concurrent manipulation of binary search trees

DOI10.1145/320613.320619zbMath0441.68070OpenAlexW2431458507WikidataQ56211929 ScholiaQ56211929MaRDI QIDQ3883522

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 structuresconcurrencybinary search treesdatabases

Mathematics Subject Classification ID

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

Related Items (13)

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

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