Skip to main content
SpringerLink
Log in

On the Termination of the Chase Algorithm

  • Conference paper
Web Reasoning and Rule Systems (RR 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6333))

Included in the following conference series:

Abstract

In my PhD thesis I study the termination problem of the chase algorithm, a central tool in various database problems such as the constraint implication problem, conjunctive query optimization, rewriting queries using views, data exchange, and data integration.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Deutsch, A., Popa, L., Tannen, V.: Query Reformulation with Constraints. SIGMOD Record 35(1), 65–73 (2006)

    Article  Google Scholar 

  2. Baget, J.-F., Leclère, M., Mugnier, M.-L., Salvat, Ê.: Extending decidable cases for rules with existential variables. In: IJCAI, pp. 677–682 (2009)

    Google Scholar 

  3. Beeri, C., Vardi, M.Y.: A Proof Procedure for Data Dependencies. J. ACM 31(4), 718–741 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  4. Calì, A., Gottlob, G., Kifer, M.: Taming the Infinite Chase: Query Answering under Expressive Relational Constraints. In: KR (2008)

    Google Scholar 

  5. Maier, D., Mendelzon, A., Sagiv, Y.: Testing Implications of Data Dependencies. In: SIGMOD, pp. 152–152 (1979)

    Google Scholar 

  6. Deutsch, A., Ludäscher, B., Nash, A.: Rewriting Queries Using Views with Access Patterns under Integrity Constraints. Theor. Comput. Sci. 371(3), 200–226 (2007)

    Article  MATH  Google Scholar 

  7. Deutsch, A., Nash, A., Remmel, J.: The Chase Revisited. In: PODS, pp. 149–158 (2008)

    Google Scholar 

  8. Fagin, R., Kolaitis, P., Miller, R., Popa, L.: Data Exchange: Semantics and Query Answering. Theor. Comput. Sci. 336(1), 89–124 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  9. Fuxman, A., Kolaitis, P., Miller, R., Tan, W.-C.: Peer Data Exchange. TODS 31(4), 1454–1498 (2006)

    Article  Google Scholar 

  10. Greco, S., Spezzano, F.: Chase Termination: A Constraints Rewriting Approach. To appear in PVLDB (2010)

    Google Scholar 

  11. Halevy, A.: Answering Queries Using Views: A Survey. VLDB Journal 10(4), 270–294 (2001)

    Article  MATH  Google Scholar 

  12. Johnson, D., Klug, A.: Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies. In: PODS, pp. 164–169 (1982)

    Google Scholar 

  13. Marnette, B.: Generalized Schema-Mappings: From Termination to Tractability. In: PODS, pp. 13–22 (2009)

    Google Scholar 

  14. Meier, M., Schmidt, M., Lausen, G.: On Chase Termination Beyond Stratification (2009), http://arxiv.org/abs/0906.4228

  15. Meier, M., Schmidt, M., Lausen, G.: On Chase Termination Beyond Stratification. PVLDB 2(1) (2009)

    Google Scholar 

  16. Meier, M., Schmidt, M., Wei, F., Lausen, G.: Semantic Query Optimization in the Presence of Types. In: PODS (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Freiburg, Georges-Köhler-Allee 051, 79110, Freiburg, Germany

    Michael Meier

Authors
  1. Michael Meier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science and Engineering, Wright State University, 3640 Colonel Glenn Hwy, 45435, Dayton, OH, USA

    Pascal Hitzler

  2. Computing Laboratory, Oxford University, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK

    Thomas Lukasiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meier, M. (2010). On the Termination of the Chase Algorithm. In: Hitzler, P., Lukasiewicz, T. (eds) Web Reasoning and Rule Systems. RR 2010. Lecture Notes in Computer Science, vol 6333. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15918-3_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15918-3_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15917-6

  • Online ISBN: 978-3-642-15918-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation