This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation
May/June 1998 (vol. 10 no. 3)
pp. 409-432

Abstract—Efficient path computation is essential for applications such as intelligent transportation systems (ITS) and network routing. In ITS navigation systems, many path requests can be submitted over the same, typically huge, transportation network within a small time window. While path precomputation (path view) would provide an efficient path query response, it raises three problems which must be addressed: 1) precomputed paths exceed the current computer main memory capacity for large networks; 2) disk-based solutions are too inefficient to meet the stringent requirements of these target applications; and 3) path views become too costly to update for large graphs (resulting in out-of-date query results). We propose a hierarchical encoded path view (HEPV) model that addresses all three problems. By hierarchically encoding partial paths, HEPV reduces the view encoding time, updating time and storage requirements beyond previously known path precomputation techniques, while significantly minimizing path retrieval time. We prove that paths retrieved over HEPV are optimal. We present complete solutions for all phases of the HEPV approach, including graph partitioning, hierarchy generation, path view encoding and updating, and path retrieval. In this paper, we also present an in-depth experimental evaluation of HEPV based on both synthetic and real GIS networks. Our results confirm that HEPV offers advantages over alternative path finding approaches in terms of performance and space efficiency.

[1] R. Agrawal, S. Dar, and H. Jagadish, “Direct Transitive Closure Algorithms: Design and Performance Evaluation,” ACM Trans. Database Systems, vol. 15, no. 3, pp. 427-458, Sept. 1990.
[2] R. Agrawal and H.V. Jagadish, "Efficient Search in Very Large Databases," Proc. 14th VLDB Conf., pp. 407-418, 1988.
[3] R. Agrawal and H. Jagadish, “Materialization and Incremental Update of Path Information,” Proc. IEEE Fifth Int'l Conf. Data Eng., pp. 374-383, 1989.
[4] R. Agrawal and H.V. Jagadish, "Hybrid Transitive Closure Algorithms," Proc. 16th VLDB Conf.,Brisbane, Australia, pp. 326-334, 1990.
[5] R. Agrawal and J. Kiernan, " An Access Structure for Generalized Transitive Closure Queries," Proc. Ninth Int'l Conf. Data Eng., pp. 429-438. IEEE, Apr. 1993.
[6] G. Ausiello and G.F. Italiano, "Incremental Algorithms for Minimal Length Paths," J. Algorithms, vol. 12, pp. 615-638, 1991.
[7] R.E. Bellman, "On A Routing Problem," Quarterly Applications Math., vol. 16, pp. 87-90, 1958.
[8] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGraw-Hill, 1990.
[9] E.W. Dijkstra, "A Note on Two Problems in Connection with Graph Theory," Numerische Mathematik, vol. 1, pp. 269-271, 1959.
[10] M.J. Egenhofer, "What's Special About Spatial? Database Requirements for Vehicle Navigation in Geographic Space," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 398-402, 1993.
[11] M.A.W. Houstma, P.M.G. Apers, and S. Ceri, "Complex Transitive Closure Queries on a Fragmented Graph," Proc. Third Int'l Conf. Data Theory, Lecture Notes in Computer Science, Springer-Verlag, pp. 470-484, 1990.
[12] M.A.W. Houstma, P.M.G. Apers, and S. Ceri, "Distributed Transitive Closure Computations: The Disconnection Set Approach," Proc. 16th VLDB Conf., pp. 335-346, 1990.
[13] M. Houstma, P. Apers, and G. Schipper, “Data Fragmentation for Parallel Transitive Closure Strategies,” Proc. IEEE Ninth Int'l Conf. Data Eng., pp. 447-456, 1993.
[14] M.A.W. Houstma, F. Cacace, and S. Ceri, "Parallel Hierarchical Evaluation of Transitive Closure Queries," Proc. First Int'l Conf. Parallel and Distributed Information Systems, pp. 130-137, 1990.
[15] Y.-W. Huang, N. Jing, and E.A. Rundensteiner, "A Semi-Materialized View Approach for Route Maintenance in Intelligent Vehicle Highway Systems," Proc. Second ACM Workshop Geographic Information Systems, pp. 144-151, Nov. 1994.
[16] Y.-W. Huang, N. Jing, and E.A. Rundensteiner, "Hierarchical Path Views: A Model Based on Fragmentation and Transportation Road Types," Proc. Third ACM Workshop Geographic Information Systems, pp. 93-100, Nov. 1995.
[17] Y.-W. Huang, N. Jing, and E.A. Rundensteiner, "Path Queries for Transportation Networks: Dynamic Reordering and Sliding Window Paging Techniques," Proc. Fourth ACM Workshop Geographic Information Systems, Nov. 1996.
[18] Y.-W. Huang, N. Jing, and E.A. Rundensteiner, "Evaluation of Hierarchical Path Finding Techniques for ITS Route Guidance," Proc. Sixth Ann. Meeting ITS-Am., 1996.
[19] Y. Huang, N. Jing, and E. Rundensteiner, “Effective Graph Clustering for Path Queries in Digital Map Databases,” Proc. Fifth Int'l Conf. Information and Knowledge Management, pp. 215-222, 1996.
[20] Y.-W. Huang, N. Jing, and E.A. Rundensteiner, "Query Processing Strategies for Spatial Path Queries," Proc. IEEE Int'l Conf. Data Eng.,England, 1997.
[21] K. Hua, J. Su, and C. Hua, “Efficient Evaluation of Traversal Recursive Queries Using Connectivity Index,” Proc. IEEE Ninth Int'l Conf. Data Eng., pp. 549-558, 1993.
[22] M.A.W. Houstma, A.N. Wilslchut, and J. Flokstra, "Implementation and Performance Evaluation of a Parallel Transitive Closure Algorithm on PRISMA/DB," Proc. 19th VLDB Conf., pp. 206-217, 1993.
[23] Y. Ioannidis and R. Ramakirishnan, “Efficient Transitive Closure Algorithms,” Proc. 14th VLDB Conf., pp. 382-394, 1988.
[24] Y. Ioannidis, R. Ramakrishnan, and L. Winger, "Transitive Closure Algorithms Based on Graph Traversal," ACM Trans. Database Systems, vol. 18, no. 3, Sept. 1993.
[25] N. Jing, Y. Huang, and E. Rundensteiner, “Hierarchical Optimization of Optimal Path Finding for Transportation Applications,” Proc. Fifth Int'l Conf. Information and Knowledge Management, pp. 261-268, 1996.
[26] S. Jung and S. Pramanik, "HiTi Graph Model of Topological Road Maps in Navigation Systems," Proc. 12th Int'l Conf. Data Eng., pp. 76-84, 1996.
[27] J. Krozel and D. Andrisani II, "Intelligent e-Optimal Path Prediction for Vehicular Travel," IEEE Trans. Systems, Man, and Cybernetics, vol. 25, no. 2, pp. 345-353, Feb. 1995.
[28] C.-K. Lee, "A Multiple-Path Routing Strategy for Vehicle Route Guidance Systems," Transportation Research, vol. 2, no. 3, pp. 185-195, 1994.
[29] Loral Federal Systems, IVHS Architecture Phase One Final Report, Federal Highway Admin., DTFH61-93-C-00211, 1994.
[30] W.T. McCormick Jr., P.J. Schweitzer, and T.W. White, "Problem Decomposition and Data Reorganization by a Clustering Technique," Operations Research, vol. 20, no. 5, pp. 993-1,009, 1972.
[31] J. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley, Reading, Mass., 1984.
[32] S. Shekhar, A. Kohli, and M. Coyle, "Path Computation Algorithms for Advanced Traveler Information System," Proc. Ninth Int'l Conf. Data Eng., pp. 31-39, IEEE, Apr. 1993.
[33] T.A. Yang, S. Shekhar, B. Hamidzadeh, and P.A. Hancock, "Path Planning and Evaluation in IVHS Databases," VNIS, pp. 283-290, 1991.

Index Terms:
Path queries, path view materialization, hierarchical path search, GIS databases, graph partitioning.
Citation:
Ning Jing, Yun-Wu Huang, Elke A. Rundensteiner, "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. 409-432, May-June 1998, doi:10.1109/69.687976
Usage of this product signifies your acceptance of the Terms of Use.