Skip to main content
SpringerLink
Log in

Provenance-Directed Chase&Backchase

  • Chapter
In Search of Elegance in the Theory and Practice of Computation

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8000))

Abstract

The Chase&Backchase algorithm for rewriting queries using views is based on constructing a canonical rewriting candidate called a universal plan (during the chase phase), then chasing its exponentially many subqueries in search for minimal rewritings (during the backchase phase). We show that the backchase phase can be sped up significantly if we instrument the standard chase to maintain provenance information. The particular provenance flavor required is known as minimal why-provenance in the literature, and it can be computed by exploiting the analogy between a chase step execution and query evaluation.

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. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995)

    Google Scholar 

  2. Buneman, P., Khanna, S., Tan, W.-C.: Why and where: A characterization of data provenance. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 316–330. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  3. Deutsch, A.: XML Query Reformulation Over Mixed and Redundant Storage. PhD thesis, University of Pennsylvania (2002)

    Google Scholar 

  4. Deutsch, A., Popa, L., Tannen, V.: Physical data independence, constraints, and optimization with universal plans. In: VLDB, pp. 459–470 (1999)

    Google Scholar 

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

    Article  Google Scholar 

  6. Deutsch, A., Tannen, V.: Mars: A system for publishing xml from mixed and redundant storage. In: VLDB, pp. 201–212 (2003)

    Google Scholar 

  7. 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 

  8. Green, T.J., Karvounarakis, G., Tannen, V.: Provenance semirings. In: PODS, pp. 31–40 (2007)

    Google Scholar 

  9. Popa, L., Deutsch, A., Sahuguet, A., Tannen, V.: A chase too far? In: ACM SIGMOD Conference, pp. 273–284 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of California, San Diego, USA

    Alin Deutsch & Richard Hull

  2. IBM Watson Research Center, USA

    Alin Deutsch & Richard Hull

Authors
  1. Alin Deutsch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richard Hull
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer and Information Science, University of Pennsylvania, 3330 Walnut St., 19104, Philadelphia, PA, USA

    Val Tannen

  2. School of Computing, National University of Singapore, 13 Computing Drive, 117417, Singapore, Singapore

    Limsoon Wong

  3. School of Informatics, The University of Edinburgh, 10 Crichton Street, EH8 9AB, Edinburgh, UK

    Leonid Libkin , Wenfei Fan  & Michael Fourman ,  & 

  4. Department of Computer Science, University of California, 1156 High Street, 95064, Santa Cruz, CA, USA

    Wang-Chiew Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Deutsch, A., Hull, R. (2013). Provenance-Directed Chase&Backchase. In: Tannen, V., Wong, L., Libkin, L., Fan, W., Tan, WC., Fourman, M. (eds) In Search of Elegance in the Theory and Practice of Computation. Lecture Notes in Computer Science, vol 8000. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41660-6_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41660-6_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41659-0

  • Online ISBN: 978-3-642-41660-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation