ABSTRACT
We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of data exchange. We formalize the problem of understanding the relationship between two instances as that of obtaining a schema mapping so that a minimum repair of this mapping provides a perfect description of the target instance given the source instance. We show that this definition yields "intuitive" results when applied on database instances derived from each other by basic operations. We study the complexity of decision problems related to this optimality notion in the context of different logical languages and show that, even in very restricted cases, the problem is of high complexity.
- M. Arenas, L. Bertossi, and J. Chomicki. Consistent query answers in inconsistent databases. In Proc. PODS, Philadelphia, United States, May 1999. Google Scholar
Digital Library
- C. Beeri, R. Fagin, D. Maier, A. Mendelzon, J. Ullman, and M. Yannakakis. Properties of acyclic database schemes. In Proc. STOC, Milwaukee, USA, May 1981. Google Scholar
Digital Library
- P. Bernstein. Applying model management to classical meta data. In Proc. CIDR, Asilomar, USA, Jan. 2003.Google Scholar
- P. A. Bernstein and D.-M. W. Chiu. Using semi-joins to solve relational queries. Journal of the ACM, 28(1):25--40, 1981. Google Scholar
Digital Library
- V. Crescenzi, G. Mecca, and P. Merialdo. Roadrunner: Towards automatic data extraction from large Web sites. In Proc. VLDB, Roma, Italy, Sept. 2001. Google Scholar
Digital Library
- R. Diestel. Graph Theory. Springer, New York, USA, 2005.Google Scholar
- R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: Semantics and query answering. In Proc. ICDT, Siena, Italy, Jan. 2003. Google Scholar
Digital Library
- R. Fagin, P. G. Kolaitis, L. Popa, and W. C. Tan. Quasi-inverses of schema mapping. In Proc. PODS, Beijing, China, June 2007. Google Scholar
Digital Library
- R. Fagin, P. G. Kolaitis, W.-C. Tan, and L. Popa. Composing schema mappings: Second-order dependencies to the rescue. In Proc. PODS, Paris, France, June 2004. Google Scholar
Digital Library
- G. H. L. Fletcher. On the data mapping problem. PhD thesis, Indiana University, 2007. Google Scholar
Digital Library
- M. R. Garey and D. S. Johnson. Computers And Intractability. A Guide to the Theory of NP--completeness. W. H. Freeman, New York, USA, 1979. Google Scholar
Digital Library
- G. Gottlob, N. Leone, and F. Scarcello. On the complexity of some inductive logic programming problems. In Proc. ILP, Prag, Czech Republic, Sept. 1997. Google Scholar
Digital Library
- G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. In Proc. PODS, Philadelphia, United States, May 1999. Google Scholar
Digital Library
- L. Ilie, R. Solis-Oba, and S. Yu. Reducing the size of NFAs by using equivalences and preorders. In Combinatorial Pattern Matching, Jeju Island, South Korea, June 2002. Google Scholar
Digital Library
- P. G. Kolaitis. Schema mappings, data exchange, and metadata management. In Proc. PODS, Baltimore, Maryland, June 2005. Google Scholar
Digital Library
- D. KQnig. Theorie der endlichen und unendlichen Graphen. Akademische Verlagsgesellschaft, Leipzig, Germany, 1936.Google Scholar
- N. Lavrač and S. Džeroski. Inductive Logic Programming: Techniques and Applications. Ellis Horwood, New York, USA, 1994. Google Scholar
Digital Library
- M. Lenzerini. Data integration: a theoretical perspective. In Proc. PODS, Madison, USA, June 2002. Google Scholar
Digital Library
- M. Li and P. Vitányi. An Introduction to Kolmogorov a Complexity and Its Applications. Springer, New York, USA, second edition, 1997. Google Scholar
Digital Library
- E. Rahm and P. A. Bernstein. A survey of approaches to automatic schema matching. VLDB Journal, 10(4):334--350, 2001. Google Scholar
Digital Library
- R. E. Tarjan and M. Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing, 13(3):566--579, 1984. Google Scholar
Digital Library
- M. Yannakakis. Algorithms for acyclic database schemes. In Proc. VLDB, Cannes, France, Sept. 1981. Google Scholar
Digital Library
Index Terms
On the complexity of deriving schema mappings from database instances
Recommendations
Schema mapping discovery from data instances
We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of data exchange. We formalize the problem of understanding the relationship ...
Inverting schema mappings
PODS '06: Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsA schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the target schema). Although the notion of an inverse of a schema mapping is ...
Quasi-inverses of schema mappings
Schema mappings are high-level specifications that describe the relationship between two database schemas. Two operators on schema mappings, namely the composition operator and the inverse operator, are regarded as especially important. Progress on the ...






Comments