Restructuring the concurrent B^+-tree with non-blocked search operations
From MaRDI portal
Publication:1857041
Recommendations
Cites work
Cited in
(10)- Operation-specific locking in balanced structures
- An efficient B\(^{+}\)-tree design for main-memory database systems with strong access locality
- scientific article; zbMATH DE number 2033285 (Why is no real title available?)
- String Processing and Information Retrieval
- Reasoning about B+ trees with operational semantics and separation logic
- High Performance Computing for Computational Science - VECPAR 2004
- scientific article; zbMATH DE number 2241920 (Why is no real title available?)
- Concurrent operations on \(B^ *\)-trees with overtaking
- Integrated concurrency control in shared B-trees
- Path conscious caching of \(B^{+}\) tree indexes in a shared disks cluster
This page was built for publication: Restructuring the concurrent B\(^{+}\)-tree with non-blocked search operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1857041)