Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography (한국측량학회지)

Korean Society of Surveying, Geodesy, Photogrammetry and Cartography (한국측량학회)
권호 표지
DOI QR코드

DOI QR Code

k-Interest Places Search Algorithm for Location Search Map Service

위치 검색 지도 서비스를 위한 k관심지역 검색 기법

  • Cho, Sunghwan (Seoul National University Engineering Research Institute) ;
  • Lee, Gyoungju (Department of Urban Engineering, Korea National University of Transportation) ;
  • Yu, Kiyun (Department of Civil & Environmental Engineering, Seoul National University)
  • Received : 2013.05.29
  • Accepted : 2013.08.12
  • Published : 2013.08.31
Download PDF
⟨ Previous Next ⟩

Abstract

GIS-based web map service is all the more accessible to the public. Among others, location query services are most frequently utilized, which are currently restricted to only one keyword search. Although there increases the demand for the service for querying multiple keywords corresponding to sequential activities(banking, having lunch, watching movie, and other activities) in various locations POI, such service is yet to be provided. The objective of the paper is to develop the k-IPS algorithm for quickly and accurately querying multiple POIs that internet users input and locating the search outcomes on a web map. The algorithm is developed by utilizing hierarchical tree structure of $R^*$-tree indexing technique to produce overlapped geometric regions. By using recursive $R^*$-tree index based spatial join process, the performance of the current spatial join operation was improved. The performance of the algorithm is tested by applying 2, 3, and 4 multiple POIs for spatial query selected from 159 keyword set. About 90% of the test outcomes are produced within 0.1 second. The algorithm proposed in this paper is expected to be utilized for providing a variety of location-based query services, of which demand increases to conveniently support for citizens' daily activities.

최근 인터넷의 발달과 더불어 지리정보시스템(GIS, Geographic Information System)에 대한 인식이 저변 확대되면서 일반인들도 위치 검색 기능을 제공하는 웹GIS를 쉽게 이용할 수 있게 되었다. 현재 서비스되고 있는 모든 위치 검색 기능은 사용자가 하나의 검색어를 입력하고 그에 대한 결과를 보여주는 서비스에 한정되어 있다. 하지만 사용자의 검색 목적이 다양해짐에 따라, 여러 가지 행위를 동시에 할 수 있는 장소를 검색하는 서비스는 없었다. 예를들어, 점심을 먹은 후, 은행에서 업무를 보고, 영화 한 편을 보고자 할 때 이러한 관심 지역(POI, Point of Interest)들이 모여 있는 장소를 필요로 할 수 있다. 따라서 본 논문에서는 사용자로부터 여러 장소를 입력받아 입력된 장소가 모여 있는 곳을 검색해주는 k-IPS 기법을 제안하고자 한다. 여기서 k는 다양한 행위를 할 수 있는 관심의 개수이다. 이 방법은 최소경계사각형(MBR, Minimum Bounding Rectangle)의 계층적 트리 구조인 $R^*$-tree 색인 기법을 이용하여 공간을 분할하고, 기존 공간 Join 연산의 성능 개선을 위하여 $R^*$-tree간의 겹치는 영역 추출하는 재귀적 공간 Join 연산을 구현하였다. k-IPS 기법의 성능 평가는 159개의 다양한 검색어 집합을 구성하여 k=2,3,4,6에 대한 검색 결과를 확인하였다. 실험 결과의 약 90%에 대해서 예상한대로 k개의 검색어 장소가 모여 있는 위치를 얻을 수 있었고, k=2,3,4의 처리 시간은 0.1초 이내의 응답을 얻을 수 있었다. k-IPS 서비스를 통하여 현대인의 순차적 생활 패턴에 맞춘 검색 서비스가 가능할 것으로 판단된다.

Keywords

References

  1. Bae, Y. (2010), Design, Application, and Analysis of Close- 3POI Algorithm for Location Search Map Service based on Web GIS. MD. Dissertation, Seoul National University, Seoul, Korea. (in Korean with English abstract)
  2. Bae, Y., Cho, S., and Yu, K. (2009a), Design of the web map service searching the location of Close-3POI, 2009 GIS joint fall conference, The Korean Society for Geospatial Information System, pp. 201-202. (in Korean with English abstract)
  3. Bae, W., Alkobaisi, S., Kim, S., Narayanappa, S., and Shahabi, C. (2009b), Web data retrieval: solving spatial range queries using k-nearest neighbor searches. Geoinformatica, Vol. 13, No. 4, pp. 483-514. https://doi.org/10.1007/s10707-008-0055-2
  4. Beckmann, N., Kriegel, H. P., Schneider, R., and Seeger, B. (1990), The R*-tree: an efficient and robust access method for points and rectangles, ACM, Vol. 19, No. 2, pp. 322- 331.
  5. Bentley, J. L. (1975), Multidimensional Binary Search Trees Used for Associative Searching. Communications of the ACM, Vol. 18, No. 9, pp. 509-517. https://doi.org/10.1145/361002.361007
  6. Bing map(2013), Microsoft, http://www.bing.com/maps(last date accessed: 5 June 2013)
  7. Brinkhoff, T., Kriegel, H. P., and Seeger, B. (1993), Efficient processing of spatial joins using R-trees, pp. 237-246.
  8. Comer, D. (1979), The Ubiquitous B-tree. ACM Computing Surveys, Vol. 11, NO. 2, pp. 121-138. https://doi.org/10.1145/356770.356776
  9. Corral, A., Manolopoulos, Y., Theodoridis, Y., and Vassilakopoulos, M. (2000), Closest Pair Queries in Spatial Databases. ACM SIGMOD, Vol. 29, No 2, pp. 189-200 https://doi.org/10.1145/335191.335414
  10. Daum Map (2013), Daum Communication, http://local.daum. net(last date accessed: 3 June 2013)
  11. Finkel, R. A. and Bentley, J. L. (1974), Quad Trees - A Data Structure for Retrieval on Composite Keys. Acta Informatica, Vol. 4, No. 1, pp. 1-9. https://doi.org/10.1007/BF00288933
  12. Google Maps (2013), Google Inc., http://maps.google. co.kr(last date accessed: 5 June 2013)
  13. Kim, Y. and Chang, J. (2007), Closest Pairs and e-distance Join Query Processing Algorithms using a POI-based Materialization Technique in Spatial Network Databases. Journal of Korea Spatial Information System Society, Vol.9, No.3, pp.67-80. (in Korean with English abstract)
  14. Kolahdouzan, M. and Shahabi, C. (2004), Voronoi-based k nearest neighbor search for spatial network databases. In Proceedings of the Thirtieth international conference on Very large data bases, VLDB Endowment, Vol. 30, pp. 840-851.
  15. Lee, S., Kim, S., Lee, J., and Yoo, J. (2009), Approximate Indexing in Road Network Databases, 2009 ACM Int'l Symp. on Applied Computing, ACM, pp. 1568-1572.
  16. Naver Map (2013), NHN, http://map.naver.com(last date accessed: 3 June 2013)
  17. Papadias, D., Zhang, J., Mamoulis, N., and Tao, Y. (2003), Query Processing in Spatial Network Databases, In Proc. Int'l Conf. on Very Large Data Bases, VLDB, Vol. 29, pp. 802-813.
  18. Robinson, J. T. (1981), The K-D-B Tree A Search Structure for Large Multidimensional Dynamic Indexes, Proc. of 4CM-SIGMOD Conf., pp. 10-18.
  19. Sellis, T., Roussopoulos, N., and Faloutsos, C. (1987), The r+-tree: A dynamic index for multi-dimensional objects.
  20. Seon, H. and Kim, H. (2012), Algorithm for Finding K-Nearest Object Pairs in Circular Search Spaces. Journal of Korea Spatial Information System Society, Vol. 20, No. 2, pp. 165-172. (in Korean with English abstract) https://doi.org/10.12672/ksis.2012.20.2.165
  21. Shin, H., Moon, B., and Lee, S. (2000), Adaptive multi-stage distance join processing. In ACM SIGMOD Record, ACM, Vol. 29, No. 2, pp. 343-354. https://doi.org/10.1145/335191.335428
  22. Yahoo Map (2013), Yahoo! Inc., URL: http://maps.yahoo. com(last date accessed: 5 June 2013)