Skip to main content

Scalable Query Reformulation Using Views in the Presence of Functional Dependencies

  • Conference paper
Book cover Advances in Web-Age Information Management (WAIM 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2762))

Included in the following conference series:

  • 419 Accesses

Abstract

The problem of answering queries using views in data integration has recently received considerable attention. A number of algorithms, such as the bucket algorithm, the SVB algorithm, the MiniCon algorithm, and the inverse rules algorithm, have been proposed. However, integrity constraints, such as functional dependencies, have not been considered in these algorithms. Some efforts have been made in some inverse rule-based algorithms in the presence of functional dependencies. In this paper, we extend the bucket-based algorithms to handle query rewritings using views in the presence of functional dependencies. We build relationships between views containing no subgoal of a given query and the query itself. We present an algorithm which is scalable compared to the inverse rule-based algorithms. The problem of missing query rewritings in the presence of functional dependencies that occurs in the previous bucket-based algorithms is avoided. We prove that the query rewritings generated by our algorithm are maximally-contained rewritings relative to functional dependencies.

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

Access this chapter

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 Publishing Company, Reading (1995)

    MATH  Google Scholar 

  2. Aho, A.V., Sagiv, Y., Ullman, J.D.: Equivalences among relational expressions. SIAM Journal on Computing 8(3), 218–246 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  3. Duschka, O.M., Genesereth, M.R.: Answering Recursive Queries Using Views. In: Proc. of 16th ACM Conference on Principles of Database Systems, PODS, Tucson, AZ (May 1997)

    Google Scholar 

  4. Duschka, O.M., Genesereth, M.R., Levy, A.Y.: Recursive Query Plans for Data Integration. Journal of Logic Programming, special issue on Logic Based Heterogeneous Information Systems 43(1), 49–73 (2000)

    MATH  MathSciNet  Google Scholar 

  5. Godfrey, P., Grant, J., Gryz, J., Minker, J.: Integrity Constraints: Semantics and Applications. In: Chomicki, J., Saake, G. (eds.) Logics for Databases and Information Systems. Kluwer, Dordrecht (1998)

    Google Scholar 

  6. Grant, J., Minker, J.: A logic-based approach to data integration. TLP 2(3), 323–368 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  7. Gryz, J.: An Algorithm for Query Folding with Functional Dependencies. In: Intelligent Information Systems VII Proceedings of the Workshop, Malbork, Poland (June 1998)

    Google Scholar 

  8. Gryz, J.: Query Folding with Inclusion Dependencies. In: Proceedings of ICDE 1998, Orlando, Florida, USA. IEEE Computer Society, Los Alamitos (1998) ISBN 0-8186-8289-2

    Google Scholar 

  9. Gryz, J.: Query rewriting using views in the presence of functional and inclusion dependencies. Information System 24(7), 597–612 (1999)

    Article  MATH  Google Scholar 

  10. Johnson, D.S., Klug, A.: Testing Containment of Conjunctive Queries under Functional and Inclusion Dependencies. Journal of Computer and system Sciences 28, 167–189 (1984)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  12. Levy, A.Y., Rajaraman, A., Ordille, J.J.: Querying Heterogeneous Information Sources Using Source Descriptions. In: Proceedings of the 22nd VLDB Conference (1996)

    Google Scholar 

  13. Levy, A.Y., Rajaraman, A., Ordille, J.J.: Query-Answering Algorithms for Information Agents. In: Proceedings of the AAAI 1996 (1996)

    Google Scholar 

  14. Mitra, P.: An Algorithm for Answering Queries Efficiently Using Views. In: Proceedings of the 12th Australian Database Conference (2001)

    Google Scholar 

  15. Pottinger, R., Levy, A.Y.: A Scalable Algorithm for Answering Queries Using Views. In: Proc. of the 26th International Conference on Very Large Data Bases(VLDB), Cairo, Egypt (2000)

    Google Scholar 

  16. Qian, X.: Query folding. In: Proceedings of the 12th IEEE International Conference on Data Engineering(ICDE 1996), pp. 48–55 (1999)

    Google Scholar 

  17. Wang, J., Maher, M., Topor, R.: Rewriting General Conjunctive Queries Using Views. In: Proceedings of 13th Australian Database Conference, ADC2002 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bai, Q., Hong, J., McTear, M.F. (2003). Scalable Query Reformulation Using Views in the Presence of Functional Dependencies. In: Dong, G., Tang, C., Wang, W. (eds) Advances in Web-Age Information Management. WAIM 2003. Lecture Notes in Computer Science, vol 2762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45160-0_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45160-0_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40715-7

  • Online ISBN: 978-3-540-45160-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics