Skip to main content
Springer Nature Link
Log in

Towards Practical Feasibility of Core Computation in Data Exchange

  • Conference paper
Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5330))

  • 828 Accesses

Abstract

Core computation in data exchange is concerned with materializing the minimal target database for a given source database. Gottlob and Nash have recently shown that the core can be computed in polynomial time under very general conditions. Nevertheless, core computation has not yet been incorporated into existing data exchange tools. The principal aim of this paper is to make a big step forward towards the practical feasibility of core computation in data exchange by developing an improved algorithm and by presenting a prototype implementation of our new algorithm.

This work was supported by the Austrian Science Fund (FWF), project P20704-N18.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Fagin, R.: Horn clauses and database dependencies. J. ACM 29, 952–985 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  2. Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: semantics and query answering. Theor. Comput. Sci. 336, 89–124 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Fagin, R., Kolaitis, P.G., Popa, L.: Data exchange: getting to the core. ACM Trans. Database Syst. 30, 174–210 (2005)

    Article  MATH  Google Scholar 

  4. Beeri, C., Vardi, M.Y.: A proof procedure for data dependencies. J. ACM 31, 718–741 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  5. Hell, P., Nešetřil, J.: The core of a graph. Discrete Mathematics 109, 117–126 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  6. Gottlob, G., Nash, A.: Data exchange: computing cores in polynomial time. In: Proc. PODS 2006, pp. 40–49. ACM Press, New York (2006)

    Google Scholar 

  7. Pichler, R., Savenkov, V.: Towards practical feasibility of core computation in data exchange. Technical Report DBAI-TR-2008-57, TU Vienna (2008), http://www.dbai.tuwien.ac.at/research/report/dbai-tr-2008-57.pdf

  8. Deutsch, A., Tannen, V.: Reformulation of XML queries and constraints. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 225–238. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Gottlob, G.: Computing cores for data exchange: new algorithms and practical solutions. In: Proc. PODS 2005, pp. 148–159. ACM Press, New York (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Vienna University of Technology, Austria

    Reinhard Pichler & Vadim Savenkov

Authors
  1. Reinhard Pichler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vadim Savenkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Carnegie Mellon University, Doha, Qatar

    Iliano Cervesato

  2. Technische Universität Darmstadt, Germany

    Helmut Veith

  3. University of Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pichler, R., Savenkov, V. (2008). Towards Practical Feasibility of Core Computation in Data Exchange. In: Cervesato, I., Veith, H., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2008. Lecture Notes in Computer Science(), vol 5330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89439-1_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89439-1_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89438-4

  • Online ISBN: 978-3-540-89439-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics