{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T06:55:10Z","timestamp":1729666510063,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE Comput. Soc. Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icde.1993.344080","type":"proceedings-article","created":{"date-parts":[[2002,12,30]],"date-time":"2002-12-30T23:29:25Z","timestamp":1041290965000},"page":"31-39","source":"Crossref","is-referenced-by-count":28,"title":["Path computation algorithms for advanced traveller information system (ATIS)"],"prefix":"10.1109","author":[{"given":"S.","family":"Shekhar","sequence":"first","affiliation":[]},{"given":"A.","family":"Kohli","sequence":"additional","affiliation":[]},{"given":"M.","family":"Coyle","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1992.213213"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/67544.66950"},{"key":"ref12","article-title":"Hybrid Transitive Closure Algorithms","author":"agrawal","year":"1990","journal-title":"Proc IEEE 5th Int Conf Very Large Data Bases"},{"key":"ref13","article-title":"On the Computation of the Transitive Closure of Relational Operators","author":"ioannidis","year":"1987","journal-title":"Proc IEEE 5th Int Conf Very Large Data Bases"},{"key":"ref14","article-title":"Transitive Closure of Transitively Closed Relations","author":"valduriez","year":"1989","journal-title":"Proc Itl Conf on Expert Database Systems"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1989.47239"},{"key":"ref16","article-title":"An Efficient Transitive Closure Algorithm, Intl","author":"ioannidis","year":"1988","journal-title":"VLDB J Very Large Data Bases"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1990.113477"},{"key":"ref18","article-title":"An Amateur's Introduction to Recursive Query Processing Strategies","author":"banchillon","year":"1986","journal-title":"Proc ACM SIGMOD Conf Management of Data"},{"journal-title":"On Knowledge Base Management Systems?Integrating Database and AI Systems","year":"1985","author":"banchillon","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/69.60798"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/69.63250"},{"key":"ref6","article-title":"Design and Evaluation of Algorithms to Compute the Transtive Closure of a Database Relation","author":"lu","year":"1987","journal-title":"Proc Int Conf Data Engineering"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/32.42731"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/38713.38750"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-19074-0_47"},{"key":"ref2","article-title":"Excess Travel: Causes, Extent and Consequences","volume":"iiii","author":"king","year":"1987","journal-title":"Transport Res Rec"},{"key":"ref9","article-title":"A Compressed Transitive Closure Technique for Effective Fixed-Point Query Processing","author":"jagadish","year":"1989","journal-title":"Proc Int Conf Database Expert Syst Appl"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/25.69969"},{"key":"ref20","article-title":"Evaluation of Recursive Queries Using Join Indices","author":"valduriez","year":"1986","journal-title":"Intl Conf Expert Database Systems"},{"key":"ref22","article-title":"I\/O Efficiency of Shortest Path Algorithms: An Analysis","author":"jiang","year":"1992","journal-title":"Proc Intl Conf on Data Eng"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0022168"},{"journal-title":"Proc Expert Database Systems","year":"1986","author":"kung","key":"ref24"},{"journal-title":"Introduction to Algorithms","year":"1990","author":"cormen","key":"ref23"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0004-3702(77)90005-4","volume":"8","author":"galperin","year":"1977","journal-title":"On the optimality of A* Artificial Intelligence"},{"key":"ref25","article-title":"Generalized best-first strategies and the optimally of A*","author":"detcher","year":"0","journal-title":"UCLA-ENG-8219"}],"event":{"name":"IEEE 9th International Conference on Data Engineering","location":"Vienna, Austria"},"container-title":["Proceedings of IEEE 9th International Conference on Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx2\/907\/8018\/00344080.pdf?arnumber=344080","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T17:07:42Z","timestamp":1497546462000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/344080\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/icde.1993.344080","relation":{},"subject":[]}}