메뉴 건너뛰기




Volumn 22, Issue 7, 2010, Pages 1014-1027

Performance comparison of the R*-tree and the quadtree for kNN and distance join queries

Author keywords

Distance join; Indexing methods; KNN; Performance evaluation; Quadtree; R* tree

Indexed keywords

DATA CENTRIC; DATA SETS; DYNAMIC NATURE; EXPERIMENTAL STUDIES; INDEX CONSTRUCTION; INDEX STRUCTURE; INDEXING METHODS; K-NEAREST NEIGHBORS; MOVING OBJECT DATABASE; PERFORMANCE COMPARISON; PERFORMANCE EVALUATION; QUAD TREES; QUERY OPERATIONS; RANGE SEARCH; SEQUENCE MATCHING;

EID: 77952922739     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2009.141     Document Type: Article
Times cited : (37)

References (36)
  • 6
    • 0021644214 scopus 로고
    • The quadtree and related hierarchical data structures
    • H. Samet, "The Quadtree and Related Hierarchical Data Structures," Computing Surveys, vol. 16, no. 2, pp. 187-260, 1984.
    • (1984) Computing Surveys , vol.16 , Issue.2 , pp. 187-260
    • Samet, H.1
  • 7
    • 34249762939 scopus 로고
    • The TV-Tree: An index structure for high-dimensional data
    • K. I. Lin, H. Jagadish, and C. Faloutsos, "The TV-Tree: An Index Structure for High-Dimensional Data," The VLDB J., vol. 3, pp. 517-542, 1994.
    • (1994) The VLDB J. , vol.3 , pp. 517-542
    • Lin, K.I.1    Jagadish, H.2    Faloutsos, C.3
  • 9
    • 0032083561 scopus 로고    scopus 로고
    • Multidimensional access methods
    • V. Gaede and O. Günther, "Multidimensional Access Methods," ACM Computing Surveys, vol. 30, no. 2, pp. 170-231, 1997.
    • (1997) ACM Computing Surveys , vol.30 , Issue.2 , pp. 170-231
    • Gaede, V.1    Günther, O.2
  • 10
    • 0032094513 scopus 로고    scopus 로고
    • The Pyramid-technique: Towards breaking the curse of dimensionality
    • S. Berchtold, C. Bohm, and H.-P. Kriegel, "The Pyramid-Technique: Towards Breaking the Curse of Dimensionality," Proc. ACM SIGMOD, pp. 142-153, 1998.
    • (1998) Proc. ACM SIGMOD , pp. 142-153
    • Berchtold, S.1    Bohm, C.2    Kriegel, H.-P.3
  • 11
    • 33947266975 scopus 로고    scopus 로고
    • A performance comparison of distance-based query algorithms using R-trees in spatial databases
    • A. Corral and J. Almedros-Jimenez, "A Performance Comparison of Distance-Based Query Algorithms Using R-Trees in Spatial Databases," Information Sciences, vol. 177, pp. 2207-2237, 2007.
    • (2007) Information Sciences , vol.177 , pp. 2207-2237
    • Corral, A.1    Almedros-Jimenez, J.2
  • 13
    • 4444329743 scopus 로고    scopus 로고
    • High performance data mining using the nearest neighbor join
    • C. Bohm and F. Krebs, "High Performance Data Mining Using the Nearest Neighbor Join," Proc. IEEE Int'l Conf. Data Mining (ICDM), pp. 43-50, 2002.
    • (2002) Proc. IEEE Int'l Conf. Data Mining (ICDM) , pp. 43-50
    • Bohm, C.1    Krebs, F.2
  • 14
    • 0040438346 scopus 로고    scopus 로고
    • Adaptive multi-stage distance join processing
    • H. Shin, B. Moon, and S. Lee, "Adaptive Multi-Stage Distance Join Processing," Proc. ACM SIGMOD, pp. 343-354, 2000.
    • (2000) Proc. ACM SIGMOD , pp. 343-354
    • Shin, H.1    Moon, B.2    Lee, S.3
  • 15
    • 0242493745 scopus 로고    scopus 로고
    • Adaptive and incremental processing for distance join queries
    • Nov./Dec
    • 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. 1561-1578, Nov./Dec. 2003.
    • (2003) IEEE Trans. Knowledge Data Eng. , vol.15 , Issue.6 , pp. 1561-1578
    • Shin, H.1    Moon, B.2    Lee, S.3
  • 16
  • 17
    • 0027621672 scopus 로고
    • Efficient processing of spatial joins using R-trees
    • T. Brinkhoff et al., "Efficient Processing of Spatial Joins Using R-Trees," Proc. ACM SIGMOD, pp. 237-246, 1993.
    • (1993) Proc. ACM SIGMOD , pp. 237-246
    • Brinkhoff, T.1
  • 18
    • 84976784176 scopus 로고
    • Spatial query processing in an object-oriented database system
    • J. A. Orenstein, "Spatial Query Processing in an Object-Oriented Database System," Proc. ACM SIGMOD, pp. 326-336, 1986.
    • (1986) Proc. ACM SIGMOD , pp. 326-336
    • Orenstein, J.A.1
  • 21
    • 0039253795 scopus 로고    scopus 로고
    • Closest pair queries in spatial databases
    • A. Corral et al., "Closest Pair Queries in Spatial Databases," Proc. ACM SIGMOD, pp. 189-200, 2000.
    • (2000) Proc. ACM SIGMOD , pp. 189-200
    • Corral, A.1
  • 22
    • 0036373393 scopus 로고    scopus 로고
    • Quadtree and R-tree indices in oracle spatial: A comparison using GIS data
    • R. Kothuri, S. Ravada, and D. Abugov, "Quadtree and R-Tree indices in Oracle Spatial: A Comparison Using GIS Data," Proc. ACM SIGMOD, pp. 546-556, 2002.
    • (2002) Proc. ACM SIGMOD , pp. 546-556
    • Kothuri, R.1    Ravada, S.2    Abugov, D.3
  • 24
    • 0022286609 scopus 로고
    • Direct spatial search on pictorial databases using packed R-trees
    • N. Roussopoulos and D. Leifker, "Direct Spatial Search on Pictorial Databases Using Packed R-Trees," Proc. ACM SIGMOD, pp. 17-31, 1985.
    • (1985) Proc. ACM SIGMOD , pp. 17-31
    • Roussopoulos, N.1    Leifker, D.2
  • 29
    • 0036372483 scopus 로고    scopus 로고
    • General match: A subsequence matching method in time-series databases based on generalized windows
    • Y. S. Moon, K. Y. Whang, and W. S. Han, "General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows," Proc. ACM SIGMOD, pp. 382-393, 2002.
    • (2002) Proc. ACM SIGMOD , pp. 382-393
    • Moon, Y.S.1    Whang, K.Y.2    Han, W.S.3
  • 31
    • 3543053391 scopus 로고    scopus 로고
    • Efficient similarity search in protein structure database by K-clique hashing
    • N. Weskamp, D. Kuhn, E. Hullermeier, and G Klebe, "Efficient Similarity Search in Protein Structure Database by K-Clique Hashing," Bioinformatics, vol. 20, no. 10, pp. 1522-1526, 2004.
    • (2004) Bioinformatics , vol.20 , Issue.10 , pp. 1522-1526
    • Weskamp, N.1    Kuhn, D.2    Hullermeier, E.3    G Klebe4
  • 33
    • 0021615874 scopus 로고
    • R-trees: A dynamic index structure for spatial indexing
    • A. Guttman, "R-Trees: A Dynamic Index Structure for Spatial Indexing," Proc. ACM SIGMOD, pp. 44-57, 1984.
    • (1984) Proc. ACM SIGMOD , pp. 44-57
    • Guttman, A.1
  • 34
    • 0000701994 scopus 로고    scopus 로고
    • Distance browsing in spatial databases
    • G. R. Hjaltason and H. Samet, "Distance Browsing in Spatial Databases," ACM Trans. Database Systems, vol. 24, no. 2, pp. 265-318, 1999.
    • (1999) ACM Trans. Database Systems , vol.24 , Issue.2 , pp. 265-318
    • Hjaltason, G.R.1    Samet, H.2
  • 35
    • 1642398164 scopus 로고    scopus 로고
    • Algorithms for processing K-closest-pair queries in spatial databases
    • A. Corral et al., "Algorithms for Processing K-Closest-Pair Queries in Spatial Databases," Data and Knowledge Eng., vol. 49, no. 1, pp. 67-104, 2000.
    • (2000) Data and Knowledge Eng. , vol.49 , Issue.1 , pp. 67-104
    • Corral, A.1
  • 36
    • 0000701994 scopus 로고    scopus 로고
    • Incremental distance join algorithms for spatial databases
    • G. R. Hjaltason and H. Samet, "Incremental Distance Join Algorithms for Spatial Databases," Proc. ACM SIGMOD, pp. 265-318, 1999.
    • (1999) Proc. ACM SIGMOD , pp. 265-318
    • Hjaltason, G.R.1    Samet, H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.