{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:45:55Z","timestamp":1725540355051},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642049569"},{"type":"electronic","value":"9783642049576"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04957-6_2","type":"book-chapter","created":{"date-parts":[[2009,11,2]],"date-time":"2009-11-02T06:46:36Z","timestamp":1257144396000},"page":"13-24","source":"Crossref","is-referenced-by-count":5,"title":["Ranking Approximate Query Rewritings Based on Views"],"prefix":"10.1007","author":[{"given":"H\u00e9l\u00e8ne","family":"Jaudoin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Colomb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Pivert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Abiteboul, S., Duschka, O.M.: Complexity of answering queries using materialized views. In: Proc. of PODS 1998, pp. 254\u2013263 (1998)","DOI":"10.1145\/275487.275516"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.tcs.2006.08.020","volume":"368","author":"F. Afrati","year":"2006","unstructured":"Afrati, F., Li, C., Mitra, P.: Rewriting queries using views in the presence of arithmetic comparisons. Theoretical Computer Science\u00a0368, 88\u2013123 (2006)","journal-title":"Theoretical Computer Science"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1007\/978-3-540-30075-5_29","volume-title":"Database and Expert Systems Applications","author":"Z. Bellahs\u00e8ne","year":"2004","unstructured":"Bellahs\u00e8ne, Z., Roantree, M.: Querying distributed data in a super-peer based architecture. In: Galindo, F., Takizawa, M., Traunm\u00fcller, R. (eds.) DEXA 2004. LNCS, vol.\u00a03180, pp. 296\u2013305. Springer, Heidelberg (2004)"},{"key":"2_CR4","volume-title":"Hypergraphs","author":"C. Berge","year":"1989","unstructured":"Berge, C.: Hypergraphs. North-Holland, Amsterdam (1989)"},{"key":"2_CR5","unstructured":"Dalvi, N., Suciu, D.: Answering queries from statistics and probabilistic views. In: Proc. of VLDB 2005, pp. 805\u2013816. VLDB Endowment (2005)"},{"key":"2_CR6","unstructured":"Das, G., Gunopulos, D., Koudas, N., Tsirogiannis, D.: Answering top-k queries using views. In: Proc. of VLDB 2006, pp. 451\u2013462. VLDB Endowment (2006)"},{"key":"2_CR7","unstructured":"Dong, X., Halevy, A., Yu, C.: Data integration with uncertainty. In: Proc. of VLDB 2007, pp. 687\u2013698. VLDB Endowment (2007)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM J.\u00a024(6) (1995)","DOI":"10.1137\/S0097539793250299"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Eiter, T., Makino, K., Gottlob, G.: Computational aspects of monotone dualization: A brief survey. Discrete Appl. Math. DOI\u00a010 (2007)","DOI":"10.1016\/j.dam.2007.04.017"},{"issue":"4","key":"2_CR10","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/s007780100054","volume":"10","author":"A. Halevy","year":"2001","unstructured":"Halevy, A.: Answering queries using views: A survey. VLDB Journal\u00a010(4), 270\u2013294 (2001)","journal-title":"VLDB Journal"},{"key":"2_CR11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume":"43","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. Complexity of Computer Computations\u00a043, 85\u2013103 (1972)","journal-title":"Complexity of Computer Computations"},{"key":"2_CR12","unstructured":"Knuth, D.E.: Dancing links. Arxiv preprint cs.DS\/0011047 (2000)"},{"key":"2_CR13","unstructured":"Pottinger, R., Levy, A.Y.: A scalable algorithm for answering queries using views. In: Proc. of VLDB 2000, San Francisco, CA, USA, pp. 484\u2013495 (2000)"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1145\/1376616.1376702","volume-title":"Proc. of SIGMOD 2008","author":"A. Das Sarma","year":"2008","unstructured":"Das Sarma, A., Dong, X., Halevy, A.: Bootstrapping pay-as-you-go data integration systems. In: Proc. of SIGMOD 2008, pp. 861\u2013874. ACM, New York (2008)"}],"container-title":["Lecture Notes in Computer Science","Flexible Query Answering Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04957-6_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:46:16Z","timestamp":1606185976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04957-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642049569","9783642049576"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04957-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}