A process-calculus analysis of concurrent operations on B-trees
From MaRDI portal
Publication:5943122
DOI10.1006/jcss.2000.1721zbMath0990.68093OpenAlexW2030125238MaRDI QIDQ5943122
No author found.
Publication date: 9 September 2001
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.2000.1721
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Data structures (68P05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Concurrent operations on \(B^ *\)-trees with overtaking
- A calculus of communicating systems
- A calculus of mobile processes. II
- Concurrency of operations on B-trees
- Partial confluence of processes and systems of objects
- On transformations of concurrent-object programs
- Organization and maintenance of large ordered indexes
- Efficient locking for concurrent operations on B-trees
- A New Method for Concurrency in B-Trees
- The name discipline of uniform receptiveness (extended abstract)
This page was built for publication: A process-calculus analysis of concurrent operations on B-trees