{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T20:43:19Z","timestamp":1765485799512},"reference-count":17,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2009,8]]},"abstract":"<jats:p>We study the problem of querying XML data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially infinite) families of XPath queries. To compactly specify such families of queries we adopt the Query Set Specifications [14], a formalism close to context-free grammars.<\/jats:p>\n          <jats:p>\n            We say that query\n            <jats:italic>Q<\/jats:italic>\n            is\n            <jats:italic>expressible<\/jats:italic>\n            by the specification\n            <jats:italic>P<\/jats:italic>\n            if it is equivalent to some expansion of\n            <jats:italic>P<\/jats:italic>\n            .\n            <jats:italic>Q<\/jats:italic>\n            is\n            <jats:italic>supported<\/jats:italic>\n            by\n            <jats:italic>P<\/jats:italic>\n            if it has an equivalent rewriting using some finite set of\n            <jats:italic>P<\/jats:italic>\n            's expansions. We study the complexity of expressibility and support and identify large classes of XPath queries for which there are efficient (PTIME) algorithms. Our study considers both the case in which the XML nodes in the results of the queries lose their original identity and the one in which the source exposes persistent node ids.\n          <\/jats:p>","DOI":"10.14778\/1687627.1687662","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"301-312","source":"Crossref","is-referenced-by-count":10,"title":["Efficient rewriting of XPath queries using Query Set Specifications"],"prefix":"10.14778","volume":"2","author":[{"given":"Bogdan","family":"Cautis","sequence":"first","affiliation":[{"name":"Telecom ParisTech"}]},{"given":"Alin","family":"Deutsch","sequence":"additional","affiliation":[{"name":"UC San Diego"}]},{"given":"Nicola","family":"Onose","sequence":"additional","affiliation":[{"name":"UC San Diego"}]},{"given":"Vasilis","family":"Vassalos","sequence":"additional","affiliation":[{"name":"Athens Univ. of Economics and Business"}]}],"member":"320","published-online":{"date-parts":[[2009,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-002-0076-7"},{"key":"e_1_2_1_2_1","volume-title":"VLDB","author":"Arion A.","year":"2007","unstructured":"A. Arion , V. Benzaken , I. Manolescu , and Y. Papakonstantinou . Structured materialized views for XML queries . In VLDB , 2007 . A. Arion, V. Benzaken, I. Manolescu, and Y. Papakonstantinou. Structured materialized views for XML queries. In VLDB, 2007."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316697"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.10.030"},{"key":"e_1_2_1_5_1","volume-title":"WebDB","author":"Cautis B.","year":"2008","unstructured":"B. Cautis , A. Deutsch , and N. Onose . XPath rewriting using multiple views: Achieving completeness and efficiency . In WebDB , 2008 . B. Cautis, A. Deutsch, and N. Onose. XPath rewriting using multiple views: Achieving completeness and efficiency. In WebDB, 2008."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1514894.1514905"},{"key":"e_1_2_1_7_1","volume-title":"TR CS2009-0941","author":"Cautis B.","unstructured":"B. Cautis , A. Deutsch , N. Onose , and V. Vassalos . Efficient rewriting of XPath queries using Query Set Specifications, 2009 . TR CS2009-0941 , UCSD. Available from http:\/\/db.ucsd.edu\/index.jsp?pageStr=publications. B. Cautis, A. Deutsch, N. Onose, and V. Vassalos. Efficient rewriting of XPath queries using Query Set Specifications, 2009. TR CS2009-0941, UCSD. Available from http:\/\/db.ucsd.edu\/index.jsp?pageStr=publications."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007634"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1599"},{"key":"e_1_2_1_10_1","volume-title":"VLDB","author":"Mandhani B.","year":"2005","unstructured":"B. Mandhani and D. Suciu . Query caching and view selection for XML databases . In VLDB , 2005 . B. Mandhani and D. Suciu. Query caching and view selection for XML databases. In VLDB, 2005."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/962446.962448"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/998688.1007114"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/645346.650617"},{"key":"e_1_2_1_14_1","first-page":"99","volume-title":"WebDB","author":"Petropoulos M.","year":"2003","unstructured":"M. Petropoulos , A. Deutsch , and Y. Papakonstantinou . The Query Set Specification Language (QSSL) . In WebDB , pages 99 -- 104 , 2003 . M. Petropoulos, A. Deutsch, and Y. Papakonstantinou. The Query Set Specification Language (QSSL). In WebDB, pages 99--104, 2003."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497496"},{"issue":"1","key":"e_1_2_1_16_1","volume":"43","author":"Vassalos V.","year":"2000","unstructured":"V. Vassalos and Y. Papakonstantinou . Expressive capabilities description languages and query rewriting algorithms. J. Log. Program. , 43 ( 1 ), 2000 . V. Vassalos and Y. Papakonstantinou. Expressive capabilities description languages and query rewriting algorithms. J. Log. Program., 43(1), 2000.","journal-title":"Expressive capabilities description languages and query rewriting algorithms. J. Log. Program."},{"key":"e_1_2_1_17_1","volume-title":"VLDB","author":"Xu W.","year":"2005","unstructured":"W. Xu and Z. M. \u00d6zsoyoglu . Rewriting XPath queries using materialized views . In VLDB , 2005 . W. Xu and Z. M. \u00d6zsoyoglu. Rewriting XPath queries using materialized views. In VLDB, 2005."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1687627.1687662","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:26:43Z","timestamp":1672226803000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1687627.1687662"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["10.14778\/1687627.1687662"],"URL":"https:\/\/doi.org\/10.14778\/1687627.1687662","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2009,8]]}}}