{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T08:51:43Z","timestamp":1760345503421,"version":"3.43.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["GeoInformatica"],"published-print":{"date-parts":[[1997,8]]},"DOI":"10.1023\/a:1009784527790","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T17:50:41Z","timestamp":1040579441000},"page":"125-159","source":"Crossref","is-referenced-by-count":12,"title":["A Hierarchical Path View Model for Path Finding in Intelligent Transportation Systems"],"prefix":"10.1007","volume":"1","author":[{"given":"Yun-Wu","family":"Huang","sequence":"first","affiliation":[]},{"given":"Ning","family":"Jing","sequence":"additional","affiliation":[]},{"given":"ElkeA","family":"Rundensteiner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"142477_CR1","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1145\/88636.88888","volume":"15","author":"R. Agrawal","year":"1990","unstructured":"R. Agrawal, S. Dar and H.V. Jagadish. Direct Transitive \u201cClosure Algorithms: Design and Performance Evaluation,\u201d ACM Transactions on Database Systems, Vol. 15,No. 3, pp. 427\u2013458, 1990.","journal-title":"ACM Transactions on Database Systems"},{"key":"142477_CR2","unstructured":"R. Agrawal and H.V. Jagadish, 1990, \u201cHybrid Transitive Closure Algorithms,\u201d Proc. of the 16th VLDB, pp. 326\u2013334."},{"key":"142477_CR3","unstructured":"A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms, Addison-Wesley, pp. 207\u2013209, 1974."},{"key":"142477_CR4","volume-title":"On Knowledge Base Management Systems\u2014Integrating Database and AI systems","author":"F. Bancilhon","year":"1985","unstructured":"F. Bancilhon. \u201cNaive Evaluation of Recursively Defined Relations,\u201d in On Knowledge Base Management Systems\u2014Integrating Database and AI systems, Springer-Verlag: New York, 1985."},{"key":"142477_CR5","volume-title":"Graphs and Networks","author":"B. Carr","year":"1979","unstructured":"B. Carr. Graphs and Networks, Clarendon Press, Oxford, England, 1979."},{"key":"142477_CR6","doi-asserted-by":"crossref","unstructured":"E.W. Dijkstra. \u201cA Note on Two Problems in Connection with Graphs,\u201d Numerische Mathematik, pp. 269\u2013271, 1959.","DOI":"10.1007\/BF01386390"},{"key":"142477_CR7","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0020-0190(81)90026-0","volume":"12","author":"J. Ebert","year":"1959","unstructured":"J. Ebert. \u201cA Sensitive Transitive Closure Algorithm,\u201d Information Processing Letters, 12., pp. 255\u2013258, 1959.","journal-title":"Information Processing Letters"},{"key":"142477_CR8","doi-asserted-by":"crossref","unstructured":"M.J. Egenhofer. \u201cWhat's Special about Spatial?\u201d Database Requirements for Vehicle Navigation in Geographic Space, Proc. of the 1993 ACM SIGMOD Int'l Conf. on Management of Data, pp. 398\u2013402, 1993.","DOI":"10.1145\/170035.170096"},{"key":"142477_CR9","doi-asserted-by":"crossref","unstructured":"M.A.W. Houstma, P.M.G. Apers and S. Ceri. \u201cComplex Transitive Closure Queries on a Fragmented Graph,\u201d Proc. of the 3rd Int'l Conf. on Data Theory, Lecture Notes in Computer Science, Springer-Verlag, pp. 470\u2013484, 1990.","DOI":"10.1007\/3-540-53507-1_96"},{"key":"142477_CR10","unstructured":"M.A.W. Houstma, P.M.G. Apers, and S. Ceri. \u201cDistributed Transitive Closure Computations: The Disconnection Set Approach,\u201d Proc. of the 16th VLDB., pp. 335\u2013346, 1990."},{"key":"142477_CR11","doi-asserted-by":"crossref","unstructured":"M.A.W. Houstma, P.M.G. Apers, and G.L.V. Schipper. Data Fragmentation for Parallel Transitive Closure Strategies, Proc. of the 9th Int'l Conf. on Data Engineering, pp. 447\u2013456, 1993.","DOI":"10.1109\/ICDE.1993.344036"},{"key":"142477_CR12","doi-asserted-by":"crossref","unstructured":"M.A.W. Houstma, F. Cacace, and S. Ceri. \u201cParallel Hierarchical Evaluation of Transitive Closure Queries,\u201d 1st Int'l Conf. on Parallel and Distributed Inf. Sys., pp. 130\u2013137, 1990.","DOI":"10.1109\/PDIS.1991.183080"},{"key":"142477_CR13","unstructured":"Yun-Wu Huang, Ning Jing, and A. Elke Rundensteiner. \u201cA Semi-Materialized View Approach for Route Maintenance in IVHS,\u201d Proc. of the 2nd ACM Workshop on Geographic Information Systems, pp. 144\u2013151, 1994."},{"key":"142477_CR14","unstructured":"Yun-Wu Huang, Ning Jing, and A. Elke Rundensteiner. \u201cHierarchical Path Views: A Model Based on Fragmentation and Transportation Road Types,\u201d Proc. of the 3nd ACM Workshop on Geographic Information Systems, 1995."},{"key":"142477_CR15","doi-asserted-by":"crossref","unstructured":"Yun-Wu Huang, Ning Jing, and A. Elke Rundensteiner. \u201cEffective Graph Clustering for Path Queries in Digital Map Databases,\u201d Proc. of 5th Int'l Conf. on Information and Knowledge Management, pp. 215\u2013222, 1996","DOI":"10.1145\/238355.238497"},{"key":"142477_CR16","unstructured":"Y.E. Ioannidis. \u201cOn the Computation of the Transitive Closure of Relational Operators,\u201d Proc. 12th Int'l Conf. on VLDB, pp. 403\u2013411, 1986."},{"key":"142477_CR17","unstructured":"Y.E. Ioannidis and R. Ramakrishnan. \u201cAn Efficient Transitive Closure Algorithm,\u201d Proc. 14th Int'l Conf. on VLDB, pp. 382\u2013394, 1988."},{"key":"142477_CR18","doi-asserted-by":"crossref","unstructured":"Y. Ioannidis, R. Ramakrishnan, and L. Winger. \u201cTransitive Closure Algorithms Based on Graph Traversal,\u201d ACM Trans. on Database Systems, Vol. 18,No. 3, pp. 512\u2013576.","DOI":"10.1145\/155271.155273"},{"key":"142477_CR19","doi-asserted-by":"crossref","unstructured":"Ning Jing, Yun-Wu Huang, and A. Elke Rundensteiner. \u201cHierarchical Optimization of Optimal Path Finding for Transportation Applications,\u201d Proc. of 5th Int'l Conf. on Information and Knowledge Management, pp. 261\u2013268, 1996.","DOI":"10.1145\/238355.238550"},{"key":"142477_CR20","unstructured":"Laurel. IVHS architecture requirement document, 1994."},{"issue":"5","key":"142477_CR21","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1287\/opre.20.5.993","volume":"20","author":"W.T. McCormick Jr.","year":"1972","unstructured":"W.T.Jr. McCormick, P.J. Schweitzer, and T.W. White. \u201cProblem Decomposition and Data Reorganization by a Clustering Technique,\u201d Operations Research, Vol. 20,No. 5, pp. 993\u20131009, 1972.","journal-title":"Operations Research"},{"key":"142477_CR22","doi-asserted-by":"crossref","unstructured":"A. Rosenthal, S. Heiler, U. Dayal, and F. Manola. \u201cTraversal Recursion: A Practical Approach to Supporting Recursive Applications,\u201d Proc. ACM-SIGMOD, pp. 166\u2013176, 1986.","DOI":"10.1145\/16856.16871"},{"key":"142477_CR23","doi-asserted-by":"crossref","unstructured":"S. Shekhar, A. Kohli, and M. Coyle. \u201cPath Computation Algorithms for Advanced Traveller Information Systems,\u201d IEEE 9th Int'l Conf. on Data Engineering, pp. 31\u201339, 1993.","DOI":"10.1109\/ICDE.1993.344080"},{"issue":"1","key":"142477_CR24","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S. Warshall","year":"1962","unstructured":"S. Warshall. \u201cA Theorem on Boolean Matrices,\u201d JACM, 9,1, pp. 11\u201312, 1962.","journal-title":"JACM"},{"key":"142477_CR25","doi-asserted-by":"crossref","unstructured":"T.A. Yang, S. Shekhar, B. Hamidzadeh, and P.A. Hancock. \u201cPath Planning and Evaluation in IVHS Databases,\u201d VNIS, pp. 283\u2013290, 1991.","DOI":"10.1109\/VNIS.1991.205774"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009784527790.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009784527790\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009784527790.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T20:36:58Z","timestamp":1754426218000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009784527790"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["142477"],"URL":"https:\/\/doi.org\/10.1023\/a:1009784527790","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"type":"print","value":"1384-6175"},{"type":"electronic","value":"1573-7624"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}