Concurrency Control and Recovery Methods for Multi-Dimensional Index Structures
暂无分享,去创建一个
[1] C. Mohan,et al. Concurrency and recovery in generalized search trees , 1997, SIGMOD '97.
[2] Sharad Mehrotra,et al. The hybrid tree: an index structure for high dimensional feature spaces , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).
[3] Sharad Mehrotra,et al. Efficient concurrency control in multidimensional access methods , 1999, SIGMOD '99.
[4] C. Mohan,et al. ARIES/IM: an efficient and high concurrency index management method using write-ahead logging , 1992, SIGMOD '92.
[5] Sharad Mehrotra,et al. Dynamic granular locking approach to phantom protection in R-trees , 1998, Proceedings 14th International Conference on Data Engineering.
[6] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.
[7] S. B. Yao,et al. Efficient locking for concurrent operations on B-trees , 1981, TODS.
[8] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[9] Christos Faloutsos,et al. The TV-tree: An index structure for high-dimensional data , 1994, The VLDB Journal.
[10] Hamid Pirahesh,et al. ARIES: a transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging , 1998 .
[11] Shin'ichi Satoh,et al. The SR-tree: an index structure for high-dimensional nearest neighbor queries , 1997, SIGMOD '97.
[12] Ramesh C. Jain,et al. Similarity indexing with the SS-tree , 1996, Proceedings of the Twelfth International Conference on Data Engineering.
[13] Yin-Fu Huang,et al. A Study of Concurrent Operations on R-Trees , 1997, Inf. Sci..