B-trees in a system with multiple users

DOI10.1016/0020-0190(76)90005-3zbMath0342.68012OpenAlexW2033584818MaRDI QIDQ1232173

Behrokh Samadi

Publication date: 1976

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(76)90005-3

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General topics in the theory of software (68N01)

Related Items (8)

Amortization results for chromatic search trees, with an application to priority queues ⋮ Deletion without rebalancing in multiway search trees ⋮ Concurrent manipulation of expanded AVL trees ⋮ A rigorous analysis of concurrent operations on B-trees ⋮ Transaction synchronisation in object bases ⋮ Concurrent operations on \(B^ *\)-trees with overtaking ⋮ Operation-specific locking in balanced structures ⋮ Integrated concurrency control in shared B-trees

Cites Work

• Organization and maintenance of large ordered indexes
• Operating Experience with ALGOL 60
• Unnamed Item

This page was built for publication: B-trees in a system with multiple users