Browse > Article

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

Lee, Sang-Cheol (한양대학교)
Kim, Sang-Uk (한양대학교)
Publication Information
Information and Communications Magazine / v.25, no.7, 2008 , pp. 16-23 More about this Journal
Keywords
Citations & Related Records
연도 인용수 순위
  • Reference
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   DOI   ScienceOn
2 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
3 Y. Tao et al., "Continuous Nearest Neighbor Search," In Proc. Int'l Conf. on fiery Large Data Bases, VLDB, pp. 287-298, 2002
4 N. Mamaulis and D. Papadias, "Multiway Spatial loins," ACM Trans. on Database Systems, TODS, Vol. 26, No. 4, pp. 424-475, 2001   DOI   ScienceOn
5 이상철, 김상욱, "도로네트워크 데이터베이스를 위한 근사 인덱싱," 한국정보처리학회 춘계학술발표대회 문문집, vol. 14, No. 1, pp. 61-62, 2007년 5월
6 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
7 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.   DOI   ScienceOn
8 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
9 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
10 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
11 D. Papadias et al., "Multidimensional Range Query Processing with Spatial Relations," Journal of Geographical Systems, Vol. 4, No.4, pp, 343-365,1997   DOI
12 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.
13 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.
14 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.
15 N. Roussopoulos et al., "Nearest neighbor queries," In Proc. Int'I Conf. on Management of Data , SIGMOD, pp. 71-79, 1995.
16 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
17 Y. Li et al., "Continuous K Nearest Neighbor Queries in Spatial Network Databases," GeoInformatica, Vol. 9, No.4, pp. 321-341, 2005.   DOI
18 S. Chaudhuri and L. Gravona, "Evaluating Top-k Selection Queries," In Proc. Int'l Conf. on fiery Large Database, VLDB, pp. 397-410,1999
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 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.
21 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.
22 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.
23 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.