메뉴 건너뛰기




Volumn 3633, Issue , 2005, Pages 73-90

The islands approach to nearest neighbor querying in spatial networks

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DATABASE SYSTEMS; INPUT OUTPUT PROGRAMS; MICROPROCESSOR CHIPS;

EID: 26444489074     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11535331_5     Document Type: Conference Paper
Times cited : (56)

References (29)
  • 1
    • 84948772383 scopus 로고    scopus 로고
    • Nearest neighbor and reverse nearest neighbor queries for moving objects
    • R. Benetis, C. S. Jensen, G. Karciauskas, S. Saltenis. Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects. In Proc. IDEAS, pp. 44-53, 2002.
    • (2002) Proc. IDEAS , pp. 44-53
    • Benetis, R.1    Jensen, C.S.2    Karciauskas, G.3    Saltenis, S.4
  • 3
    • 0026396076 scopus 로고
    • An improved two-way partitioning algorithm with stable performance
    • C. K. Cheng, Y. C. Wei. An Improved Two-Way Partitioning Algorithm with Stable Performance. In IEEE Trans. CAD, 10(12), pp. 1502-1511, 1991.
    • (1991) IEEE Trans. CAD , vol.10 , Issue.12 , pp. 1502-1511
    • Cheng, C.K.1    Wei, Y.C.2
  • 4
    • 35048845305 scopus 로고    scopus 로고
    • Modelling temporally variable transportation networks
    • Z. Ding, R. H. Güting. Modelling Temporally Variable Transportation Networks. In Proc. DASFAA, pp. 154-168, 2004.
    • (2004) Proc. DASFAA , pp. 154-168
    • Ding, Z.1    Güting, R.H.2
  • 7
    • 85012120082 scopus 로고    scopus 로고
    • Integrated data management for mobile services in the real world
    • C. Hage, C. S. Jensen, T. B. Pedersen, L. Speičys, and I. Timko. Integrated Data Management for Mobile Services in the Real World. In Proc. VLDB, pp. 1019-1030, 2003.
    • (2003) Proc. VLDB , pp. 1019-1030
    • Hage, C.1    Jensen, C.S.2    Pedersen, T.B.3    Speičys, L.4    Timko, I.5
  • 8
    • 0030385808 scopus 로고    scopus 로고
    • Effective graph clustering for path queries in digital map databases
    • Y. W. Huang, N. Jing, and E. Rundenstener. Effective Graph Clustering for Path Queries in Digital Map Databases. In Proc. CIKM, pp. 215-222, 1996.
    • (1996) Proc. CIKM , pp. 215-222
    • Huang, Y.W.1    Jing, N.2    Rundenstener, E.3
  • 9
    • 26444472087 scopus 로고    scopus 로고
    • The islands approach to nearest neighbor querying in spatial networks
    • Department of Computer Science, Aalborg University
    • X. Huang, C. S. Jensen, and S. Šaltenis. The Islands Approach to Nearest Neighbor Querying in Spatial Networks. DB Tech Report TR-12. Department of Computer Science, Aalborg University, 2005.
    • (2005) DB Tech Report , vol.TR-12
    • Huang, X.1    Jensen, C.S.2    Šaltenis, S.3
  • 10
    • 0000701994 scopus 로고    scopus 로고
    • Distance browsing in spatial databases
    • G. R. Hjaltason and H. Samet. Distance Browsing in Spatial Databases. In TODS, 24(2), pp. 265-318, 1999.
    • (1999) TODS , vol.24 , Issue.2 , pp. 265-318
    • Hjaltason, G.R.1    Samet, H.2
  • 11
    • 85012111044 scopus 로고    scopus 로고
    • Continuous K-nearest neighbor queries for continuously moving points with updates
    • G. S. Iwerks, H. Samet, K. Smith. Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates. In Proc. VLDB, pp. 512-523, 2003.
    • (2003) Proc. VLDB , pp. 512-523
    • Iwerks, G.S.1    Samet, H.2    Smith, K.3
  • 13
    • 85117329200 scopus 로고    scopus 로고
    • Voronoi-based nearest neighbor search for spatial network databases
    • M. Kolahdouzan and C. Shahabi. Voronoi-Based Nearest Neighbor Search for Spatial Network Databases. In Proc. VLDB, pp. 840-851, 2004.
    • (2004) Proc. VLDB , pp. 840-851
    • Kolahdouzan, M.1    Shahabi, C.2
  • 14
    • 26444554225 scopus 로고    scopus 로고
    • Continuous K-nearest neighbor search for spatial network databases
    • M. Kolahdouzan and C. Shahabi. Continuous K-Nearest Neighbor Search for Spatial Network Databases. In Proc. STDBM, pp. 33-40, 2004.
    • (2004) Proc. STDBM , pp. 33-40
    • Kolahdouzan, M.1    Shahabi, C.2
  • 17
    • 85012217314 scopus 로고    scopus 로고
    • Query processing in spatial network databases
    • D. Papadias, J. Zhang, N. Mamoulis, Y. Tao. Query Processing in Spatial Network Databases. In Proc. VLDB, pp. 802-813, 2003.
    • (2003) Proc. VLDB , pp. 802-813
    • Papadias, D.1    Zhang, J.2    Mamoulis, N.3    Tao, Y.4
  • 19
    • 19544391837 scopus 로고    scopus 로고
    • Computational data modeling for network constrained moving objects
    • L. Speičys, C. S. Jensen, A. Kligys. Computational Data Modeling for Network Constrained Moving Objects. In Proc. ACMGIS, pp. 118-125, 2003.
    • (2003) Proc. ACMGIS , pp. 118-125
    • Speičys, L.1    Jensen, C.S.2    Kligys, A.3
  • 20
    • 0032094249 scopus 로고    scopus 로고
    • Optimal multi-step k-nearest neighbor search
    • T. Seidl, H. P. Kriegel. Optimal Multi-Step k-Nearest Neighbor Search. In Proc. SIGMOD, pp. 154-165, 1998.
    • (1998) Proc. SIGMOD , pp. 154-165
    • Seidl, T.1    Kriegel, H.P.2
  • 21
    • 0141794311 scopus 로고    scopus 로고
    • A road network embedding technique for K-nearest neighbor search in moving object databases
    • C. Shahabi, M. R. Kolahdouzan, M. Sharifzadeh. A Road Network Embedding Technique for K-Nearest Neighbor Search in Moving Object Databases. In GeoInformatica, 7(3), pp. 255-273, 2003.
    • (2003) GeoInformatica , vol.7 , Issue.3 , pp. 255-273
    • Shahabi, C.1    Kolahdouzan, M.R.2    Sharifzadeh, M.3
  • 22
    • 0030734554 scopus 로고    scopus 로고
    • CCAM: A connectivity-clustered access method for networks and network computations
    • S. Shekhar, D. Liu. CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations. In TKDE, 19(1), pp. 102-119, 1997.
    • (1997) TKDE , vol.19 , Issue.1 , pp. 102-119
    • Shekhar, S.1    Liu, D.2
  • 23
    • 84944076278 scopus 로고    scopus 로고
    • K-nearest neighbor search for moving query point
    • Z. Song, N. Roussopoulos. K-Nearest Neighbor Search for Moving Query Point. In Proc. SSTD, pp. 79-96, 2001.
    • (2001) Proc. SSTD , pp. 79-96
    • Song, Z.1    Roussopoulos, N.2
  • 24
    • 0037788772 scopus 로고    scopus 로고
    • Continuous nearest neighbor search
    • Y. Tao, D. Papadias, Q. Shen. Continuous Nearest Neighbor Search. In Proc. VLDB, pp. 287-298, 2002.
    • (2002) Proc. VLDB , pp. 287-298
    • Tao, Y.1    Papadias, D.2    Shen, Q.3
  • 25
    • 84944033861 scopus 로고    scopus 로고
    • A spatio temporal model and language for moving objects on road networks
    • M. Vazirgiannis, O. Wolfson. A Spatio Temporal Model and Language for Moving Objects on Road Networks. In Proc. SSTD, pp. 20-35, 2001.
    • (2001) Proc. SSTD , pp. 20-35
    • Vazirgiannis, M.1    Wolfson, O.2
  • 26
    • 26444585244 scopus 로고    scopus 로고
    • http://www.census.gov/geo/www/tiger/tgrcd108/tgr108cd.html.
  • 27
    • 28044449142 scopus 로고    scopus 로고
    • SEA-CNN: Scalable processing of continuous K-nearest neighbor queries in spatio-temporal databases
    • X. Xiong, M. F. Mokbel, W. G. Aref. SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases. In ICDE, 2005.
    • (2005) ICDE
    • Xiong, X.1    Mokbel, M.F.2    Aref, W.G.3
  • 28
    • 84944319598 scopus 로고    scopus 로고
    • Indexing the distance: An efficient method to KNN processing
    • C. Yu, B. C. Ooi, K. L. Tan, H. V. Jagadish. Indexing the Distance: An Efficient Method to KNN Processing. In Proc. VLDB, pp. 421-430, 2001.
    • (2001) Proc. VLDB , pp. 421-430
    • Yu, C.1    Ooi, B.C.2    Tan, K.L.3    Jagadish, H.V.4
  • 29
    • 17844367341 scopus 로고    scopus 로고
    • Route nearest neighbor queries
    • J. S. Yoo, S. Shekhar. In-Route Nearest Neighbor Queries. In GeoInformatica, 9(2), pp. 117-137, 2005.
    • (2005) GeoInformatica , vol.9 , Issue.2 , pp. 117-137
    • Yoo, J.S.1    Shekhar, S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.