Concurrent search and insertion in 2-3 trees
From MaRDI portal
Publication:598814
DOI10.1007/BF00289064zbMath0413.68065OpenAlexW1972585359MaRDI QIDQ598814
Publication date: 1980
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00289064
simulationparallel algorithmsconcurrencysearchinginsertion2-3 treesinformation storage and retrieval
Graph theory (including graph drawing) in computer science (68R10) Information storage and retrieval of data (68P20) Discrete mathematics in relation to computer science (68R99)
Related Items (9)
Unnamed Item ⋮ Compact and localized distributed data structures ⋮ Transaction synchronisation in object bases ⋮ A multiple-heaps algorithm for parallel simulation of collision systems ⋮ Global parallel index for multi-processors database systems ⋮ Concurrent operations on \(B^ *\)-trees with overtaking ⋮ Operation-specific locking in balanced structures ⋮ Insertion-safeness in balanced trees ⋮ Public data structures: counters as a special case.
Cites Work
This page was built for publication: Concurrent search and insertion in 2-3 trees
