Operation specific locking in B-trees
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Concurrency control performance modeling: alternatives and implications
ACM Transactions on Database Systems (TODS)
Concurrent use of B-trees with variable-length entries
ACM SIGMOD Record
Utilization of B-trees with inserts, deletes and modifies
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A framework for the performance analysis of concurrent B-tree algorithms
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
A symmetric concurrent B-tree algorithm
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Semantically-based concurrancy control for search structures
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Concurrent operations on B-trees with overtaking
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
ACM Computing Surveys (CSUR)
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Access method concurrency with recovery
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Locking without blocking: making lock based concurrent data structure algorithms nonblocking
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The performance of current B-tree algorithms
ACM Transactions on Database Systems (TODS)
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Efficient transaction support for dynamic information retrieval systems
SIGIR '96 Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval
Concurrency and recovery in generalized search trees
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Real-Time Access Control and Reservation on B-Tree IndexedData
Real-Time Systems
Real-time index concurrency control
ACM SIGMOD Record
On clustering in database servers for supporting mobile clients
Cluster Computing
Performance of B+ tree concurrency control algorithms
The VLDB Journal — The International Journal on Very Large Data Bases
Real-Time Index Concurrency Control
IEEE Transactions on Knowledge and Data Engineering
Deleting Keys of B-trees in Parallel
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Index Concurrency Control in Firm Real-Time Database Systems
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
High-Concurrency Locking in R-Trees
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
The hBP-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
The Performance of Concurrent Red-Black Tree Algorithms
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
The hB $^\Pi$-tree: a multi-attribute index supporting concurrency, recovery and node consolidation
The VLDB Journal — The International Journal on Very Large Data Bases
Analysis of locking behavior in three real database systems
The VLDB Journal — The International Journal on Very Large Data Bases
Improved Concurrency Control Techniques for Multi-dimensional Index Structures
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Simple, Robust and Highly Concurrent B-trees with Node Deletion
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Deleting keys of B-trees in parallel
Journal of Parallel and Distributed Computing
Concurrency control and recovery for balanced B-link trees
The VLDB Journal — The International Journal on Very Large Data Bases
Query and update efficient B+-tree based indexing of moving objects
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
MARK-OPT: A Concurrency Control Protocol for Parallel B-Tree Structures to Reduce the Cost of SMOs
IEICE - Transactions on Information and Systems
Online reorganization of databases
ACM Computing Surveys (CSUR)
Adaptive indexing of moving objects with highly variable update frequencies
Journal of Computer Science and Technology
Effectively indexing uncertain moving objects for predictive queries
Proceedings of the VLDB Endowment
A survey of B-tree locking techniques
ACM Transactions on Database Systems (TODS)
Massive concurrent deletion of keys in b*-tree
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Bs-tree: a self-tuning index of moving objects
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
An adaptive updating protocol for reducing moving object database workload
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |