Concurrency and recovery in generalized search trees
暂无分享,去创建一个
[1] Irving L. Traiger,et al. The notions of consistency and predicate locks in a database system , 1976, CACM.
[2] David B. Lomet,et al. Access method concurrency with recovery , 1992, SIGMOD '92.
[3] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.
[4] Vijay Kumar. Performance of concurrency control mechanisms in centralized database systems , 1995 .
[5] Jeffrey F. Naughton,et al. Generalized Search Trees for Database Systems , 1995, VLDB.
[6] Hamid Pirahesh,et al. ARIES: a transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging , 1998 .
[7] C. Mohan,et al. ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes , 1990, VLDB.
[8] David B. Lomet,et al. Key Range Locking Strategies for Improved Concurrency , 1993, VLDB.
[9] H. T. Kung,et al. Concurrent manipulation of binary search trees , 1980, TODS.
[10] Won Kim,et al. Indexing Techniques for Object-Oriented Databases , 1989, Object-Oriented Concepts, Databases, and Applications.
[11] Dennis Shasha,et al. Concurrent search structure algorithms , 1988, TODS.
[12] Christos Faloutsos,et al. The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.
[13] C. Mohan. Commit_LSN: A Novel and Simple Method for Reducing Locking and Latching in Transaction Processing Systems , 1996, Performance of Concurrency Control Mechanisms in Centralized Database Systems.
[14] David B. Lomet,et al. The hB-tree: a multiattribute indexing method with good guaranteed performance , 1990, TODS.
[15] C. Mohan,et al. ARIES/IM: an efficient and high concurrency index management method using write-ahead logging , 1992, SIGMOD '92.
[16] Nick Roussopoulos,et al. Faloutsos: "the r+- tree: a dynamic index for multidimensional objects , 1987 .
[17] Won Kim,et al. Object-Oriented Concepts, Databases, and Applications , 1989 .
[18] Chilukuri K. Mohan. Performance of Concurrency Control Mechanisms in Centralized Database Systems , 1995 .
[19] H. V. Jagadish. Spatial search with polyhedra , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.
[20] S. B. Yao,et al. Efficient locking for concurrent operations on B-trees , 1981, TODS.
[21] Yehoshua Sagiv. Concurrent Operations on B*-Trees with Overtaking , 1986, J. Comput. Syst. Sci..
[22] Marcel Kornacker,et al. High-Concurrency Locking in R-Trees , 1995, VLDB.
[23] Jim Gray,et al. Notes on Data Base Operating Systems , 1978, Advanced Course: Operating Systems.
[24] Michael J. Carey,et al. Performance of B-tree concurrency control algorithms , 1991, SIGMOD '91.
[25] Andreas Reuter,et al. Transaction Processing: Concepts and Techniques , 1992 .
[26] Dennis Shasha,et al. The performance of current B-tree algorithms , 1993, TODS.