
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
You Jung Kim, Jignesh M. Patel, "Performance Comparison of the {\rm R}^{\ast}Tree and the Quadtree for kNN and Distance Join Queries," IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 7, pp. 10141027, July, 2010.  
BibTex  x  
@article{ 10.1109/TKDE.2009.141, author = {You Jung Kim and Jignesh M. Patel}, title = {Performance Comparison of the {\rm R}^{\ast}Tree and the Quadtree for kNN and Distance Join Queries}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {22}, number = {7}, issn = {10414347}, year = {2010}, pages = {10141027}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.141}, 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  Performance Comparison of the {\rm R}^{\ast}Tree and the Quadtree for kNN and Distance Join Queries IS  7 SN  10414347 SP1014 EP1027 EPD  10141027 A1  You Jung Kim, A1  Jignesh M. Patel, PY  2010 KW  Performance evaluation KW  Indexing methods KW  {\rm R}^{\ast}tree KW  quadtree KW  kNN KW  distance join. VL  22 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] Y. Manolopoulos, A. Nanopoulos, A. Papadopoulos, and Y. Theodoridis, RTrees: Theory and Applications. Springer, 2006.
[2] H. Samet, Applications of Spatial Data Structures. AddisonWesley, 1990.
[3] S. Shekhar and S. Chawla, Spatial Databases: A Tour. Prentice Hall, 2003.
[4] H. Samet, Foundations of Multidimensional and Metric Data Structures. Morgan Koufmann, 2006.
[5] N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger, "The ${\rm R}^{\ast}$ Tree: An Efficient and Robust Access Method for Points and Rectangles$^{+}$ ," Proc. ACM SIGMOD, pp. 322331, 1990.
[6] H. Samet, "The Quadtree and Related Hierarchical Data Structures," Computing Surveys, vol. 16, no. 2, pp. 187260, 1984.
[7] K.I. Lin, H. Jagadish, and C. Faloutsos, "The TVTree: An Index Structure for HighDimensional Data," The VLDB J., vol. 3, pp. 517542, 1994.
[8] S. Berchtold, D.A. Keim, and H.P. Kriegel, "The XTree: An Index Structure for HighDimensional Data," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 2839, 1996.
[9] V. Gaede and O. Günther, "Multidimensional Access Methods," ACM Computing Surveys, vol. 30, no. 2, pp. 170231, 1997.
[10] S. Berchtold, C. Böhm, and H.P. Kriegel, "The PyramidTechnique: Towards Breaking the Curse of Dimensionality," Proc. ACM SIGMOD, pp. 142153, 1998.
[11] A. Corral and J. AlmedrosJimenez, "A Performance Comparison of DistanceBased Query Algorithms Using RTrees in Spatial Databases," Information Sciences, vol. 177, pp. 22072237, 2007.
[12] C. Böhm, B. Braunmüller, M. Breunig, and H.P. Kriegel, "High Performance Clustering Based on the Similarity Join," Proc. Conf. Information and Knowledge Management (CIKM), pp. 298305, 2000.
[13] C. Böhm and F. Krebs, "High Performance Data Mining Using the Nearest Neighbor Join," Proc. IEEE Int'l Conf. Data Mining (ICDM), pp. 4350, 2002.
[14] H. Shin, B. Moon, and S. Lee, "Adaptive MultiStage Distance Join Processing," Proc. ACM SIGMOD, pp. 343354, 2000.
[15] H. Shin, B. Moon, and S. Lee, "Adaptive and Incremental Processing for Distance Join Queries," IEEE Trans. Knowledge Data Eng., vol. 15, no. 6, pp. 15611578, Nov./Dec. 2003.
[16] E.G. Hoel and H. Samet, "Benchmarking Spatial Join Operations with Spatial Output," Proc. Int'l Conf. Very Large Data Bases, pp. 606618, 1995.
[17] T. Brinkhoff et al., "Efficient Processing of Spatial Joins Using RTrees," Proc. ACM SIGMOD, pp. 237246, 1993.
[18] J.A. Orenstein, "Spatial Query Processing in an ObjectOriented Database System," Proc. ACM SIGMOD, pp. 326336, 1986.
[19] A. Corral, J. Cañadas, and M. Vassilakopoulos, "Processing DistanceBased Queries in Multidimensional Data Spaces Using RTrees," Proc. Panhellenic Conf. Informatics, pp. 118, 2001.
[20] A. Corral, A. D'Ermiliis, Y. Manolopoulos, and M. Vassilakopoulos, "VAFiles vs. ${\rm R}^{\ast}$ Trees in Distance Join Queries," Lecture Notes in Computer Science, pp. 153166, Springer, 2005.
[21] A. Corral et al., "Closest Pair Queries in Spatial Databases," Proc. ACM SIGMOD, pp. 189200, 2000.
[22] R. Kothuri, S. Ravada, and D. Abugov, "Quadtree and RTree indices in Oracle Spatial: A Comparison Using GIS Data," Proc. ACM SIGMOD, pp. 546556, 2002.
[23] I. Kamel and C. Faloutsos, "On Packing RTrees," Proc. Conf. Information and Knowledge Management (CIKM), 1993.
[24] N. Roussopoulos and D. Leifker, "Direct Spatial Search on Pictorial Databases Using Packed RTrees," Proc. ACM SIGMOD, pp. 1731, 1985.
[25] S.T. Leutenegger, J.M. Edgington, and M.A. Lopez, "STR: A Simple and Efficient Algorithm for RTree Packing," Proc. Int'l Conf. Data Eng. (ICDE), pp. 497506, 1997.
[26] G.R. Hjaltason and H. Samet, "Improved BulkLoading Algorithms for Quadtrees," Proc. ACM Int'l Symp. Advances in Geographic Information Systems (GIS), pp. 110115, 1999.
[27] R. Agrawal, C. Faloutsos, and A. Swami, "Efficient Similarity Search in Sequence Databases," Proc. Int'l Conf. Foundations of Data Organization and Algorithms (FODO), pp. 6984, 1993.
[28] Y.S. Moon, K.Y. Whang, and W.K. Loh, "DualityBased Subsequence Matching in Timeseries Databases," Proc. Int'l Conf. Data Eng. (ICDE), pp. 263272, 2001.
[29] Y.S. Moon, K.Y. Whang, and W.S. Han, "General Match: A Subsequence Matching Method in TimeSeries Databases Based on Generalized Windows," Proc. ACM SIGMOD, pp. 382393, 2002.
[30] C. Faloutsos, R. Barber, M. Flickner, J. Hafner, W. Niblack, D. Petkovic, and W. Equitz, "Efficient and Effective Querying by Image Content," J. Intelligent Information Systems, vol. 3, pp. 231262, 1994.
[31] N. Weskamp, D. Kuhn, E. Hullermeier, and G. Klebe, "Efficient Similarity Search in Protein Structure Database by KClique Hashing," Bioinformatics, vol. 20, no. 10, pp. 15221526, 2004.
[32] M.J. Carey, D.J. DeWitt, M.J. Franklin, N.E. Hall, M.L. McAuliffe, J.F. Naughton, D.T. Schuh, M.H. Solomon, C.K. Tan, O.G. Tsatalos, S.J. White, and M.J. Zwilling, "Shoring Up Persistent Applications," Proc. ACM SIGMOD, pp. 383444, 1994.
[33] A. Guttman, "RTrees: A Dynamic Index Structure for Spatial Indexing," Proc. ACM SIGMOD, pp. 4457, 1984.
[34] G.R. Hjaltason and H. Samet, "Distance Browsing in Spatial Databases," ACM Trans. Database Systems, vol. 24, no. 2, pp. 265318, 1999.
[35] A. Corral et al., "Algorithms for Processing KClosestPair Queries in Spatial Databases," Data and Knowledge Eng., vol. 49, no. 1, pp. 67104, 2000.
[36] G.R. Hjaltason and H. Samet, "Incremental Distance Join Algorithms for Spatial Databases," Proc. ACM SIGMOD, pp. 265318, 1999.