The theory of database concurrency control
The theory of database concurrency control
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Proceedings of the sixteenth international conference on Very large databases
ACM Transactions on Database Systems (TODS)
Understanding the new SQL: a complete guide
Understanding the new SQL: a complete guide
The SEQUOIA 2000 storage benchmark
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Efficient and effective querying by image content
Journal of Intelligent Information Systems - Special issue: advances in visual information management systems
Pthreads programming
Concurrency and recovery in generalized search trees
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
A cost model for nearest neighbor search in high-dimensional data space
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Models for studying concurrency control performance: alternatives and implications
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Object Relational DBMSs: The Next Great Wave
Object Relational DBMSs: The Next Great Wave
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
A class of data structures for associative searching
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Dynamic Granular Locking Approach to Phantom Protection in R-Trees
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Key Range Locking Strategies for Improved Concurrency
VLDB '93 Proceedings of the 19th 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
Object and query transformation: supporting multi-dimensional queries through code reuse
Proceedings of the ninth international conference on Information and knowledge management
SP-GiST: An Extensible Database Index for Supporting Space Partitioning Trees
Journal of Intelligent Information Systems
An Enhanced Concurrency Control Scheme for Multidimensional Index Structures
IEEE Transactions on Knowledge and Data Engineering
Incorporating Updates in Domain Indexes: Experiences with Oracle Spatial R-trees
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Indexing text data under space constraints
Proceedings of the thirteenth ACM international conference on Information and knowledge management
A revised r*-tree in comparison with related index structures
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
An efficient phantom protection method for multi-dimensional index structures
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
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
Parallel Real-Time OLAP on Multi-core Processors
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Multiversion concurrency control for multidimensional index structures
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Hi-index | 0.00 |
The importance of multidimensional index structures to numerous emerging database applications is well established. However, before these index structures can be supported as access methods (AMs) in a “commercial-strength” database management system (DBMS), efficient techniques to provide transactional access to data via the index structure must be developed. Concurrent accesses to data via index structures introduce the problem of protecting ranges specified in the retrieval from phantom insertions and deletions (the phantom problem). This paper presents a dynamic granular locking approach to phantom protection in Generalized Search Trees(GiSTs), an index structure supporting an extensible set of queries and data types. The granular locking technique offers a high degree of concurrency and has a low lock overhead. Our experiments show that the granular locking technique (1) scales well under various system loads and (2) similar to the B-tree case, provides a significantly more efficient implementation compared to predicate locking for multidimensional AMs as well. Since a wide variety of multidimensional index structures can be implemented using GiST, the developed algorithms provide a general solution to concurrency control in multidimensional AMs. To the best of our knowledge, this paper provides the first such solution based on granular locking.