Journal of KIISE:Databases (한국정보과학회논문지:데이타베이스)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

An Efficient Dynamic Path Query Processing Method for Digital Road Map Databases

디지털 로드맵 데이터베이스에서 효율적인 동적 경로 질의어 처리 방안

  • Published : 2001.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

In navigation system, a primary task is to compute the minimum cost route from the current location to the destination. One of major problems for navigation systems is that a significant amount of computation time is required when the digital road map is large. Since navigation systems are real time systems, it is critical that the path be computed while satisfying a time constraint. In this paper, we have developed a HiTi(Hierarchical MulTi) graph model for hierarchically structuring large digital road maps to speedup the minimum cost path computation. We propose a new shortest path algorithm named SPAH, which utilizes HiTi graph model of a digital road map for its computation. We prove that the shortest path computed by SPAH is the optimal. Our performance analysis of SPAH also showed that it significantly reduces the computation time over exiting methods. We present an in-depth experimental analysis of HiTi graph method by comparing it with other similar works.

차량 항법 시스템에서 가장 중요한 기능중의 하나는 현재 위치로부터 목적지까지의 가능한 경로들 최단경로를 계산하는 일이다. 차량 항법 시스템의 중요한 어려움 중 하나는 대용량 디지털 로드맵상에서 최단경로를 구할 때 많은 계산 시간이 소요된다는 점이다. 차량 항법 시스템은 실시간 시스템이므로, 제한 시간을 만족하여 최소 비용 경로를 계산하는 것은 매 우 중요하다. 본 논문에서는 대용량의 디지털 로드맵(Road Maps)에서 최단 경로 계산을 효 율적이고 빠르게 하기 위해서 디지털 로드맵을 효율적으로 계층 구조화하는 HiTi(Hierarchical MulTi) 그래프 모델을 개발하였다. 제안된 HiTi 그래프 모델에 기반을 둔 SPAH라는 새로운 최단 경로 알고리즘을 제안하고, SPAH가 계산한 최단경로의 최적성 (Optimality)을 증명하였다. SPAH의 성능분석을 통하여 SPAH가 기존의 다른 최단 경로 계 산 알고리즘들 보다 훨씬 빠르게 최단경로를 계산한다는 것을 보여주었다. HiTi 그래프 방 법은 여러 가지 측면에서 다른 유사한 방법들과 상세하게 성능실험을 통하여 장.단점이 비 교 분석되어 졌다.

Keywords

References

  1. R. Agrawal and H. Jagadish, 'Algorithms for Searching Massive Graphs,' In IEEE Transactions on Knowledge and Data Engineering, Vol. 6, No.2, pp.225-238, April 1994 https://doi.org/10.1109/69.277767
  2. R. Kung, E. Hanson, Y. Ioannnidis, T. Sellis, L. Shapiro, and M. Stonebraker, 'Heuristic Search in Data Base System,' In Proc. 1st Int. Workshop Expert Database Systems, pp.96-107, Oct. 1984
  3. R. Agrawal, S. Dar, and H. Jagadish, 'Direct Transitive Closure Algorithms; Design and Performance Evaluation,' In ACM Transactions on Database System, Vol. 15, No.3, pp.427-458, September 1990 https://doi.org/10.1145/88636.88888
  4. S. Dar and R. Ramakirishnan, 'A Performance Study of Transitive Closure Algorithms,' In Proc. ACM-SIGMOD 1994 Int'l Conference on Management of Data, pp.454-465, 1994 https://doi.org/10.1145/191843.191928
  5. K. Hua, J. Su, and C. Hua, 'Efficient Evaluation of Traversal Recursive Queries Using Connectivity Index,' In Proc. IEEE 9th Int'l Conf. on Data Engineering, pp.549-558, 1993 https://doi.org/10.1109/ICDE.1993.344025
  6. Y. Ioannidis and R. Ramakirishnan, 'Efficient Transitive Closure Algorithms,' In Proc. of the 14th VLDB Conference, pp.382-394, 1988
  7. Y. Ioannidis, R. Ramakirishnan, and L. Winger 'Transitive Closure Algorithms Based on Graph Traversal,' In ACM Transactions on Database Systems, Vol. 18, No.3, pp.513-576, September 1993 https://doi.org/10.1145/155271.155273
  8. B. Jiang, 'A Suitable Algorithm of Computing Partial Transitive Closures in Databases,' In Proc. IEEE 6th Int'l Conf. Data engineeringm pp.264-271, 1990 https://doi.org/10.1109/ICDE.1990.113477
  9. G. Qadah, L. Henschen, and J. Kim, 'Efficient Algorithms for the Instantiated Transitive Closure Queries,' In IEEE Transactions on Software Engineering, Vol. 17, No. 3, pp.296-309, March 1991 https://doi.org/10.1109/32.75418
  10. A. Rosenthal, S. Heiler, U. Dayal, and F. Manola, 'Traversal Recursion: A practical approach to supporting recursive applications' In Proc. IEEE 3rd Int'l Conf. Data Engineering, pp.580-590, 1987
  11. I. Toroslu and G. Qadah, 'The Efficient Computation of Strong Partial Transitive-Closures,' In Proc. IEEE 9th Int'l Conf. Data Engineering, pp.530-537, 1993 https://doi.org/10.1109/ICDE.1993.344027
  12. Y. Huang, N. Jing, and E. Rundensteiner, 'Hierarchical Path Views: A Model Based on Fragmentation and Transportation Road Types,' In Proc. of the 3rd ACM Workshop on Geographic Information Systems, pp.93-100, 1995
  13. K. Ishikawa, M. Ogawa, S. Azume, and T. Ito, 'Map Navigation Software of the Electro Multivision of the '91 Toyota Soarer,' Int. Conf. on Vehicle Navigation and Information Systems (VNIS IVHS), IEEE, (1991) 463-473
  14. B. Liu, S. Choo, S. Lok, S. Leong, S. Lee, F. Poon, and H. Tan, 'Integrating Case-Based Reasoning, Knowledge-Based Approach and Dijkstra Algorithm for Route Finding,' Proc. Tenth Conf. Artificial Intelligence for Applicatons (CAIA '94), pp.149-155, 1994 https://doi.org/10.1109/CAIA.1994.323680
  15. J. Shapiro, J. Waxman, and D. Nir, 'Level Graphs and Approximate Shortest Path Algorithms,' In Networks, Vol. 22, pp.691-717, 1992 https://doi.org/10.1002/net.3230220707
  16. T. Yang, S. Shekhar, B. Hamidzadeh, and P. Hancock, 'Path Planning and Evaluation in IVHS Database,' IEEE Int'l Conf. on Vehicle Navigation and Information Systems(VNIS IVHS), pp.283-290, 1991
  17. N. Jing, Y. Huang, and E. Rundensteiner, 'Hierarchical Optimization of Optimal Path Finding for Transportation Applications,' In roc. of 5th Int'l Conf. on Information and Knowledge Management, pp.261-268, 1996 https://doi.org/10.1145/238355.238550
  18. N. Jing, Y. Huang, and E. Rundensteiner, 'Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation,' In IEEE Transactions on Knowledge and Data Engineering, Vol. 10, No. 3, pp.409-432, May/June 1998 https://doi.org/10.1109/69.687976
  19. R. Goldman, N. Shivakumar, S. Venkatasubramanian, and H. Gracia-Molina, 'Proximity Search in Databases,' In Proceedings of the 24th VLDB Conference, pp.26-37, 1998
  20. S. Shekhar, A. Fetterer, and B. Goyal, 'Materialization Trade-Offs in Hierarchical Shortest Path Algorithms,' In Proc.1997 Symposium on Spatial Databases, 1997
  21. W. McCormick Jr., P. Schweitzer, and T. White, 'Problem Decomposition and Data Reorganization by a Clustering Technique,' In Operation Research, Vol. 20, No. 5, pp.993-1009, 1972
  22. R. Lipton and R. Tarjan, 'Application of a planar seperator theorem,' In SIAM Journal on Computing, Vol. 9, No. 3, pp.615-627, 1980 https://doi.org/10.1137/0209046
  23. G. Miller, S. Teng, and S. Vavasis, 'A unified geometric approach to graph separators,' In Proceedings of 31st Annual Symposium on Foundations of Computer Science, pp.538-547, 1991 https://doi.org/10.1109/SFCS.1991.185417
  24. G. Miller, S. Teng, W. Thurston, and S. Vavasis, 'Automatic mesh partitioning,' In A. George, J. Gilbert, and J. Liu, editors, Sparse Matrix Computations: Graph Theory Issues and Algorithms, (An IMA Workshop Volume), Springer-Verlag, New York, 1993
  25. M. Houstma, P. Apers, and G. Schipper, 'Data Fragmentation for Parallel Transitive Closure Strategies,' In Proc. IEEE 9th Int'l Conference on Data Engineering, pp.447-456, 1993 https://doi.org/10.1109/ICDE.1993.344036
  26. D. Galperin, 'On the optimality of A*,' In Artificial Intelligence, Vol. 8, No. 1, pp.69-76, 1977 https://doi.org/10.1016/0004-3702(77)90005-4
  27. R. Agrawal and J. Kierman, 'An Access Structure for Generalized Transitive Closure Queries,' In Proc. IEEE Ninth Int'l Conf. on Data Engineering, pp.429-438, April, 1993 https://doi.org/10.1109/ICDE.1993.344038
  28. J. Banerjee, S. Kim, W. Kim, and J. Garza, 'Clustering a DAG for CAD Databases,' In IEEE Transaction on Software Engineering, Vol. 14, No. 11, pp.1684-1699, 1998 https://doi.org/10.1109/32.9055
  29. P. Larson and V. Deshpande, 'A File Structure Supporting Traversal Recursion,' In Proc. ACM-SIGMOD 1989 Int'l Conference on Management of Data, pp.243-252, 1989 https://doi.org/10.1145/66926.66949
  30. S. Shekhar and D. Liu, 'CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations,' In IEEE Transaction on Knowledge and Data Engineering, Vol. 9, No. 1, pp.102-119, 1997 https://doi.org/10.1109/69.567054
  31. S. Shekhar, A. Kohli, and M. Coyle, 'Path Computation Algorithms for Advanced Traveler Information System (ATIS),' In Proc. IEEE 9th Int'l Conf. Data engineering, pp.31-39, 1993 https://doi.org/10.1109/ICDE.1993.344080
  32. J. Pearl, In Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison Wesley, Reading, Mass., 1984
  33. Y. Huang, H. Jing, and E. Rundensteiner, 'Effective Graph Clustering for Path Queries in Digital Map Databases,' In Proc. 5th Int'l Conference on Information and Knowledge Management, pp.215-222, 1996 https://doi.org/10.1145/238355.238497
  34. T. Mohr and C. Pasche, 'A Parallel Shortest Path Algorithm,' Computing, Vol. 40, pp.281-292, 1988 https://doi.org/10.1007/BF02276912