%0 Conference Paper %1 DBLP:conf/vldb/DongHY07 %A Dong, Xin L. %A Halevy, Alon Y. %A Yu, Cong %B VLDB %D 2007 %K aggregation goslar pdm phd uncertainty %P 687--698 %T Data Integration with Uncertainty %U http://www.cs.washington.edu/homes/lunadong/publication/pmapping\_vldb.pdf %X This paper reports our first set of results on managing un- certainty in data integration. We posit that data-integration systems need to handle uncertainty at three levels, and do so in a principled fashion. First, the semantic mappings be- tween the data sources and the mediated schema may be approximate because there may be too many of them to be created and maintained or because in some domains (e.g., bioinformatics) it is not clear what the mappings should be. Second, queries to the system may be posed with keywords rather than in a structured form. Third, the data from the sources may be extracted using information extraction tech- niques and so may yield imprecise data. As a first step to building such a system, we introduce the concept of probabilistic schema mappings and analyze their formal foundations. We show that there are two possible semantics for such mappings: by-table semantics assumes that there exists a correct mapping but we don’t know what it is; by-tuple semantics assumes that the correct mapping may depend on the particular tuple in the source data. We present the query complexity and algorithms for answering queries in the presence of approximate schema mappings, and we describe an algorithm for efficiently computing the top-k answers to queries in such a setting.

@inproceedings{DBLP:conf/vldb/DongHY07, abstract = {This paper reports our first set of results on managing un- certainty in data integration. We posit that data-integration systems need to handle uncertainty at three levels, and do so in a principled fashion. First, the semantic mappings be- tween the data sources and the mediated schema may be approximate because there may be too many of them to be created and maintained or because in some domains (e.g., bioinformatics) it is not clear what the mappings should be. Second, queries to the system may be posed with keywords rather than in a structured form. Third, the data from the sources may be extracted using information extraction tech- niques and so may yield imprecise data. As a first step to building such a system, we introduce the concept of probabilistic schema mappings and analyze their formal foundations. We show that there are two possible semantics for such mappings: by-table semantics assumes that there exists a correct mapping but we don’t know what it is; by-tuple semantics assumes that the correct mapping may depend on the particular tuple in the source data. We present the query complexity and algorithms for answering queries in the presence of approximate schema mappings, and we describe an algorithm for efficiently computing the top-k answers to queries in such a setting.}, added-at = {2009-03-12T15:42:50.000+0100}, author = {Dong, Xin L. and Halevy, Alon Y. and Yu, Cong}, biburl = {https://www.bibsonomy.org/bibtex/289307dfd2595e1a46cf5ce3433d99615/lillejul}, booktitle = {VLDB}, citeulike-article-id = {1616050}, interhash = {58166ac76bf0610480cf425b6f33bcfa}, intrahash = {89307dfd2595e1a46cf5ce3433d99615}, keywords = {aggregation goslar pdm phd uncertainty}, pages = {687--698}, posted-at = {2007-09-03 12:11:16}, priority = {4}, timestamp = {2009-03-12T15:42:53.000+0100}, title = {Data Integration with Uncertainty}, url = {http://www.cs.washington.edu/homes/lunadong/publication/pmapping\_vldb.pdf}, year = 2007 }