Spatial Information Research

Korea Spatial Information Society (대한공간정보학회)
권호 표지
DOI QR코드

DOI QR Code

An Efficient Range Search Technique in Road Networks

도로 네트워크에서 효율적인 범위 검색 기법

  • Park, Chun Geol (EN-CORE GROUP) ;
  • Kim, Jeong Joon (Dept. of Computer Science and Engineering, Konkuk University) ;
  • Park, Ji Woong (Dept. of Computer Information System, Gyeonggi College of Science and Technology) ;
  • Han, Ki Joon (Dept. of Computer Science and Engineering, Konkuk University)
  • Received : 2013.02.04
  • Accepted : 2013.07.22
  • Published : 2013.08.31
Download PDF
⟨ Previous Next ⟩

Abstract

Recently, R&D(Research and Development) is processing actively on range search in the road network environments. However, the existing representative range search techniques have shortcomings in that the greater the number of POI's, the more increased storage space or the more increased search time due to inefficient search process. Accordingly, In this paper, we proposed a range search technique using QRMP(QR-tree using Middle Point) to solve the problems of conventional range search techniques. In addition, we made a formula to obtain the total size of the storage space for QRMP and proved the excellence of the range search technique proposed in this paper through the experiment using actual road networks and POI data.

최근 도로 네트워크 환경에서 범위 검색에 관한 연구가 활발히 진행되고 있다. 그러나 기존의 대표적인 범위 검색 기법들은 POI(Point of Interest)의 개수가 많을수록 저장 공간이 증가하거나 비효율적인 검색 과정으로 인해 검색 시간이 오래 걸리는 단점이 있다. 따라서 본 논문에서는 이러한 기존 범위 검색 기법들의 문제점을 해결하기 위해 QRMP(QR-tree using Middle Point)를 이용하는 범위 검색 기법을 제시하였다. 그리고 QRMP의 전체 저장 공간 크기를 구하는 수식을 산출하고, 또한 실제 도로 네트워크와 POI 데이터를 이용한 실험을 통해 본 논문에서 제안하는 범위 검색 기법의 우수성을 입증하였다.

Keywords

References

  1. Frentzos, E; Gratsias, K; Theodoridis, Y. 2007, Towards the Next Generation of Location-based Services, Proc. of the Int. Workshop on Web and Wireless Geographical Information Systems, LNCS 4857, 202-215.
  2. Huang, X; Jensen, C. S; Lu, H; Sltenis, S. 2007, S-GRID: A Versatile Approach to Efficient Query Processing in Spatial Networks, Proc. of the International Symposium on SSTD, LNCS 4605, 93-111.
  3. Hu, H. B; Lee, D. L; Lee, C. V. S. 2006, Distance Indexing on Road Networks, Proc. of the International Conference on VLDB, 894-905.
  4. Kang, H. K; Shin, I. S; Kim, J. J; Han, K. J. 2010, MR-Tree: A Mapping-based R-Tree for Efficient Spatial Searching, Journal of KSIS, 18(4):109-120.
  5. Lin, H. Y. 2008, Efficient and Compact Indexing Structure for Processing of Spatial Queries in Line-based Databases, Journal of Data and Knowledge Engineering, 64(1):365-380. https://doi.org/10.1016/j.datak.2007.09.009
  6. Papadias, D; Theodoridis, Y; Stefanakis, E. 1997, Multidimensional Range Query Processing with Spatial Relations, Journal of Geographical Systems, 4(4):343-365.
  7. Papadias, D; Zhang, J; Mamoulis, N; Tao, Y. 2003, Query Processing in Spatial Network Databases, Proc. of the International Conference VLDB, 802-813.
  8. Park, C. G; Kang, H. K; Kim, J. J; Han, K. J. 2009, A Hash-based R-tree for Fast Search of Large Spatial Data, Proc. of the International Conference on EDB, 5-50.
  9. Park, C. G; Kim, J. J; Han, K. J. 2013, Efficient POI Search for Location-based Services in Road Networks, Journal of KIISE: Database, 40 (2):141-151.
  10. Park, C. G. 2012, Efficient POI Search for Location-based Services in Road Networks, Konkuk University.
  11. Park, C. G; Park, H. H; Kang, H. K; Han, K. J. 2007, Development of an OpenGIS Spatial Interface based on Oracle, Journal of KSIS, 9(2):1-11.