Information and Communications Magazine (정보와 통신)

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

도로 네트워크를 위한 k-최근접 이웃 질의의 처리 방안

  • Published : 2008.06.28
Download PDF
⟨ Previous Next ⟩

Abstract

텔레매틱스에서 위치 정보 서비스를 효과적으로 제공하기 위해 이동 객체와 더불어 시설물과 같은 정적 객체에 대한 위치 정보를 효과적으로 관리하는 데이터베이스 기술들이 요구된다 본 논문에서는 도로 네트워크 데이터베이스를 위한 인덱싱 및 질의 처리 기술 현황에 대하여 고찰한다. 텔레매틱스에서는 영역 질의, k-최근접 이웃 질의, 연속 k-최근접 이웃 질의, 공간 조인 질의 등이 발생하며, 이 중 k-최근접 이웃 질의가 빈발하게 발생한다. k-최근접 이웃 질의를 처리하기 위한 효과적인 방안으로 IER, INE, $VN^3$, 근사 인덱싱 기법 등이 있다. 본 논문에서는 각 기법의 개념, 알고리즘, 장단점에 대하여 고찰한다.

Keywords

References

  1. S. Duri et al., "Data Protection and Data Sharing in Telematics," Mobile Networks and Applications, MONET, Vol. 9, No.6, pp. 693-701, 2004 https://doi.org/10.1023/B:MONE.0000042507.74516.00
  2. Y. Theodoridis and D. Papadias, "Range Queries Involving Spatial Relations: A Performance Analysis," In Proc. Int'l Conf. on Spatial Information Theory, COSIT, pp. 537-551, 1995
  3. G. Proietti and C. Faloutsos, "I/O Complexity for Range Queries on Region Data Stored Using an R-tree," In Proc. Int'l Conf. on Data Engineering, ICDE, pp. 628-635,1999
  4. B. Pagel et al., 'Towards an Analysis of Range Query Performance in Spatial Data Structures," In Proc. Int' I Symp. on Principles of Database Systems, PODS, pp. 214-221, 1993
  5. D. Papadias et al., "Multidimensional Range Query Processing with Spatial Relations," Journal of Geographical Systems, Vol. 4, No.4, pp, 343-365,1997 https://doi.org/10.1007/s101090200091
  6. C. Jensen et al., 'Nearest Neighbor Queries in Road Networks," In Proc. lnt'l Symp. on Advances in geographic information systems, ACM GIS, pp. 1-8, 2003
  7. Z. Song and N. Roussopoulos, 'X-Nearest Neighbor Search for Moving Query Point," In Proc. Int'l Symp. on Advances in Spatial and Temporal Databases, SSTD, pp.79-96, 2001.
  8. S. Chaudhuri and L. Gravona, "Evaluating Top-k Selection Queries," In Proc. Int'l Conf. on fiery Large Database, VLDB, pp. 397-410,1999
  9. N. Roussopoulos et al., "Nearest neighbor queries," In Proc. Int'I Conf. on Management of Data , SIGMOD, pp. 71-79, 1995.
  10. Y. Tao et al., "Continuous Nearest Neighbor Search," In Proc. Int'l Conf. on fiery Large Data Bases, VLDB, pp. 287-298, 2002
  11. G. Iwerks et al., "Continuous k-Nearest Neighbor Queries for Continuously Moving Points with Updates," In Proc. Int'l Conf. on Very Large Data Bases, VLDB, pp. 512-523, 2003.
  12. Y. Li et al., "Continuous K Nearest Neighbor Queries in Spatial Network Databases," GeoInformatica, Vol. 9, No.4, pp. 321-341, 2005. https://doi.org/10.1007/s10707-005-4575-8
  13. M. Kolahdouzan and C. Shahabi, "Alternative Solutions for Continuous K Nearest Neighbor Queries in Spatial Newark Databases," Geolrformatica, Vol. 9, No.4, pp. 321-341, 2005. https://doi.org/10.1007/s10707-005-4575-8
  14. T. Brinkhoff et al., 'Efficient Processing of Spatial Joins Using R-trees," In Proc. ACM Int'I. Conf. on Management of Data, ACM SIGMOD, pp. 237-246, 1993.
  15. C. Faloutsos et al., "Spatial Join Selectivity Using Power Laws," In Proc. ACM Int'I. Conf. on Management of Data, ACM SIGMOD, pp. 177-188,2000.
  16. N. Mamoulis and D. Papadias, "Slot Index Spatial loin," IEEE Trans. on Knowledge and Data Engineering, TKDE, Vol.1. 15, No.1, pp. 211-231, 2003.
  17. N. Mamaulis and D. Papadias, "Multiway Spatial loins," ACM Trans. on Database Systems, TODS, Vol. 26, No. 4, pp. 424-475, 2001 https://doi.org/10.1145/503099.503101
  18. D. Papadias et al., "Query Processing in Spatial Network Databases," In Proc. Int'l Conf. on very Large Data Bases, VLDB, pp. 802-813, 2003
  19. M. Kolahdouzan and C. Shahabi, 'Voronoi-Based K-Nearest Neighbor Search for Spatial Network Databases," In Proc. Int'l Conf. on very Large Data Bases, VLDB, pp. 840-851, 2004
  20. 이상철, 김상욱, "도로네트워크 데이터베이스를 위한 근사 인덱싱," 한국정보처리학회 춘계학술발표대회 문문집, vol. 14, No. 1, pp. 61-62, 2007년 5월
  21. A. Guttman, "R-Trees: A Dynamic Index Structure for Spatial Searching," In Proc. ACM Int'I. Conf. on Management of Data, ACM SIGMOD, pp. 47-57, 1984.
  22. N. Beckmann et al., 'The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles," In Proc. ACM Int'I. Conf. on Management of Data, ACM SIGMOD, pp. 322-331, 1990
  23. C. Faloutsos and K. Lin, "FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets," In Proc. ACM Int'l. Conf. on Management of Data, ACM SIGMOD, pp. 163-174, 1995.