메뉴 건너뛰기




Volumn , Issue , 2007, Pages 371-380

A fast unified optimal route query evaluation algorithm

Author keywords

Distance materialization; Optimal route queries; Route query evaluation

Indexed keywords

BRUTE-FORCE ALGORITHMS; CPU TIME; DISK-BASED; DISTANCE MATERIALIZATION; LARGE NETWORKS; MAIN MEMORIES; MASSIVE GRAPHS; OPTIMAL ROUTE QUERIES; OPTIMIZATION TECHNIQUES; ROUTE QUERY EVALUATION; SEARCH TIME; SHORTEST PATHS; UNIFIED ALGORITHMS; UNIFIED FRAMEWORKS; WEIGHT CHANGES;

EID: 59249086501     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1321440.1321494     Document Type: Conference Paper
Times cited : (7)

References (13)
  • 2
    • 34249091396 scopus 로고    scopus 로고
    • Evaluation and Optimization of Shortest Path Queries
    • July
    • Chan, E.P.F. and Lim, H., Evaluation and Optimization of Shortest Path Queries. VLDB Journal (16:3), pp.343-369,July 2007.
    • (2007) VLDB Journal , vol.16 , Issue.3 , pp. 343-369
    • Chan, E.P.F.1    Lim, H.2
  • 3
    • 0037437597 scopus 로고    scopus 로고
    • Search Space Reduction in QoS Routing
    • Guo, L. and Matt, I, 'Search Space Reduction in QoS Routing, Computer Networks 41(1), pp. 73-88, 2003.
    • (2003) Computer Networks , vol.41 , Issue.1 , pp. 73-88
    • Guo, L.1    Matt, I.2
  • 5
    • 84957804572 scopus 로고    scopus 로고
    • An External-Memory Data Structure for Shortest Path Queries
    • th Annual Combinatorics and Computing Conference, Tokyo, July 26-28, Springer Verlag, pp
    • th Annual Combinatorics and Computing Conference, Tokyo, July 26-28, 1999, Lecture Notes in Computer Science, Vol. 1627, Springer Verlag, pp. 51-60.
    • (1999) Lecture Notes in Computer Science , vol.1627 , pp. 51-60
    • Hutchinson, D.1    Maheshwari, A.2    Zeh, Z.3
  • 6
    • 0035019901 scopus 로고    scopus 로고
    • Multi-Constrained Optimal Path Selection
    • Korkmaz, T., and Krunz, M., Multi-Constrained Optimal Path Selection, in Proceedings of INFOCOM 2001, pp.834-843.
    • (2001) Proceedings of INFOCOM , pp. 834-843
    • Korkmaz, T.1    Krunz, M.2
  • 7
    • 0032071072 scopus 로고    scopus 로고
    • Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its performance Evaluation
    • May/June
    • Jing, N., Huang Y.W. and Rundensteiner, E.A., Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its performance Evaluation, IEEE Transactions on Knowledge and Data Engineering, Vol. 10, No. 3, pp. 123, May/June 1998.
    • (1998) IEEE Transactions on Knowledge and Data Engineering , vol.10 , Issue.3 , pp. 123
    • Jing, N.1    Huang, Y.W.2    Rundensteiner, E.A.3
  • 8
    • 0036709198 scopus 로고    scopus 로고
    • An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
    • September/October
    • Jung, S. and Pramanik, S., An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps, IEEE Transactions on Knowledge and Data Engineering, Vol. 14, No. 5, pp.1029-1046, September/October 2002.
    • (2002) IEEE Transactions on Knowledge and Data Engineering , vol.14 , Issue.5 , pp. 1029-1046
    • Jung, S.1    Pramanik, S.2
  • 12
    • 63449114820 scopus 로고    scopus 로고
    • Files, US Department of Commerce Economics and Statistics Administration, Bureau of Census
    • Tiger/Line Files, US Department of Commerce Economics and Statistics Administration, Bureau of Census, 1998.
    • (1998) Tiger/Line
  • 13
    • 84944033861 scopus 로고    scopus 로고
    • th International Symposium on Spatial and Temporal Databases, pp. 20-35, L.A., CA, July 2001.
    • th International Symposium on Spatial and Temporal Databases, pp. 20-35, L.A., CA, July 2001.


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