On the public citation graph
Performance of B+ tree concurrency control algorithms
0 signed · 92 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/spe.4380140205openalex-snapshot
Application of an optimistic concurrency control method
inferredcites →https://doi.org/10.1007/3-540-08755-9_9openalex-snapshot
Notes on data base operating systems
inferredcites →https://doi.org/10.1007/bf00263762openalex-snapshot
Concurrency of operations on B-trees
inferredcites →https://doi.org/10.1007/bf00288683openalex-snapshot
Organization and maintenance of large ordered indexes
inferredcites →https://doi.org/10.1007/bf02243072openalex-snapshot
Integrated concurrency control in shared B-trees
inferredcites →https://doi.org/10.1016/0010-4485(78)90118-5openalex-snapshot
Operating systems — an advanced course
inferredcites →https://doi.org/10.1016/0020-0190(76)90005-3openalex-snapshot
B-trees in a system with multiple users
inferredcites →https://doi.org/10.1109/sfcs.1978.3openalex-snapshot
A dichromatic framework for balanced trees
inferredcites →https://doi.org/10.1109/spdp.1990.143621openalex-snapshot
Multi-version memory: software cache management for concurrent B-trees
inferredcites →https://doi.org/10.1109/tc.1984.1676379openalex-snapshot
An Efficient Implementation of Search Trees on [lg N + 1] Processors
inferredcites →https://doi.org/10.1109/tse.1982.235251openalex-snapshot
A New Method for Concurrency in B-Trees
inferredcites →https://doi.org/10.1145/115790.115860openalex-snapshot
Performance of B-tree concurrency control algorithms
inferredcites →https://doi.org/10.1145/130283.130334openalex-snapshot
Compensation-based on-line query processing
inferredcites →https://doi.org/10.1145/130283.130336openalex-snapshot
Access method concurrency with recovery
inferredcites →https://doi.org/10.1145/130283.130338openalex-snapshot
ARIES/IM: an efficient and high concurrency index management method using write-ahead logging
inferredcites →https://doi.org/10.1145/28659.28676openalex-snapshot
Operation specific locking in B-trees
inferredcites →https://doi.org/10.1145/298514.298580openalex-snapshot
A framework for the performance analysis of concurrent B-tree algorithms
inferredcites →https://doi.org/10.1145/3148.3160openalex-snapshot
Limitations of concurrency in transaction processing
inferredcites →https://doi.org/10.1145/319628.319663openalex-snapshot
Efficient locking for concurrent operations on B-trees
inferredcites →https://doi.org/10.1145/320613.320619openalex-snapshot
Concurrent manipulation of binary search trees
inferredcites →https://doi.org/10.1145/32204.32220openalex-snapshot
Concurrency control performance modeling: alternatives and implications
inferredcites →https://doi.org/10.1145/325405.325407openalex-snapshot
Semantically-based concurrancy control for search structures
inferredcites →https://doi.org/10.1145/325405.325409openalex-snapshot
Concurrent operations on B-trees with overtaking
inferredcites →https://doi.org/10.1145/3828.3831openalex-snapshot
A mean value performance model for locking in databases
inferredcites →https://doi.org/10.1145/51708.51714openalex-snapshot
Concurrent use of B-trees with variable-length entries
inferredcites →https://doi.org/10.1145/582353.582386openalex-snapshot
The implementation of an integrated concurrency control and recovery scheme
inferredcites →https://doi.org/10.1145/588011.588056openalex-snapshot
A mean value performance model for locking in databases
inferredcites →https://doi.org/10.1145/73721.73745openalex-snapshot
Utilization of B-trees with inserts, deletes and modifies
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11602613_33openalex-snapshot
ISB-Tree: A New Indexing Scheme with Efficient Expected Behaviour
inferred← citeshttps://doi.org/10.1007/3-540-45073-4_20openalex-snapshot
A Concurrent Blink-Tree Algorithm Using a Cooperative Locking Protocol
inferred← citeshttps://doi.org/10.1007/3-540-46506-5_14openalex-snapshot
Performance Analysis of Concurrency Control Methods
inferred← citeshttps://doi.org/10.1007/978-0-387-35347-0_3openalex-snapshot
CASE tool support for co-operative work in information systems design
inferred← citeshttps://doi.org/10.1007/978-1-4419-8590-3_12openalex-snapshot
Concurrency Issues in Access Methods
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_10openalex-snapshot
Bulk Operations on B-Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_11openalex-snapshot
Online Index Construction and Maintenance
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_12openalex-snapshot
Concurrency Control by Versioning
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_13openalex-snapshot
Distributed Transactions
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_14openalex-snapshot
Transactions in Page-Server Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_15openalex-snapshot
Processing of Write-Intensive Transactions
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_2openalex-snapshot
Operations on the Physical Database
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_4openalex-snapshot
Transaction Rollback and Restart Recovery
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_6openalex-snapshot
Lock-Based Concurrency Control
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_8openalex-snapshot
B-Tree Structure Modifications
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_9openalex-snapshot
Advanced Locking Protocols
inferred← citeshttps://doi.org/10.1007/978-3-319-96983-1_33openalex-snapshot
Snapshot-Based Synchronization: A Fast Replacement for Hand-over-Hand Locking
inferred← citeshttps://doi.org/10.1007/978-3-642-23088-2_5openalex-snapshot
NEFOS: Rapid Cache-Aware Range Query Processing with Probabilistic Guarantees
inferred← citeshttps://doi.org/10.1007/s00778-004-0140-6openalex-snapshot
Concurrency control and recovery for balanced B-link trees
inferred← citeshttps://doi.org/10.1016/j.jda.2010.08.001openalex-snapshot
ISB-tree: A new indexing scheme with efficient expected behaviour
inferred← citeshttps://doi.org/10.1016/s0020-0255(01)00124-4openalex-snapshot
Key factors for improving performance of concurrency control algorithms
inferred← citeshttps://doi.org/10.1016/s0020-0255(02)00261-xopenalex-snapshot
Restructuring the concurrent B+-tree with non-blocked search operations
inferred← citeshttps://doi.org/10.1016/s0020-0255(96)00219-8openalex-snapshot
A study of concurrent operations on R-trees
inferred← citeshttps://doi.org/10.1016/s0020-0255(98)10054-3openalex-snapshot
A concurrency control algorithm for nearest neighbor query
inferred← citeshttps://doi.org/10.1093/ietisy/e90-d.8.1213openalex-snapshot
MARK-OPT: A Concurrency Control Protocol for Parallel B-Tree Structures to Reduce the Cost of SMOs
inferred← citeshttps://doi.org/10.1108/02635570310489214openalex-snapshot
A study on industry and synthetic standard benchmarks in relational and object databases
inferred← citeshttps://doi.org/10.1109/access.2025.3573152openalex-snapshot
HPG-Tree: An Enhanced B+ -Tree for Spatial Indexing
inferred← citeshttps://doi.org/10.1109/adc.2000.819815openalex-snapshot
T-tree or B-tree: main memory database index structure revisited
inferred← citeshttps://doi.org/10.1109/dasfaa.1999.765756openalex-snapshot
A restructuring method for the concurrent B/sup +/-tree based on semantic consistency
inferred← citeshttps://doi.org/10.1109/dexa.1996.558283openalex-snapshot
Indexing management for distributed linear hash files
inferred← citeshttps://doi.org/10.1109/edcc51268.2020.00012openalex-snapshot
Developing Complex Data Structures over Partitioned State Machine Replication
inferred← citeshttps://doi.org/10.1109/icnas53565.2021.9628904openalex-snapshot
Cost-Effective Space Partitioning Approach for IoT Data Indexing and Retrieval
inferred← citeshttps://doi.org/10.1109/ipps.1992.223026openalex-snapshot
A distributed data-balanced dictionary based on the B-link tree
inferred← citeshttps://doi.org/10.1109/tpds.2019.2942918openalex-snapshot
A High Throughput B+tree for SIMD Architectures
inferred← citeshttps://doi.org/10.1109/wicom.2007.778openalex-snapshot
The Improvement Based on the B+_ Tree Index Mechanism
inferred← citeshttps://doi.org/10.1145/119995.115860openalex-snapshot
Performance of B-tree concurrency control algorithms
inferred← citeshttps://doi.org/10.1145/1326542.1326544openalex-snapshot
B-trees, shadowing, and clones
inferred← citeshttps://doi.org/10.1145/1541880.1541881openalex-snapshot
Online reorganization of databases
inferred← citeshttps://doi.org/10.1145/191246.191268openalex-snapshot
Quantitative evaluation of a transaction facility for knowledge base management system
inferred← citeshttps://doi.org/10.1145/2442516.2442522openalex-snapshot
Compiler aided manual speculation for high performance concurrent data structures
inferred← citeshttps://doi.org/10.1145/2517327.2442522openalex-snapshot
Compiler aided manual speculation for high performance concurrent data structures
inferred← citeshttps://doi.org/10.1145/3186728.3164142openalex-snapshot
Concurrent log-structured memory for many-core key-value stores
inferred← citeshttps://doi.org/10.1145/3595647.3595651openalex-snapshot
Towards Merkle Trees for High-Performance Data Systems
inferred← citeshttps://doi.org/10.2481/dsj.4.59openalex-snapshot
An efficient locking model for concurrency control in OODBS
inferred← citeshttps://doi.org/10.25772/9eyg-7b66openalex-snapshot
Attribute-Level Versioning: A Relational Mechanism for Version Storage and Retrieval
inferred← citeshttps://doi.org/10.3390/fi14010019openalex-snapshot
A Survey on Big IoT Data Indexing: Potential Solutions, Recent Advancements, and Open Issues
inferred← citeshttps://doi.org/10.5121/csit.2019.90908openalex-snapshot
Query Performance Optimization in Databases for Big Data
inferred← citeshttps://doi.org/10.5121/ijcsit.2019.11506openalex-snapshot
Query Optimization for Big Data Analytics
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.