{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T22:24:49Z","timestamp":1748298289171},"reference-count":7,"publisher":"Association for Computing Machinery (ACM)","issue":"13","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2014,8]]},"abstract":"<jats:p>\n            The data needed to answer queries is often available through Web-based APIs. Indeed, for a given query there may be many Web-based sources which can be used to answer it, with the sources overlapping in their vocabularies, and differing in their access restrictions (required arguments) and cost. We introduce PDQ (Proof-Driven Query Answering), a system for determining a query plan in the presence of web-based sources. It is: (i)\n            <jats:italic>constraint-aware<\/jats:italic>\n            -- exploiting relationships between sources to rewrite an expensive query into a cheaper one, (ii)\n            <jats:italic>access-aware<\/jats:italic>\n            -- abiding by any access restrictions known in the sources, and (iii)\n            <jats:italic>cost-aware<\/jats:italic>\n            -- making use of any cost information that is available about services. PDQ takes the novel approach of\n            <jats:italic>generating query plans from proofs that a query is answerable.<\/jats:italic>\n            We demonstrate the use of PDQ and its effectiveness in generating low-cost plans.\n          <\/jats:p>","DOI":"10.14778\/2733004.2733028","type":"journal-article","created":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T15:37:52Z","timestamp":1431445072000},"page":"1553-1556","source":"Crossref","is-referenced-by-count":15,"title":["PDQ"],"prefix":"10.14778","volume":"7","author":[{"given":"Michael","family":"Benedikt","sequence":"first","affiliation":[{"name":"Oxford University, UK"}]},{"given":"Julien","family":"Leblay","sequence":"additional","affiliation":[{"name":"Oxford University, UK"}]},{"given":"Efthymia","family":"Tsamoura","sequence":"additional","affiliation":[{"name":"Oxford University, UK"}]}],"member":"320","published-online":{"date-parts":[[2014,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594550"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.11.008"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304210"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JIIS.0000012467.66268.9e"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/502030.502032"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807212"},{"key":"e_1_2_1_7_1","volume-title":"VLDB","author":"Srivastava U.","year":"2006","unstructured":"U. Srivastava , K. Munagala , J. Widom , and R. Motwani . Query optimization over web services . In VLDB , 2006 . U. Srivastava, K. Munagala, J. Widom, and R. Motwani. Query optimization over web services. In VLDB, 2006."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2733004.2733028","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:41:55Z","timestamp":1672220515000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2733004.2733028"}},"subtitle":["proof-driven query answering over web-based data"],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":7,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["10.14778\/2733004.2733028"],"URL":"https:\/\/doi.org\/10.14778\/2733004.2733028","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2014,8]]}}}