Foto Afrati
ABSTRACT
Data exchange, also known as data translation, has been extensively investigated in recent years. One main direction of research has focused on the semantics and the complexity of answering first-order queries in the context of data exchange between relational schemas. In this paper, we initiate a systematic investigation of the semantics and the complexity of aggregate queries in data exchange, and make a number of conceptual and technical contributions. Data exchange is a context in which incomplete information arises, hence one has to cope with a set of possible worlds, instead of a single database. Three different sets of possible worlds have been explored in the study of the certain answers of first-order queries in data exchange: the set of possible worlds of all solutions, the set of possible worlds of all universal solutions, and a set of possible worlds derived from the CWA-solutions. We examine each of these sets and point out that none of them is suitable for aggregation in data exchange, as each gives rise to rather trivial semantics. Our analysis also reveals that, to have meaningful semantics for aggregation in data exchange, a strict closed world assumption has to be adopted in selecting the set of possible worlds. For this, we introduce and study the set of the endomorphic images of the canonical universal solution as a set of possible worlds for aggregation in data exchange. Our main technical result is that for schema mappings specified by source-to-target tgds, there are polynomial-time algorithms for computing the range semantics of every scalar aggregation query, where the range semantics of an aggregate query is the greatest lower bound and the least upper bound of the values that the query takes over the set of possible worlds. Among these algorithms, the more sophisticated one is the algorithm for the average operator, which makes use of concepts originally introduced in the study of the core of the universal solutions in data exchange. We also show that if, instead of range semantics, we consider possible answer semantics, then it is an NP-complete problem to tell if a number is a possible answer of a given scalar aggregation query with the average operator.
- ISO/IEC 9075-2:2003, "SQL/Foundation". ISO/IEC, Section 4.15.4: Aggregate functions.Google Scholar
- F. Afrati, C. Li, and V. Pavlaki. Data exchange in the presence of arithmetic comparisons. In EDBT Conference, 2008. To appear. Google ScholarDigital Library
- M. Arenas, L. E. Bertossi, J. Chomicki, X. He, V. Raghavan, and J. Spinrad. Scalar aggregation in inconsistent databases. TCS, 3(296):405--434, 2003. Google ScholarDigital Library
- M. Arenas and L. Libkin. XML data exchange: consistency and query answering. In PODS, pages 13--24, 2005. Google ScholarDigital Library
- R. Fagin. Inverting Schema Mappings. In PODS, pages 50--59, 2006. Google ScholarDigital Library
- R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data Exchange: Semantics and Query Answering. TCS, 336(1):89--124, 2005. Google Scholar
- R. Fagin, P. G. Kolaitis, and L. Popa. Data Exchange: Getting to the Core. ACM TODS, 30(1):174--210, 2005. Google ScholarDigital Library
- R. Fagin, P. G. Kolaitis, L. Popa, and W.-C. Tan. Composing Schema Mappings: Second-order Dependencies to the Rescue. ACM TODS, 30(4):994--1055, 2005. Google ScholarDigital Library
- R. Fagin, P. G. Kolaitis, L. Popa, and W. C. Tan. Quasi-inverses of schema mappings. In PODS, pages 123--132, 2007. Google ScholarDigital Library
- A. Fuxman. Efficient Management of Inconsistent Databases. PhD thesis, University of Toronto, 2006.Google Scholar
- A. Fuxman, E. Fazli, and R. J. Miller. ConQuer: Efficient management of inconsistent databases. In SIGMOD, pages 155--166, 2005. Google ScholarDigital Library
- A. Fuxman, P. G. Kolaitis, R. J. Miller, and W. C. Tan. Peer data exchange. ACM TODS, 31(4):1454--1498, 2006. Google ScholarDigital Library
- G. Gottlob. Computing cores for data exchange: new algorithms and practical solutions. In PODS, pages 148--159, 2005. Google ScholarDigital Library
- G. Gottlob and A. Nash. Data exchange: computing cores in polynomial time. In PODS, pages 40--49, 2006. Google ScholarDigital Library
- L. M. Haas, M. A. Hernández, H. Ho, L. Popa, and M. Roth. Clio Grows Up: From Research Prototype to Industrial Tool. In SIGMOD, pages 805--810, 2005. Google ScholarDigital Library
- A. Hernich and N. Schweikardt. CWA-solutions for data exchange settings with target dependencies. In PODS, pages 113--122, 2007. Google ScholarDigital Library
- L. Libkin. Data exchange and incomplete information. In PODS, pages 60--69, 2006. Google ScholarDigital Library
- A. Madry. Data exchange: On the complexity of answering queries with inequalities. Inf. Process. Lett., 94(6):253--257, 2005. Google ScholarCross Ref
- S. Melnik. Generic Model Management: Concepts and Algorithms, volume 2967 of Lecture Notes in Computer Science. Springer, 2004. Google ScholarDigital Library
- A. Nash, P. A. Bernstein, and S. Melnik. Composition of mappings given by embedded dependencies. ACM TODS, 32(1):4, 2007. Google ScholarDigital Library
Index Terms
- Answering aggregate queries in data exchange
Recommendations
Data exchange: semantics and query answering
Database theoryData exchange is the problem of taking data structured under a source schema and creating an instance of a target schema that reflects the source data as accurately as possible. In this paper, we address foundational and algorithmic issues related to ...
Peer data exchange
In this article, we introduce and study a framework, called peer data exchange, for sharing and exchanging data between peers. This framework is a special case of a full-fledged peer data management system and a generalization of data exchange between a ...
XML data exchange: Consistency and query answering
Data exchange is the problem of finding an instance of a target schema, given an instance of a source schema and a specification of the relationship between the source and the target. Theoretical foundations of data exchange have recently been ...
Comments