Concurrent operations on B^ *-trees with overtaking

DOI10.1016/0022-0000(86)90021-8zbMATH Open0625.68084OpenAlexW2039071499MaRDI QIDQ579974FDOQ579974

Authors: Yehoshua Sagiv 

Publication date: 1986

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(86)90021-8

Recommendations

• A rigorous analysis of concurrent operations on B-trees
• scientific article; zbMATH DE number 2033285
• String Processing and Information Retrieval
• Restructuring the concurrent B\(^{+}\)-tree with non-blocked search operations
• scientific article; zbMATH DE number 2241920

zbMATH Keywords

data structuredatabasescompressiondeletions\(B^ *\)-treesconcurrent operationsinsertionssearches

Mathematics Subject Classification ID

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

Cites Work

• Organization and maintenance of large ordered indexes
• Concurrency of operations on B-trees
• Concurrent manipulation of binary search trees
• Efficient locking for concurrent operations on B-trees
• B-trees in a system with multiple users
• Title not available (Why is that?)
• A New Method for Concurrency in B-Trees
• Concurrent search and insertion in 2-3 trees

Cited In (17)

• Amortization results for chromatic search trees, with an application to priority queues
• Restructuring the concurrent B\(^{+}\)-tree with non-blocked search operations
• Title not available (Why is that?)
• Unsafe operations in B-trees
• A process-calculus analysis of concurrent operations on B-trees
• Global parallel index for multi-processors database systems
• Variants of \((a,b)\)-trees with relaxed balance
• A rigorous analysis of concurrent operations on B-trees
• Concurrency and trie hashing
• Title not available (Why is that?)
• Relaxed avl trees, main-memory databases and concurrency
• ASA-graphs for efficient data representation and processing
• String Processing and Information Retrieval
• On the correctness of a lock-free compression-based elastic mechanism for a hash trie design
• Distributing a \(B^+\)-tree in a loosely coupled environment
• Operation-specific locking in balanced structures
• Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines

This page was built for publication: Concurrent operations on \(B^ *\)-trees with overtaking

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