Concurrent Search and Insertion in AVL Trees

DOI10.1109/TC.1980.1675680MaRDI QIDQ3883523zbMATH OpenOpenAlexFDO

Authors Carla Schlatter Ellis

Publication date 1980

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1980.1675680

zbMATH Keywords

concurrent accessdata basesparallel processingperformance evaluationsearch trees

Mathematics Subject Classification ID

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

Cited in

(9)

• Embedding height balanced trees and Fibonacci trees in hypercubes
• Concurrent manipulation of expanded AVL trees
• Operation-specific locking in balanced structures
• Public data structures: counters as a special case.
• Relaxed avl trees, main-memory databases and concurrency
• Compact and localized distributed data structures
• Building a parallel branch and bound library
• A multiple-heaps algorithm for parallel simulation of collision systems
• Parallel heap: an optimal parallel priority queue

This page was built for publication: Concurrent Search and Insertion in AVL Trees

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