{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T15:34:15Z","timestamp":1673451255063},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2013,11]]},"abstract":"<jats:p>Data integration systems offer a uniform interface for querying a large number of autonomous and heterogeneous data sources. Ideally, answers are returned as sources are queried and the answer list is updated as more answers arrive. Choosing a good ordering in which the sources are queried is critical for increasing the rate at which answers are returned. However, this problem is challenging since we often do not have complete or precise statistics of the sources, such as their coverage and overlap. It is further exacerbated in the Big Data era, which is witnessing two trends in Deep-Web data: first, obtaining a full coverage of data in a particular domain often requires extracting data from thousands of sources; second, there is often a big variation in overlap between different data sources.<\/jats:p>\n          <jats:p>\n            In this paper we present\n            <jats:bold>OASIS<\/jats:bold>\n            , an\n            <jats:bold>O<\/jats:bold>\n            nline query\n            <jats:bold>A<\/jats:bold>\n            nswering\n            <jats:bold>S<\/jats:bold>\n            ystem for overlapp\n            <jats:bold>I<\/jats:bold>\n            ng Sources.\n            <jats:bold>OASIS<\/jats:bold>\n            has three key components for source ordering. First, the\n            <jats:bold>Overlap Estimation<\/jats:bold>\n            component estimates overlaps between sources according to available statistics under the\n            <jats:italic>Maximum Entropy<\/jats:italic>\n            principle. Second, the\n            <jats:bold>Source Ordering<\/jats:bold>\n            component orders the sources according to the new contribution they are expected to provide, and adjusts the ordering based on statistics collected during query answering. Third, the\n            <jats:bold>Statistics Enrichment<\/jats:bold>\n            component selects critical missing statistics to enrich at runtime. Experimental results on both real and synthetic data show high efficiency and scalability of our algorithm.\n          <\/jats:p>","DOI":"10.14778\/2732232.2732233","type":"journal-article","created":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T15:37:52Z","timestamp":1431445072000},"page":"133-144","source":"Crossref","is-referenced-by-count":7,"title":["Online ordering of overlapping data sources"],"prefix":"10.14778","volume":"7","author":[{"given":"Mariam","family":"Salloum","sequence":"first","affiliation":[{"name":"UC Riverside"}]},{"given":"Xin Luna","family":"Dong","sequence":"additional","affiliation":[{"name":"Google Inc."}]},{"given":"Divesh","family":"Srivastava","sequence":"additional","affiliation":[{"name":"AT&amp;T Labs-Research"}]},{"given":"Vassilis J.","family":"Tsotras","sequence":"additional","affiliation":[{"name":"UC Riverside"}]}],"member":"320","published-online":{"date-parts":[[2013,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11687238_48"},{"key":"e_1_2_1_2_1","volume-title":"ASU TR 06--019","author":"Chokshi B.","year":"2006","unstructured":"B. Chokshi , T. Hernandez , and S. Kambhampati . Relevance and overlap aware text collection selection . In ASU TR 06--019 , 2006 . B. Chokshi, T. Hernandez, and S. Kambhampati. Relevance and overlap aware text collection selection. In ASU TR 06--019, 2006."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/2180912.2180920"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27819-1_33"},{"key":"e_1_2_1_5_1","first-page":"216","volume-title":"VLDB","author":"Florescu D.","year":"1997","unstructured":"D. Florescu , D. Koller , and A. Y. Levy . Using probabilistic information in data integration . In VLDB , pages 216 -- 225 , 1997 . D. Florescu, D. Koller, and A. Y. Levy. Using probabilistic information in data integration. In VLDB, pages 216--225, 1997."},{"key":"e_1_2_1_6_1","unstructured":"Lindo systems: Optimization software. http:\/\/www.lindo.com\/.  Lindo systems: Optimization software. http:\/\/www.lindo.com\/."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402731"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.76"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807095"},{"key":"e_1_2_1_10_1","volume-title":"VLDB","author":"Roth A.","year":"2007","unstructured":"A. Roth . Completeness-driven query answering in peer data management systems . In VLDB , 2007 . A. Roth. Completeness-driven query answering in peer data management systems. In VLDB, 2007."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1951365.1951414"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687624"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544865"},{"key":"e_1_2_1_14_1","volume-title":"AAAI Workshop on AI and Info. Integration","author":"Vassalos V.","year":"1998","unstructured":"V. Vassalos and Y. Papakonstantinou . Using knowledge of redundancy for query optimization in mediators . In AAAI Workshop on AI and Info. Integration , 1998 . V. Vassalos and Y. Papakonstantinou. Using knowledge of redundancy for query optimization in mediators. In AAAI Workshop on AI and Info. Integration, 1998."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2732232.2732233","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:18:43Z","timestamp":1672219123000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2732232.2732233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["10.14778\/2732232.2732233"],"URL":"https:\/\/doi.org\/10.14778\/2732232.2732233","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2013,11]]}}}