Browse > Article
http://dx.doi.org/10.12672/ksis.2012.20.2.165

Algorithm for Finding K-Nearest Object Pairs in Circular Search Spaces  

Seon, Hwi-Joon (신경대학교 애니메이션학과)
Kim, Hong-Ki (동신대학교 정보보안학과)
Publication Information
Spatial Information Research / v.20, no.2, 2012 , pp. 165-172 More about this Journal
Abstract
The query of the K closest object pairs between two object sets frequently occurs at recently retrieval systems. The circular location property of objects should be considered for efficiently process queries finding such a K nearest object pair. In this paper, we propose the optimal algorithm finding the K object pairs which are closest to each other in a search space with a circular domain and show its performance by experiments. The proposed algorithm optimizes the cost of finding the K nearest object pairs by using the circular search distances which is much applied the circular location property.
Keywords
Nearest Object Pair; Circular Search Distance; Circular Location Property; Circular Domain;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 A.Coral, Y.Manolopoulos, Y.Theodoridis, 2000, "Closest Pair Queries in Spatial Databases", Proc. ACM SIGMOD Conf., pp.189-200.
2 A.Coral, M.Vassilakopoulos, 2001, "The Impact of Buffering for the Closest Pairs Queries using R-trees", Proc. 5th ADBIS Conf., pp.41-54.
3 A.Coral, Y.Manolopoulos, Y.Theodoridis, M.Vassilakopoulos, 2004, "Algorithms for Processing K-Closest Pair Queries in Spatial Databases", Proc. Data & Knowledge Engineering 49,pp.67-104.
4 G.R.Hjaltason, H.Samet, 1998, "Incremental Dist ance Join Algorithm for Spatial Databases", Proc. of ACM SIGMOD.
5 Y.W.Huang, N.Jing, E.A.Rundensteiner, 1997, "Spatial Joins using R-trees: Breadth-First Traversal with Global Optimization", Proc. 23rd VLDB Conf., pp.396-405.
6 S.A.Nene, S.K.Nayar, 1996, "Closest Point Search in High Dimensions", In Proc. Intl. Conf. on Computer Vision and Pattern Recognition, pp.859-865.
7 N.Beckmann, H.Kriegel, R.Schneider and B. Seeger,1990, "The R*-tree:an Efficient and Robust Access Method for Points and Rectangles", Proc. ACM SIGMOD Int. Conf. on Management of Data, pp.322-331.
8 T.Brinkhoff, H.P.Krigel, B.Seeger, 1993, "Efficient Processing of Spatial Joins using R-Trees", Proc. ACM SIGMOD Conf., pp.237-246.
9 D.Papadias, N.Mamoulis, Y.Theodoridis, 1999, "Processing and Optimization of Multiway Spatial Joins using R-trees", Proc. 18th ACM PODS Conf., pp.44-55.
10 H.J.Seon, et al., 2005, "The Spatial Indexing Method for Supporting a Circular Location Property of Object" In Proc. AIRS, pp. 147-159.
11 김영창 외 1, "분산 그리드 기법을 위한 연속 k-최근접질의처리 알고리즘", 한국공간정보시스템 학회논문지, 11권, 3호, 2009.
12 선휘준, 2009, "객체의 순환적 위치속성을 고려한 최대근접질의 처리 방법", 한국공간정보학회 논문지, 11권, 4호, pp. 85-88.
13 선휘준, 김원호, 2010, "순환검색거리를 이용하는 최대근접질의 처리의 성능분석", 한국컴퓨터정보학회 논문지, 15권, 1호, pp. 83-90.