Skip to main content
SpringerLink
Log in

An Equational Chase for Path-Conjunctive Queries, Constraints, Views

  • Conference paper
  • First Online:
Book cover Database Theory — ICDT’99 (ICDT 1999)

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

Included in the following conference series:

Abstract

We consider the class of path-conjunctive queries and constraints (dependencies) defined over complex values with dictionaries. This class includes the relational conjunctive queries and embedded dependencies, as well as many interesting examples of complex value and oodb queries and integrity constraints. We show that some important classical results on containment, dependency implication, and chasing extend and generalize to this class.

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. S. Abiteboul. Algebraic analogues to fundamental notions of query and dependency theory. Technical report, INRIA, 1983.

    Google Scholar 

  2. A. V. Aho, C. Beeri, and J. D. Ullman. The theory of joins in relational databases. ACM Transactions on Database Systems, 4(3):297–314 1979.

    Article  Google Scholar 

  3. Serge Abiteboul, Richard Hull, and Victor Vianu. Foundations of Databases. Addison-Wesley, 1995.

    Google Scholar 

  4. M. Atkinson, C. Lecluse, P. Philbrow, and P. Richard. Design issues in amap language. In Proc. of the 3rd Int’l Workshop on Database Programming Languages (DBPL91), Nafplion, Greece, August 1991.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Val Breazu-Tannen, Peter Buneman, and Limsoon Wong. Naturally embedded query languages. In J. Biskup and R. Hull, editors, LNCS 646:Proceedings of 4th International Conference on Database Theory, Berlin, Germany, October, 1992, pages 140–154. Springer-Verlag, October 1992. Available as UPenn Technical Report MS-CIS-92-47.

    Google Scholar 

  7. N. Bidoit. The verso algebra or how to answer queries with fewer joins. Journal of Computer and System Sciences 35:321–364 1987.

    Article  MATH  MathSciNet  Google Scholar 

  8. Catriel Beeri and Yoram Kornatzky. Algebraic optimisation of object oriented query languages. Theoretical Computer Science, 116(1):59–94, August 1993.

    Article  MATH  MathSciNet  Google Scholar 

  9. Peter Buneman, Shamim Naqvi, Val Tannen, and Limsoon Wong. Principles of programming with collection types. Theoretical Computer Science, 149:3–48 1995.

    Article  MATH  MathSciNet  Google Scholar 

  10. Catriel Beeri and Moshe Y. Vardi. A proof procedure for data dependencies Journal of the ACM, 31(4):718–741, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  11. R. G. G. Cattell, editor. The Object Database Standard: ODMG-93. Morgan Kaufmann, San Mateo, California, 1996.

    MATH  Google Scholar 

  12. Sophie Cluet and Claude Delobel. A general framework for the optimization of object oriented queries. In M. Stonebraker, editor, Proceedings ACM-SIGMOD International Conference on Management of Data, pages 383–392, San Diego, California, June 1992.

    Google Scholar 

  13. Diego Calvanese, Giuseppe De Giacomo, and Maurizio Lenzerini. On the decidability of query containment under constraints. In Proc. 17th ACM Symposium on Principles of Database Systems, pages 149–158 1998.

    Google Scholar 

  14. U.S. Chakravarthi, J. Grant, and J. Minker. Foundations of semantic query optimization for deductive databases. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 243–273, San Mateo, California, 1988. Morgan-Kaufmann.

    Google Scholar 

  15. Stavros S. Cosmadakis, Paris C. Kanellakis, and Moshe Y. Vardi. Polynomial-time implication problems for unary inclusion dependencies. Journal of the ACM, 37(1):15–46 1990.

    Article  MATH  MathSciNet  Google Scholar 

  16. A. K. Chandra, H. R. Lewis, and J. A. Makowsky. Embedded implicationaldependencies and their inference problem. In Proceedings of ACM SIGACT Symposium on the Theory of Computing, pages 342–354, 1981.

    Google Scholar 

  17. S. Cluet. Langages et Optimisation de requetes pour Systemes de Gestion deBase de donnees oriente-objet. PhD thesis, Universite de Paris-Sud, 1991.

    Google Scholar 

  18. Ashok Chandra and Philip Merlin. Optimal implementation of conjunctive queries in relational data bases. In Proceedings of 9th ACM Symposium on Theory of Computing, pages 77–90, Boulder, Colorado, May 1977.

    Google Scholar 

  19. C. Chekuri and A. Rajaraman. Conjunctive query containment revisited. In LNCS 1186: Database Theory-ICDT’97, Proceedings of the 6th Int’l Conference, pages 56–70, Delphi, 1997. Springer-Verlag.

    Google Scholar 

  20. M. Cherniack and S. B. Zdonik. Rule languages and internal algebrasfor rule-based optimizers. In Proceedings of the SIGMOD International Conference on Management of Data, pages 401–412, Montreal, Quebec, Canada, 1996.

    Google Scholar 

  21. S. B. Davidson, C. Hara, and L. Popa. Querying an object-orienteddatabase using CPL. In Proceedings of the 12th Brazilian Symposium on Databases, pages 137–153, 1997. Also available as technical report MS-CIS-97-07, University of Pennsylvania.

    Google Scholar 

  22. Guozhu Dong and Jianwen Su. Conjunctive query containment with respect to views and constraints. Information Processing Letters, 57(2):95–102, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  23. C. Souza dosSantos, C. Delobel, and S. Abiteboul. Virtual schemas and bases. In Proceedings ICEDT, March 1994.

    Google Scholar 

  24. Ronald Fagin. Horn clauses and database dependencies. Journal of the ACM, 29(4):952–985, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  25. L. Fegaras and D. Maier. An algebraic framework for physical oodb design. In Proc. of the 5th Int’l Workshop on Database Programming Languages (DBPL95), Umbria, Italy, August 1995.

    Google Scholar 

  26. Leonidas Fegaras and David Maier. Towards an effective calculus for object query languages. In Proceedings of ACM SIGMOD International Conference on Management of Data, pages 47–58, San Jose, California, May 1995.

    Google Scholar 

  27. D. Florescu, L. Rashid, and P. Valduriez. A methodology for query reformulation in cis using semantic knowledge. International Journal of Cooperative Information Systems, 5(4), 1996.

    Google Scholar 

  28. W. Fan and S. Wenstein. Interaction between path and type constraints. Technical Report MS-CIS-98-16, University of Pennsylvania, 1998.

    Google Scholar 

  29. Carmem Hara and Susan Davidson. Inference rules for nested functional dependencies. Technical Report MS-CIS-98-19, University of Pennsylvania, 1998.

    Google Scholar 

  30. D. S. Johnson and A. Klug. 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 

  31. A. Klug and R. Price. In determining view dependencies using tableaux. ACM Transactions on Database Systems, 7:361–381, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  32. L. Libkin, R. Machlin, and L. Wong. A query language for multidimensional arrays: Design, implementation and optimization techniques. In SIGMOD Proceedings, Int’l Conf. on Management of Data, 1996.

    Google Scholar 

  33. Alon Levy and Dan Suciu. Deciding containment for queries with complex objects. In Proc. of the 16th ACM SIGMOD Symposium on Principles of Database Systems, Tucson, Arizona, May 1997.

    Google Scholar 

  34. A. Levy, D. Srivastava, and T. Kirk. Data model and query evaluation in global information systems. Journal of Intelligent Information Systems, 1995.

    Google Scholar 

  35. S. K. Lellahi and V. Tannen. Enriched monads. Technical Report ??, LRI, Univ. Paris-Sud, February 1995.

    Google Scholar 

  36. Kazem Lellahi and Val Tannen. A calculus for collections and aggregates. In E. Moggi and G. Rosolini, editors, LNCS 1290: Category Theory and Computer Science Proceedings of the 7th Int'l Conference, CTCS’97, pages 261–280, Santa Margherita Ligure, September 1997. Springer-Verlag.

    Google Scholar 

  37. David Maier. The Theory of Relational Databases. Computer Science Press, Rockville, Maryland, 1983.

    MATH  Google Scholar 

  38. D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. ACM Transactions on Database Systems, 4(4):455–469 1979.

    Article  Google Scholar 

  39. Lucian Popa and Val Tannen. Chase and axioms for PC queries and dependencies. Technical Report MS-CIS-98-34, University of Pennsylvania, 1998. Available online at http://www.cis.upenn.edu/~techreports/.

  40. X. Qian and L. Raschid. Query interoperation among object-oriented and relational databases. In Proc. ICDE, 1995.

    Google Scholar 

  41. Y. Saraiya. Subtree elimination algorithms in deductive databases. PhD thesis, Stanford University, 1991.

    Google Scholar 

  42. G. Shaw and S. Zdonik. Object-oriented queries: equivalence and optimization. In Proceedings of International Conference on Deductive and Object-Oriented Databases, 1989.

    Google Scholar 

  43. G. Shaw and S. Zdonik. An object-oriented query algebra. In Proc. DBPL, Salishan Lodge, Oregon, June 1989.

    Google Scholar 

  44. Jeffrey D. Ullman. Principles of Database and Knowledge-Base Systems, volume 2. Computer Science Press, 1989.

    Google Scholar 

  45. Gio Wiederhold. Mediators in the architecture of future information systems. IEEE Computer, pages 38–49, March 1992.

    Google Scholar 

  46. Mihalis Yannakakis and Christos Papadimitriou. Algebraic dependencies. Journal of Computer and System Sciences, 25:2–41, 1982.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, University of Pennsylvania, 200 South 33rd Street, Philadelphia, PA, 19104, USA

    Lucian Popa & Val Tannen

Authors
  1. Lucian Popa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Val Tannen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, The Hebrew University, Givat-Ram, Jerusalem, 91940, Israel

    Catriel Beeri

  2. Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA, 19104-6389, USA

    Peter Buneman

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Popa, L., Tannen, V. (1999). An Equational Chase for Path-Conjunctive Queries, Constraints, Views. In: Beeri, C., Buneman, P. (eds) Database Theory — ICDT’99. ICDT 1999. Lecture Notes in Computer Science, vol 1540. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49257-7_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-49257-7_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65452-0

  • Online ISBN: 978-3-540-49257-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation