{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T05:54:52Z","timestamp":1733982892141,"version":"3.30.2"},"reference-count":29,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3827,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0304-3975(02)00739-9","type":"journal-article","created":{"date-parts":[[2003,3,4]],"date-time":"2003-03-04T17:20:43Z","timestamp":1046798443000},"page":"453-471","source":"Crossref","is-referenced-by-count":4,"title":["Algebraic rewritings for optimizing regular path queries"],"prefix":"10.1016","volume":"296","author":[{"given":"G\u00f6sta","family":"Grahne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Thomo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00739-9_BIB1","doi-asserted-by":"crossref","unstructured":"S. Abiteboul, Querying semistructured data, Proc. Internat. Conf. on Database Theory (ICDT), Delpli, Greece, 1997, pp. 1\u201318.","DOI":"10.1007\/3-540-62222-5_33"},{"year":"1999","series-title":"Data on the Web","author":"Abiteboul","key":"10.1016\/S0304-3975(02)00739-9_BIB2"},{"key":"10.1016\/S0304-3975(02)00739-9_BIB3","doi-asserted-by":"crossref","unstructured":"S. Abiteboul, O.M. Duschka, Complexity of answering queries using materialized views, Proc. 17th ACM Symp. on Principles of Database Systems (PODS), Seattle, WA, 1998, pp. 254\u2013263.","DOI":"10.1145\/275487.275516"},{"year":"1995","series-title":"Foundations of Databases","author":"Abiteboul","key":"10.1016\/S0304-3975(02)00739-9_BIB4"},{"issue":"1","key":"10.1016\/S0304-3975(02)00739-9_BIB5","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/s007990050005","article-title":"The lorel query language for semistructured data","volume":"1","author":"Abiteboul","year":"1997","journal-title":"Internat. J. Digital Libraries"},{"key":"10.1016\/S0304-3975(02)00739-9_BIB6","doi-asserted-by":"crossref","unstructured":"P. Buneman, Semistructured data, Proc. 16th ACM Symp. on Principles of Database Systems (PODS), Tucson, AZ, 1997, pp. 117\u2013121.","DOI":"10.1145\/263661.263675"},{"key":"10.1016\/S0304-3975(02)00739-9_BIB7","doi-asserted-by":"crossref","unstructured":"P. Buneman, S.B. Davidson, M.F. Fernandez, D. Suciu, Adding structure to unstructured data. Proc. Internat. Conf. on Database Theory (ICDT), Delpli, Greece, 1997, pp. 336\u2013350.","DOI":"10.1007\/3-540-62222-5_55"},{"key":"10.1016\/S0304-3975(02)00739-9_BIB8","doi-asserted-by":"crossref","unstructured":"D. Calvanese, G. Giacomo, M. Lenzerini, M.Y. Vardi, Rewriting of regular expressions and regular path queries. Proc. 18th ACM Symp. on Principles of Database Systems (PODS), Philadelphia, PA, 1999, pp. 194\u2013204.","DOI":"10.1145\/303976.303996"},{"key":"10.1016\/S0304-3975(02)00739-9_BIB9","doi-asserted-by":"crossref","unstructured":"D. Calvanese, G. Giacomo, M. Lenzerini, M.Y. Vardi, Answering regular path queries using views. Proc. Internat. Conf. on Data Engineering (ICDE), San Diego, CA, 2000, pp. 389\u2013398.","DOI":"10.1109\/ICDE.2000.839439"},{"key":"10.1016\/S0304-3975(02)00739-9_BIB10","doi-asserted-by":"crossref","unstructured":"D. Calvanese, G. Giacomo, M. Lenzerini, M.Y. Vardi, View-based query processing for regular path queries with inverse, Proc. 19th ACM Symp. on Principles of Database Systems (PODS), Dallas, TX, 2000, pp. 58\u201366.","DOI":"10.1145\/335168.335207"},{"year":"1971","series-title":"Regular Algebra and Finite Machines","author":"Conway","key":"10.1016\/S0304-3975(02)00739-9_BIB11"},{"issue":"11\u201316","key":"10.1016\/S0304-3975(02)00739-9_BIB12","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1016\/S1389-1286(99)00020-1","article-title":"A query language for XML","volume":"31","author":"Deutsch","year":"1999","journal-title":"WWW8\/Comput. Networks"},{"key":"10.1016\/S0304-3975(02)00739-9_BIB13","doi-asserted-by":"crossref","unstructured":"O. Duschka, M.R. Genesereth, Answering recursive queries using views, Proc. 16th ACM Symp. on Principles of Database Systems (PODS), Tucson, AZ, 1997, pp. 109\u2013116.","DOI":"10.1145\/263661.263674"},{"key":"10.1016\/S0304-3975(02)00739-9_BIB14","doi-asserted-by":"crossref","unstructured":"M.F. Fernandez, D. Suciu, Optimizing regular path expressions using graph schemas, Proc. Internat. Conf. on Data Engineering (ICDE), Orlando, FL, 1998, pp. 14\u201323.","DOI":"10.1109\/ICDE.1998.655753"},{"key":"10.1016\/S0304-3975(02)00739-9_BIB15","doi-asserted-by":"crossref","unstructured":"D. Florescu, A.Y. Levy, D. Suciu, Query containment for conjunctive queries with regular expressions, Proc. 17th ACM Symp. on Principles of Database Systems (PODS), Seattle, WA, 1998, pp. 139\u2013148.","DOI":"10.1145\/275487.275503"},{"key":"10.1016\/S0304-3975(02)00739-9_BIB16","doi-asserted-by":"crossref","unstructured":"G. Grahne, A.O. Mendelzon, Tableau techniques for querying information sources through global schemas, Proc. Internat. Conf. on Database Theory (ICDT), Jerusalem, Israel, 1999, pp. 332\u2013347.","DOI":"10.1007\/3-540-49257-7_21"},{"key":"10.1016\/S0304-3975(02)00739-9_BIB17","doi-asserted-by":"crossref","unstructured":"G. Grahne, A. Thomo, An optimization technique for answering regular path queries, Proc. WebDB, Dallas, TX, 2000.","DOI":"10.1007\/3-540-45271-0_14"},{"year":"1979","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","key":"10.1016\/S0304-3975(02)00739-9_BIB18"},{"issue":"2","key":"10.1016\/S0304-3975(02)00739-9_BIB19","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/S0022-0000(76)80038-4","article-title":"On the equivalence, containment, and covering problems for the regular and context-free languages","volume":"12","author":"Hunt","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(02)00739-9_BIB20","unstructured":"L. Kari, On Insertion and deletion in formal languages, Ph.D. Thesis, 1991, Department of Mathematics, University of Turku, Finland."},{"issue":"4","key":"10.1016\/S0304-3975(02)00739-9_BIB21","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1145\/369275.369284","article-title":"Answering queries using views","volume":"29","author":"Levy","year":"2000","journal-title":"SIGMOD Record"},{"key":"10.1016\/S0304-3975(02)00739-9_BIB22","unstructured":"A.Y. Levy, A.O. Mendelzon, Y. Sagiv, D. Srivastava, Answering queries using views, Proc. 14th ACM Symp. on Principles of Database Systems (PODS), San Jose, CA, 1995, pp. 95\u2013104."},{"issue":"1","key":"10.1016\/S0304-3975(02)00739-9_BIB23","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/s007990050004","article-title":"Querying the world wide web","volume":"1","author":"Mendelzon","year":"1997","journal-title":"Internat. J. Digital Libraries"},{"key":"10.1016\/S0304-3975(02)00739-9_BIB24","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1137\/S009753979122370X","article-title":"Finding regular simple paths in graph databases","volume":"246","author":"Mendelzon","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(02)00739-9_BIB25","doi-asserted-by":"crossref","unstructured":"T. Milo, D. Suciu, Index structures for path expressions, Proc. Internat. Conf. on Database Theory (ICDT), Jerusalem, Israel, 1999, pp. 277\u2013295.","DOI":"10.1007\/3-540-49257-7_18"},{"key":"10.1016\/S0304-3975(02)00739-9_BIB26","doi-asserted-by":"crossref","unstructured":"S. Nestorov, J.D. Ullman, J.L. Wiener, S.S. Chawathe, Representative objects: concise representations of semistructured, Hierarchical Data. Proc. Internat. Conf. on Data Engineering (ICDE), Birmingham, UK, 1997, pp. 79\u201390.","DOI":"10.1109\/ICDE.1997.581741"},{"key":"10.1016\/S0304-3975(02)00739-9_BIB27","doi-asserted-by":"crossref","unstructured":"Y. Papakonstantinou, V. Vassalos, Query rewriting for semistructured data, Proc. SIGMOD, Philadelphia, PA, 1999, pp. 455\u2013466.","DOI":"10.1145\/304182.304222"},{"year":"1996","series-title":"Introduction to the Theory of Computation","author":"Sipser","key":"10.1016\/S0304-3975(02)00739-9_BIB28"},{"key":"10.1016\/S0304-3975(02)00739-9_BIB29","doi-asserted-by":"crossref","unstructured":"J.D. Ullman, Information integration ising logical views, Proc. Internat. Conf. on Database Theory (ICDT) 1997, pp. 19\u201340.","DOI":"10.1007\/3-540-62222-5_34"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502007399?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502007399?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T22:28:29Z","timestamp":1733956109000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502007399"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0304397502007399"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00739-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}