Concurrency and recovery in generalized search trees
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Efficient concurrency control in multidimensional access methods
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Operating System Concepts
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Dynamic maintenance of data distribution for selectivity estimation
The VLDB Journal — The International Journal on Very Large Data Bases
Dynamic Granular Locking Approach to Phantom Protection in R-Trees
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
VLDB '98 Proceedings of the 24rd 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
An Efficient Index Structure for High Dimensional Image Data
AMCP '98 Proceedings of the First International Conference on Advanced Multimedia Content Processing
The Hybrid Tree: An Index Structure for High Dimensional Feature Spaces
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
An Enhanced Concurrency Control Scheme for Multidimensional Index Structures
IEEE Transactions on Knowledge and Data Engineering
Hi-index | 0.00 |
In order for a multi-dimensional index structure to be integrated into a commercial database system, efficient concurrency control techniques are necessary. The techniques must support all degrees of isolation offered by the database system. Especially the degree 3 isolation, called no phantom read, protects search ranges from concurrent insertions and the rollbacks of deletions. In this paper, we propose a new phantom protection method for multi-dimensional index structures that uses multi-level grid technique. The proposed mechanism is independent of the types of multi-dimensional index structures, i.e., it can be applied to all types of index structures such as tree-based, file-based and hash-based index structures. Also, it achieves low development cost and high concurrency with low lock overhead. It is shown through various experiments that the proposed method outperforms existing phantom protection methods for multi-dimensional index structures.