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 |
Comer, D. (1979), The Ubiquitous B-tree. ACM Computing Surveys, Vol. 11, NO. 2, pp. 121-138.
DOI
ScienceOn
|
3 |
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)
|
4 |
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.
DOI
|
5 |
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.
|
6 |
Bentley, J. L. (1975), Multidimensional Binary Search Trees Used for Associative Searching. Communications of the ACM, Vol. 18, No. 9, pp. 509-517.
DOI
ScienceOn
|
7 |
Bing map(2013), Microsoft, http://www.bing.com/maps(last date accessed: 5 June 2013)
|
8 |
Brinkhoff, T., Kriegel, H. P., and Seeger, B. (1993), Efficient processing of spatial joins using R-trees, pp. 237-246.
|
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
DOI
ScienceOn
|
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.
DOI
ScienceOn
|
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 |
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.
|
15 |
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.
|
16 |
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.
|
17 |
Naver Map (2013), NHN, http://map.naver.com(last date accessed: 3 June 2013)
|
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)
과학기술학회마을
DOI
ScienceOn
|
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.
DOI
ScienceOn
|
22 |
Yahoo Map (2013), Yahoo! Inc., URL: http://maps.yahoo. com(last date accessed: 5 June 2013)
|