research-article

On the complexity of deriving schema mappings from database instances

Authors:

Pierre Senellart,

Georg GottlobAuthors Info & Claims

PODS '08: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Pages 23 - 32

https://doi.org/10.1145/1376916.1376921

Published: 09 June 2008 Publication History

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.

References

[1]

M. Arenas, L. Bertossi, and J. Chomicki. Consistent query answers in inconsistent databases. In Proc. PODS, Philadelphia, United States, May 1999.

Digital Library

[2]

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.

Digital Library

[3]

P. Bernstein. Applying model management to classical meta data. In Proc. CIDR, Asilomar, USA, Jan. 2003.

[4]

P. A. Bernstein and D.-M. W. Chiu. Using semi-joins to solve relational queries. Journal of the ACM, 28(1):25--40, 1981.

Digital Library

[5]

V. Crescenzi, G. Mecca, and P. Merialdo. Roadrunner: Towards automatic data extraction from large Web sites. In Proc. VLDB, Roma, Italy, Sept. 2001.

Digital Library

[6]

R. Diestel. Graph Theory. Springer, New York, USA, 2005.

[7]

R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: Semantics and query answering. In Proc. ICDT, Siena, Italy, Jan. 2003.

Digital Library

[8]

R. Fagin, P. G. Kolaitis, L. Popa, and W. C. Tan. Quasi-inverses of schema mapping. In Proc. PODS, Beijing, China, June 2007.

Digital Library

[9]

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.

Digital Library

[10]

G. H. L. Fletcher. On the data mapping problem. PhD thesis, Indiana University, 2007.

Digital Library

[11]

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.

Digital Library

[12]

G. Gottlob, N. Leone, and F. Scarcello. On the complexity of some inductive logic programming problems. In Proc. ILP, Prag, Czech Republic, Sept. 1997.

Digital Library

[13]

G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. In Proc. PODS, Philadelphia, United States, May 1999.

Digital Library

[14]

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.

Digital Library

[15]

P. G. Kolaitis. Schema mappings, data exchange, and metadata management. In Proc. PODS, Baltimore, Maryland, June 2005.

Digital Library

[16]

D. KQnig. Theorie der endlichen und unendlichen Graphen. Akademische Verlagsgesellschaft, Leipzig, Germany, 1936.

[17]

N. Lavrač and S. Džeroski. Inductive Logic Programming: Techniques and Applications. Ellis Horwood, New York, USA, 1994.

Digital Library

[18]

M. Lenzerini. Data integration: a theoretical perspective. In Proc. PODS, Madison, USA, June 2002.

Digital Library

[19]

M. Li and P. Vitányi. An Introduction to Kolmogorov a Complexity and Its Applications. Springer, New York, USA, second edition, 1997.

Digital Library

[20]

E. Rahm and P. A. Bernstein. A survey of approaches to automatic schema matching. VLDB Journal, 10(4):334--350, 2001.

Digital Library

[21]

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.

Digital Library

[22]

M. Yannakakis. Algorithms for acyclic database schemes. In Proc. VLDB, Cannes, France, Sept. 1981.

Digital Library

Cited By

Asuncion VZhang YZhang HBai Y(2021)Loop restricted existential rules and first-order rewritability for query answeringJournal of Logic and Computation10.1093/logcom/exab078Online publication date: 23-Dec-2021
https://doi.org/10.1093/logcom/exab078
Ghadiri Bashardoost BLyons KMiller R(2021)Towards Knowledge Exchange: State-of-the-Art and Open ProblemsSOFSEM 2021: Theory and Practice of Computer Science10.1007/978-3-030-67731-2_2(13-27)Online publication date: 25-Jan-2021
https://dl.acm.org/doi/10.1007/978-3-030-67731-2_2
Alexe BCate BKolaitis PTan W(2011)Characterizing schema mappings via data examplesACM Transactions on Database Systems10.1145/2043652.204365636:4(1-48)Online publication date: 19-Dec-2011
https://dl.acm.org/doi/10.1145/2043652.2043656
Show More Cited By

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 systems

A 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

Information & Contributors

Information

Published In

cover image ACM Conferences

PODS '08: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

June 2008

330 pages

ISBN:9781605581521

DOI:10.1145/1376916

General Chair:
Phokion Kolaitis
IBM Almaden Research Center, USA
,
Program Chair:
Maurizio Lenzerini
SAPIENZA University of Rome, Italy

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 June 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SIGMOD/PODS '08

Sponsor:

SIGMOD/PODS '08: SIGMOD/PODS '08 - International Conference on Management of Data

June 9 - 12, 2008

Vancouver, Canada

Acceptance Rates

PODS '08 Paper Acceptance Rate 28 of 159 submissions, 18%;

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
376
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Asuncion VZhang YZhang HBai Y(2021)Loop restricted existential rules and first-order rewritability for query answeringJournal of Logic and Computation10.1093/logcom/exab078Online publication date: 23-Dec-2021
https://doi.org/10.1093/logcom/exab078
Ghadiri Bashardoost BLyons KMiller R(2021)Towards Knowledge Exchange: State-of-the-Art and Open ProblemsSOFSEM 2021: Theory and Practice of Computer Science10.1007/978-3-030-67731-2_2(13-27)Online publication date: 25-Jan-2021
https://dl.acm.org/doi/10.1007/978-3-030-67731-2_2
Alexe BCate BKolaitis PTan W(2011)Characterizing schema mappings via data examplesACM Transactions on Database Systems10.1145/2043652.204365636:4(1-48)Online publication date: 19-Dec-2011
https://dl.acm.org/doi/10.1145/2043652.2043656
Kanagal BLi JDeshpande ASellis TMiller RKementsietsidis AVelegrakis Y(2011)Sensitivity analysis and explanations for robust query evaluation in probabilistic databasesProceedings of the 2011 ACM SIGMOD International Conference on Management of data10.1145/1989323.1989411(841-852)Online publication date: 12-Jun-2011
https://dl.acm.org/doi/10.1145/1989323.1989411
Meliou AGatterbauer WMoore KSuciu D(2010)The complexity of causality and responsibility for query answers and non-answersProceedings of the VLDB Endowment10.14778/1880172.18801764:1(34-45)Online publication date: 1-Oct-2010
https://dl.acm.org/doi/10.14778/1880172.1880176
Alexe BKolaitis PTan WParedaens JVan Gucht D(2010)Characterizing schema mappings via data examplesProceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/1807085.1807120(261-272)Online publication date: 6-Jun-2010
https://dl.acm.org/doi/10.1145/1807085.1807120
Das Sarma AParameswaran AGarcia-Molina HWidom J(2010)Synthesizing view definitions from dataProceedings of the 13th International Conference on Database Theory10.1145/1804669.1804683(89-103)Online publication date: 23-Mar-2010
https://dl.acm.org/doi/10.1145/1804669.1804683
Gottlob GSenellart P(2010)Schema mapping discovery from data instancesJournal of the ACM10.1145/1667053.166705557:2(1-37)Online publication date: 8-Feb-2010
https://dl.acm.org/doi/10.1145/1667053.1667055
Fletcher GGyssens MParedaens JVan Gucht D(2009)On the Expressive Power of the Relational Algebra on Finite Sets of Relation PairsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2008.22121:6(939-942)Online publication date: 1-Jun-2009
https://dl.acm.org/doi/10.1109/TKDE.2008.221

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten