Efficient Concurrency Control in Multidimensional Access Methods

SIGMOD Record (ACM Special Interest Group on Management of Data)

Volumn 28, Issue 2, 1999, Pages 25-36

  Chakrabarti, Kaushik ^a   Mehrotra, Sharad ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345826313     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/304181.304185     Document Type: Article

References (21)

1. R. Agrawal, M. Carey, and M. Livny. Models for studying concurrency control performance: Alternatives and implications. In SIGMOD, May 1985.
2. ANSI. Ansi x3.135-1992, american national standard for information systems - database language - sql. November, 1992.
3. S. Berchtold, C. Bohm, D. Keim, and H. P. Kriegel. A cost model for nearest neighbor search in high dimensional data spaces PODS, 1997.
4. K. Chakrabarti and S. Mehrotra. Dynamic granular locking approach to phantom protection in r-trees. Proc. of the IEEE International Conference on Data Engineering (ICDE), February 1998.
5. K. Chakrabarti and S. Mehrotra. Efficient concurrency control in multidimensional access methods. Technical Report TR-MARS-97-12, Department of Computer Science, University of Illinois, October 1998.
6. K. Chakrabarti and S. Mehrotra. High dimensional feature indexing using hybrid trees. Proc. of the 15th IEEE International Conference on Data Engineering (ICDE), March 1999.
7. C. Faloutsos and et. al. Efficient and effective querying by image content. In Journal of Intell. Inf. Systems, July 1994.
8. J. Gray and A. Reuter. Transaction Processing: Concepts and Techniques. Morgan Kaufmann, San Mateo, CA, 1993.
9. J. Hellerstein, J. Naughton, and A. Pfeffer. Generalized search trees in database systems. In Proceeding of VLDB, pages 562-573, September 1995.
10. M. Kornacker, C. Mohan, and J. Hellerstein. Concurrency and recovery in generalized search trees. In Proc. of SIGMOD, 1997.
11. D. Lomet. Key range locking strategies for improved concurrency. In VLDB Proceedings, August 1993.
12. J. Melton and A. R. Simon. Understanding the new sql: A complete guide. Morgan Kauffman, 1993.
13. C. Mohan. ARIES/KVL: A key value locking method for concurrency control of multiaction transactions operating on b-tree indexes. In Proceeding of VLDB, August 1990.
14. C. Mohan, D. Haderle, B. Lindsay, H. Pirahesh, and P. Schwarz. ARIES: A transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging. ACM TODS, Vol. 17, No. 1:94-162, March 1992.
15. B. Nichols, D. Buttlar, and J. P. Farrell. Pthreads Programming. O'Reilly & Associates, 1996.
16. J. Orenstein and T. Merett. A class of data structures for associative searching. In Proc. Third SIGACT News SIGMOD Symposium on the Principles of Database Systems, pages 181-190, 1984.
17. V. H. P. A. Bernstein and N. Goodman. Concurrency control and recovery in database systems. Addison Wesley, 1987.
18. C. Papadimitriou. The theory of database concurrency control. Computer Science Press, 1986.
19. T. Sellis, N. Roussopoulos, and C. Faloutsos. The R+-tree: A dynamic index for multi-dimensional objects. In Proc. VLDB, 1987.
20. M. Stonebraker, J. Frew, K. Gardels, and J. Meredith. The sequoia 2000 storage benchmark. Proc. of SIGMOD, 1993.
21. M. Stonebraker and D. Moore. Object-relational dbmss: The next great wave. The Morgan Kaufmann Series in Data Management Systems, Jim Gray, Series Editor, 1996.