
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
ChangTien Lu, Jing Dai, Ying Jin, Janak Mathuria, "GLIP: A Concurrency Control Protocol for Clipping Indexing," IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 5, pp. 714728, May, 2009.  
BibTex  x  
@article{ 10.1109/TKDE.2008.183, author = {ChangTien Lu and Jing Dai and Ying Jin and Janak Mathuria}, title = {GLIP: A Concurrency Control Protocol for Clipping Indexing}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {21}, number = {5}, issn = {10414347}, year = {2009}, pages = {714728}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2008.183}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  GLIP: A Concurrency Control Protocol for Clipping Indexing IS  5 SN  10414347 SP714 EP728 EPD  714728 A1  ChangTien Lu, A1  Jing Dai, A1  Ying Jin, A1  Janak Mathuria, PY  2009 KW  Concurrency KW  Spatial databases KW  Access methods VL  21 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] M. Abdelguerfi, J. Givaudan, K. Shaw, and R. Ladner, “The 23TRTree, a TrajectoryOriented Index Structure for Fully Evolving ValidTime SpatioTemporal Datasets,” Proc. 10th ACM Int'l Symp. Advances in Geographic Information System (ACMGIS '02), pp. 2934, 2002.
[2] N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger, “The R$^{\ast}$ Tree: An Efficient and Robust Access Method for Points and Rectangles,” Proc. ACM SIGMOD '90, pp. 322331, 1990.
[3] A. Biliris, “Operation Specific Locking in Btrees,” Proc. Sixth Int'l Conf. Principles of Database Systems (PODS '87), pp. 159169, 1987.
[4] K. Chakrabarti and S. Mehrotra, “Dynamic Granular Locking Approach to Phantom Protection in RTrees,” Proc. 14th IEEE Int'l Conf. Data Eng. (ICDE '98), pp. 446454, 1998.
[5] K. Chakrabarti and S. Mehrotra, “Efficient Concurrency Control in MultiDimensional Access Methods,” Proc. ACM SIGMOD '99, pp.2536, 1999.
[6] J.K. Chen, Y.F. Huang, and Y.H. Chin, “A Study of Concurrent Operations on RTrees,” Information Sciences, vol. 98, nos. 14, pp.263300, May 1997.
[7] V. Gaede and O. Gunther, “Multidimensional Access Methods,” ACM Computing Surveys, vol. 30, no. 2, pp. 170231, June 1998.
[8] D. Greene, “An Implementation and Performance Analysis of Spatial Data Access Methods,” Proc. Fifth IEEE Int'l Conf. Data Eng. (ICDE '89), pp. 606615, 1989.
[9] S. Guha, R. Rastogi, and K. Shim, “CURE: An Efficient Clustering Algorithm for Large Databases,” Proc. ACM SIGMOD '98, pp. 7384, 1998.
[10] A. Guttman, “RTrees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD '84, pp. 4757, 1984.
[11] J. Hellerstein, J. Naughton, and A. Pfeffer, “Generalized Search Trees in Database Systems,” Proc. 21st Int'l Conf. Very Large Data Bases (VLDB '95), pp. 562673, 1995.
[12] E.G. Hoel and H. Samet, “A Qualitative Comparison Study of Data Structures for Large Line Segment Databases,” Proc. ACM SIGMOD '92, pp. 205214, 1992.
[13] K.V.R. Kanth, D. Serena, and A.K. Singh, “Improved Concurrency Control Techniques for MultiDimensional Index Structures,” Proc. Ninth Symp. Parallel and Distributed Processing (SPDP '98), pp. 580586, 1998.
[14] M. Kornacker and D. Banks, “HighConcurrency Locking in RTrees,” Proc. 21st Int'l Conf. Very Large Data Bases (VLDB'95), pp. 134145, 1995.
[15] M. Kornacker, C. Mohan, and J. Hellerstein, “Concurrency and Recovery in Generalized Search Trees,” Proc. ACM SIGMOD '97, pp.6272, 1997.
[16] P. Lehman and S. Yao, “Efficient Locking for Concurrent Operations on Btrees,” ACM Trans. Database Systems, vol. 6, no. 4, pp. 650670, Dec. 1981.
[17] D. Lomet, “Key Range Locking Strategies for Improved Concurrency,” Proc. 19th Int'l Conf. Very Large Data Bases (VLDB '93), pp. 655664, 1993.
[18] C. Mohan and F. Levin, “ARIES/IM: An Efficient and High Concurrency Index Management Method Using WriteAhead Logging,” Proc. ACM SIGMOD '92, pp. 371380, 1992.
[19] V. Ng and T. Kamada, “Concurrent Accesses to RTrees,” Proc. Third Symp. Advances in Spatial Databases (SSD '93), pp. 142161, 1993.
[20] J. Nievergelt, H. Hinterberger, and K.C. Sevcik, “The Grid File: An Adaptable, Symmetric Multikey File Structure,” ACM Trans. Database Systems, vol. 9, no. 1, pp. 3871, Mar. 1984.
[21] J.A. Orenstein and T.H. Merrett, “A Class of Data Structures for Associative Searching,” Proc. Third Symp. Principles of Database Systems (PODS '84), pp. 181190, 1984.
[22] J.T. Robinson, “The KDBTree: A Search Structure for Large Multidimensional Dynamic Indexes,” Proc. ACM SIGMOD '81, pp. 1018, 1981.
[23] T. Sellis, N. Roussopoulos, and C. Faloutsos, “The R+Tree: A Dynamic Index for MultiDimensional Objects,” Proc. 13th Int'l Conf. Very Large Data Bases (VLDB '87), pp. 507518, 1987.
[24] L. Shou, Z. Huang, and K.L. Tan, “The Hierarchical DegreeofVisibility Tree,” IEEE Trans. Knowledge Data Eng., vol. 16, no. 11, pp. 13571369, Nov. 2004.
[25] S.I. Song, Y.H. Kim, and J.S. Yoo, “An Enhanced Concurrency Control Scheme for Multidimensional Index Structure,” IEEE Trans. Knowledge Data Eng., vol. 16, no. 1, pp. 97111, Jan. 2004.
[26] Y. Theodoridis, “The RTree Portal,” http:/www.rtreeportal.org, 2005.
[27] P.S. Yu, K.L. Wu, K.J. Lin, and S.H. Son, “On RealTime Databases: Concurrency Control and Scheduling,” Proc. IEEE, vol. 82, no. 1, pp. 140157, Jan. 1994.
[28] D. Zhang and T. Xia, “A Novel Improvement to the R$^{\ast}$ Tree Spatial Index Using Gain/Loss Metrics,” Proc. 12th ACM Int'l Symp. Advances in Geographic Information Systems (ACMGIS '04), pp. 204213, 2004.