Value Invention for Data Exchange
Authors
Patricia C. Arocena, Boris Glavic, Renée J. Miller
Abstract
The creation of values to represent incomplete information, often referred to as value invention, is central in data exchange. Within schema mappings, Skolem functions have long been used for value invention as they permit a precise representation of missing information. Recent work on a powerful mapping language called second-order tuple generating dependencies (SO tgds), has drawn attention to the fact that the use of arbitrary Skolem functions can have negative computational and programmatic properties in data exchange. In this paper, we present two techniques for understanding when the Skolem functions needed to represent the correct semantics of incomplete information are computationally well-behaved. Specifically, we consider when the Skolem functions in second-order (SO) mappings have a first-order (FO) semantics and are therefore programmatically and computationally more desirable for use in practice. Our first technique, linearization, significantly extends the Nash, Bernstein and Melnik unskolemization algorithm, by understanding when the sets of arguments of the Skolem functions in a mapping are related by set inclusion. We show that such a linear relationship leads to mappings that have FO semantics and are expressible in popular mapping languages including source-to-target tgds and nested tgds. Our second technique uses source semantics, specifically functional dependencies (including keys), to transform SO mappings into equivalent FO mappings. We show that our algorithms are applicable to a strictly larger class of mappings than previous approaches, but more importantly we present an extensive experimental evaluation that quantifies this difference (about 78\% improvement) over an extensive schema mapping benchmark and illustrates the applicability of our results on real mappings.
Links
Reference
Value Invention for Data Exchange (Patricia C. Arocena, Boris Glavic, Renée J. Miller), In Proceedings of the 39th International Conference on Management of Data (SIGMOD), 2013.
Bibtex Entry
@inproceedings{AG13,
	Abstract = {The creation of values to represent incomplete information, often referred to as value invention, is central in data exchange. Within schema mappings, Skolem functions have long been used for value invention as they permit a precise representation of missing information. Recent work on a powerful mapping language called second-order tuple generating dependencies (SO tgds), has drawn attention to the fact that the use of arbitrary Skolem functions can have negative computational and programmatic properties in data exchange. In this paper, we present two techniques for understanding when the Skolem functions needed to represent the correct semantics of incomplete information are computationally well-behaved. Specifically, we consider when the Skolem functions in second-order (SO) mappings have a first-order (FO) semantics and are therefore programmatically and computationally more desirable for use in practice. Our first technique, linearization, significantly extends the Nash, Bernstein and Melnik unskolemization algorithm, by understanding when the sets of arguments of the Skolem functions in a mapping are related by set inclusion. We show that such a linear relationship leads to mappings that have FO semantics and are expressible in popular mapping languages including source-to-target tgds and nested tgds. Our second technique uses source semantics, specifically functional dependencies (including keys), to transform SO mappings into equivalent FO mappings. We show that our algorithms are applicable to a strictly larger class of mappings than previous approaches, but more importantly we present an extensive experimental evaluation that quantifies this difference (about 78\% improvement) over an extensive schema mapping benchmark and illustrates the applicability of our results on real mappings.},
	Author = {Patricia C. Arocena and Boris Glavic and Ren\'{e}e J. Miller},
	Booktitle = {Proceedings of the 39th International Conference on Management of Data},
	Date-Added = {2013-05-13 14:03:56 +0000},
	Date-Modified = {2013-06-02 19:45:38 +0000},
	Keywords = {Data Exchange; iBench},
	Pages = {157-168},
	Slideurl = {http://www.slideshare.net/lordPretzel/sigmod-2013-patricias-talk-on-value-invention},
	Title = {Value Invention for Data Exchange},
	Url = {http://cs.iit.edu/%7edbgroup/pdfpubls/AG13.pdf},
	Venueshort = {SIGMOD},
	Year = {2013},
	Bdsk-Url-1 = {http://cs.iit.edu/%7edbgroup/pdfpubls/AG13.pdf}}
Powered by bibtexbrowser