The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
System R: relational approach to database management
ACM Transactions on Database Systems (TODS)
Concurrent manipulation of binary search trees
ACM Transactions on Database Systems (TODS)
On-the-fly garbage collection: an exercise in cooperation
Communications of the ACM
Concurrent reading and writing
Communications of the ACM
Multiprocessing compactifying garbage collection
Communications of the ACM
ACM Transactions on Database Systems (TODS)
Operation specific locking in B-trees
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Concurrency control in database structures with relaxed balance
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Concurrent search structure algorithms
ACM Transactions on Database Systems (TODS)
An overview of the Andrew message system
SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
Data and Time Abstraction Techniques for Analyzing Multilevel Concurrent Systems
IEEE Transactions on Software Engineering
A model for concurrency in nested transactions systems
Journal of the ACM (JACM)
Concurrent operations on priority queues
Communications of the ACM
Concurrency control of nested transactions accessing B-trees
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A concurrency control mechanism based on extendible hashing for main memory database systems
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Synthesizing Robust Data Structures-An Introduction
IEEE Transactions on Computers
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
A methodology for implementing highly concurrent data structures
PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Performance of B-tree concurrency control algorithms
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Access method concurrency with recovery
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
ARIES/IM: an efficient and high concurrency index management method using write-ahead logging
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)
Computation migration: enhancing locality for distributed-memory parallel systems
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
A methodology for implementing highly concurrent data objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Lazy updates for distributed search structure
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Wait-freedom vs. bounded wait-freedom in public data structures (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Algorithms for Search Trees on Message-Passing Architectures
IEEE Transactions on Parallel and Distributed Systems
Asynchronous shared memory search structures
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Highly concurrent cache consistency for indices in client-server database systems
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Concurrency and recovery in generalized search trees
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Transaction synchronization in structures for point data
GIS '97 Proceedings of the 5th ACM international workshop on Advances in geographic information systems
Multidimensional access methods
ACM Computing Surveys (CSUR)
Managing Statistical Behavior of Large Data Sets in Shared-Nothing Architectures
IEEE Transactions on Parallel and Distributed 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
Transaction synchronisation in object bases
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Concurrent set manipulation without locking
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
Concurrency control in a dynamic search structure
ACM Transactions on Database Systems (TODS)
A greedy concurrent approach to incremental code generation
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Concurrent manipulation of binary search trees
ACM Transactions on Database Systems (TODS)
A symmetric concurrent B-tree algorithm
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Intensive Data Management in Parallel Systems: A Survey
Distributed and Parallel Databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Object and query transformation: supporting multi-dimensional queries through code reuse
Proceedings of the ninth international conference on Information and knowledge management
A simple database language for personal computers
Communications of the ACM
Real-Time Access Control and Reservation on B-Tree IndexedData
Real-Time Systems
Dynamic computation migration in DSM systems
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Simulation of the 3 dimensional cascade flow with numerical wind tunnel (NWT)
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Real-time index concurrency control
ACM SIGMOD Record
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Reminiscences in influential papers
ACM SIGMOD Record
Concurrency control mechanisms and the serializability of concurrent tree algorithms
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Extendible hashing for concurrent operations and distributed data
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Concurrency control in a dynamic search structure
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
A Taxonomy of Indexing Schemes for Parallel Database Systems
Distributed and Parallel Databases
Performance of B+ tree concurrency control algorithms
The VLDB Journal — The International Journal on Very Large Data Bases
Concurrency Control in B-Trees with Batch Updates
IEEE Transactions on Knowledge and Data Engineering
Indexing for Multiversion Locking: Alternatives and Performance Evaluation
IEEE Transactions on Knowledge and Data Engineering
Real-Time Index Concurrency Control
IEEE Transactions on Knowledge and Data Engineering
Public data structures: counters as a special case
Theoretical Computer Science
Restructuring the concurrent B+-tree with non-blocked search operations
Information Sciences—Informatics and Computer Science: An International Journal
A Theory of Transactions on Recoverable Search Trees
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Concurrent Operations in Extendible Hashing
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Adaptive Locking Strategies in a Multi-node Data Sharing Environment
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems
Proceedings of the 27th International Conference on Very Large Data Bases
Exploiting A History Database for Backup
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
New Concurrency Control Algorithms for Accessing and Compacting B-Trees
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Generalized Search Trees for Database Systems
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
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
Finding Data in the Neighborhood
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A Restructuring Method for the Concurrent B+-Tree Based on Semantic Consistency
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
Charm: An I/O-Driven Execution Strategy for High-Performance Transaction Processing
Proceedings of the General Track: 2002 USENIX Annual Technical Conference
View Serializable Updates of Concurrent Index Structures
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
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
Concurrency and recovery for index trees
The VLDB Journal — The International Journal on Very Large Data Bases
Performance evaluation of linear hash structure model in a nested transaction environment
Journal of Systems and Software
A concurrency control theory for nested transactions (Preliminary Report)
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Improved Concurrency Control Techniques for Multi-dimensional Index Structures
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
An Enhanced Concurrency Control Scheme for Multidimensional Index Structures
IEEE Transactions on Knowledge and Data Engineering
Simple, Robust and Highly Concurrent B-trees with Node Deletion
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Global parallel index for multi-processors database systems
Information Sciences: an International Journal
Deleting keys of B-trees in parallel
Journal of Parallel and Distributed Computing
Concurrency control and integrity preservation for the `RIM' DBMS
ACM SIGMIS Database
Concurrency control and recovery for balanced B-link trees
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Relaxed space bounding for moving objects: a case for the buddy tree
ACM SIGMOD Record
Boxwood: abstractions as the foundation for storage infrastructure
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Selective deferred index maintenance & concurrency control in integrated information systems
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
Strong accountability for network storage
ACM Transactions on Storage (TOS)
Tlink-tree: main memory index structure with concurrency control and recovery
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
B-trees, shadowing, and clones
ACM Transactions on Storage (TOS)
CLAM: concurrent location management for moving objects
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Concurrency on a data structure with buckets
ICCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers
GIGA+: scalable directories for shared file systems
PDSW '07 Proceedings of the 2nd international workshop on Petascale data storage: held in conjunction with Supercomputing '07
ST2B-tree: a self-tunable spatio-temporal b+-tree index for moving objects
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Associative Parallel Containers in STAPL
Languages and Compilers for Parallel Computing
A practical scalable distributed B-tree
Proceedings of the VLDB Endowment
Architecture of a Database System
Foundations and Trends in Databases
Concurrency control and recovery for multiversion database structures
Proceedings of the 2nd PhD workshop on Information and knowledge management
Shore-MT: a scalable storage manager for the multicore era
Proceedings of the 12th 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
Minuet: rethinking concurrency control in storage area networks
FAST '09 Proccedings of the 7th conference on File and storage technologies
Efficiently incorporating user feedback into information extraction and integration programs
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Concurrent updating transactions on versioned data
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
Segment-based recovery: write-ahead logging revisited
Proceedings of the VLDB Endowment
A concurrent Blink-tree algorithm using a cooperative locking protocol
BNCOD'03 Proceedings of the 20th British national conference on Databases
Online monitoring and visualisation of database structural deterioration
International Journal of Autonomic Computing
A survey of B-tree locking techniques
ACM Transactions on Database Systems (TODS)
Continuous online index tuning in moving object databases
ACM Transactions on Database Systems (TODS)
Contention-sensitive data structures and algorithms
DISC'09 Proceedings of the 23rd international conference on Distributed computing
ISB-tree: A new indexing scheme with efficient expected behaviour
Journal of Discrete Algorithms
On the performance of distributed lock-based synchronization
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Analyzing the effects of hyperthreading on the performance of data management systems
International Journal of Parallel Programming
On the performance of distributed lock-based synchronization?
ACM SIGOPS Operating Systems Review
NEFOS: rapid cache-aware range query processing with probabilistic guarantees
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
B+-tree index optimization by exploiting internal parallelism of flash-based solid state drives
Proceedings of the VLDB Endowment
Design and implementation of the modified r-tree structure with non-blocking querying
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Improved concurrency control technique with lock-free querying for multi-dimensional index structure
AIRS'05 Proceedings of the Second Asia conference on Asia Information Retrieval Technology
A survey of B-tree logging and recovery techniques
ACM Transactions on Database Systems (TODS)
Update migration: an efficient B+ tree for flash storage
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Scalable address spaces using RCU balanced trees
ASPLOS XVII Proceedings of the seventeenth international conference on Architectural Support for Programming Languages and Operating Systems
Cache craftiness for fast multicore key-value storage
Proceedings of the 7th ACM european conference on Computer Systems
Definition, detection, and recovery of single-page failures, a fourth class of database failures
Proceedings of the VLDB Endowment
Foundations and Trends in Databases
Performance Evaluation of Range Queries in Key Value Stores
Journal of Grid Computing
Parallel main-memory indexing for moving-object query and update workloads
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
KISS-Tree: smart latch-free in-memory indexing on modern architectures
DaMoN '12 Proceedings of the Eighth International Workshop on Data Management on New Hardware
Self-diagnosing and self-healing indexes
DBTest '12 Proceedings of the Fifth International Workshop on Testing Database Systems
Minuet: a scalable distributed multiversion B-tree
Proceedings of the VLDB Endowment
Reduced split/merge propagation in a modified B-link tree design
Journal of Computational Methods in Sciences and Engineering
LogBase: a scalable log-structured database system in the cloud
Proceedings of the VLDB Endowment
ACM Transactions on Database Systems (TODS)
Adapting the b+-tree for asymmetric i/o
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
ACM SIGOPS 24th Symposium on Operating Systems Principles
Speedy transactions in multicore in-memory databases
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication
| Hi-index | 0.04 |
The B-tree and its variants have been found to be highly useful (both theoretically and in practice) for storing large amounts of information, especially on secondary storage devices. We examine the problem of overcoming the inherent difficulty of concurrent operations on such structures, using a practical storage model. A single additional “link” pointer in each node allows a process to easily recover from tree modifications performed by other concurrent processes. Our solution compares favorably with earlier solutions in that the locking scheme is simpler (no read-locks are used) and only a (small) constant number of nodes are locked by any update process at any given time. An informal correctness proof for our system is given.