메뉴 건너뛰기




Volumn 1, Issue , 2006, Pages 58-62

Using dijkstra's algorithm to incrementally find the K-nearest neighbors in spatial network databases

Author keywords

Index structures; Location based services; Nearest neighbors; Spatial databases

Indexed keywords

ALGORITHMS; DATA REDUCTION; DATA STORAGE EQUIPMENT; QUERY LANGUAGES;

EID: 33751039070     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1141277.1141291     Document Type: Conference Paper
Times cited : (21)

References (12)
  • 1
    • 14244254616 scopus 로고    scopus 로고
    • Indexing the trajectories of moving objects in networks
    • V. T. Almeida and R. H. Güting. Indexing the trajectories of moving objects in networks. GeoInformatica, 9(1), 2005.
    • (2005) GeoInformatica , vol.9 , Issue.1
    • Almeida, V.T.1    Güting, R.H.2
  • 2
    • 33751032811 scopus 로고    scopus 로고
    • Algorithm alley
    • J. Boyer. Algorithm alley. Dr. Dobb's, (9701), 1997.
    • (1997) Dr. Dobb's , Issue.9701
    • Boyer, J.1
  • 4
    • 34147120474 scopus 로고
    • A note on two problems in connection with graphs
    • E. W. Dijkstra. A note on two problems in connection with graphs. Numerische Mathematik, 1:269-271, 1959.
    • (1959) Numerische Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 5
    • 0023384210 scopus 로고
    • Fibonacci heaps and their uses in improved network optimization algorithms
    • M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM, 34(3):596-615, 1987.
    • (1987) J. ACM , vol.34 , Issue.3 , pp. 596-615
    • Fredman, M.L.1    Tarjan, R.E.2
  • 6
    • 0000701994 scopus 로고    scopus 로고
    • Distance browsing in spatial databases
    • G. R. Hjaltason and H. Samet. Distance browsing in spatial databases. ACM Trans. Database Syst., 24(2):265-318, 1999.
    • (1999) ACM Trans. Database Syst. , vol.24 , Issue.2 , pp. 265-318
    • Hjaltason, G.R.1    Samet, H.2
  • 12
    • 0030734554 scopus 로고    scopus 로고
    • CCAM: A connectivity-clustered access method for networks and network computations
    • S. Shekhar and D. Liu. CCAM: A connectivity-clustered access method for networks and network computations. IEEE Trans. Knowl. Data Eng., 9(1):102-119, 1997.
    • (1997) IEEE Trans. Knowl. Data Eng. , vol.9 , Issue.1 , pp. 102-119
    • Shekhar, S.1    Liu, D.2


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