Domain-independent queries on databases with external functions

  • Dan Suciu
Contributed Papers Query Languages II
Part of the Lecture Notes in Computer Science book series (LNCS, volume 893)

Abstract

We investigate queries in the presence of external functions with arbitrary inputs and outputs (atomic values, sets, nested sets etc). We propose a new notion of domain independence for queries with external functions which, in contrast to previous work, can also be applied to query languages with fixpoints or other kinds of iterators. Next, we define two new notions of computable queries with external functions, and prove that they are equivalent, under the assumption that the external functions are total. Thus, our definition of computable queries with external functions is robust. Finally, based on the equivalence result, we give examples of complete query languages with external functions. A byproduct of the equivalence result is the fact that Relational Machines are complete for complex objects: it was known that they are not complete over flat relations.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Abiteboul and P. Kanellakis. Object identity as a query language primitive. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 159–173, Portland, Oregon, 1989.Google Scholar
  2. 2.
    S. Abiteboul, C.H. Papadimitriou, and V. Vianu. The power of reflective relational machines. In Proceedings of the 9th IEEE Symposium on Logic in Computer Science, pages 230–240, Paris, France, July 1994.Google Scholar
  3. 3.
    S. Abiteboul, M. Vardi, and V. Vianu. Fixpoint logics, relational machines, and computational complexity. In Structure and Complexity, 1992.Google Scholar
  4. 4.
    Serge Abiteboul and Catriel Beeri. On the power of languages for the manipulation of complex objects. In Proceedings of International Workshop on Theory and Applications of Nested Relations and Complex Objects, Darmstadt, 1988. Also available as INRIA Technical Report 846.Google Scholar
  5. 5.
    Serge Abiteboul and Victor Vianu. Generic computation and its complexity. In Proceedings of 23rd ACM Symposium on the Theory of Computing, 1991.Google Scholar
  6. 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. 7.
    Ashok Chandra and David Harel. Computable queries for relational databases. Journal of Computer and System Sciences, 21(2):156–178, 1980.CrossRefGoogle Scholar
  8. 8.
    P. L. Curien. Categorical Combinators, Sequential Algorithms and Functional Programming. Pitman, 1986.Google Scholar
  9. 9.
    O. Deux. The story of O 2. IEEE Transactions on Knowledge and Data Engineering, 2(1):91–108, March 1990.Google Scholar
  10. 10.
    Martha Escobar-Molano, Richard Hull, and Dean Jacobs. Safety and translation of calculus queries with scalar functions. In Proceedings of 12th ACM Symposium on Principles of Database Systems, pages 253–264, Washington, D. C., May 1993.Google Scholar
  11. 11.
    Stephane Grumbach and Victor Vianu. Expressiveness and complexity of restricted languages for complex objects. In Proceedings of 3rd International Workshop on Database Programming Languages, Naphlion, Greece, pages 191–202. Morgan Kaufmann, August 1991.Google Scholar
  12. 12.
    Carl A. Gunter. Semantics of Programming Languages: Structures and Techniques. Foundations of Computing. MIT Press, 1992.Google Scholar
  13. 13.
    Marc Gyssens and Dirk Van Gucht. A comparison between algebraic query languages for flat and nested databases. Theoretical Computer Science, 87:263–286, 1991.Google Scholar
  14. 14.
    Marc Gyssens and Dirk Van Gucht. The powerset algebra as a natural tool to handle nested database relations. Journal of Computer and System Sciences, 45:76–103, 1992.Google Scholar
  15. 15.
    Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability. MIT Press, 1987.Google Scholar
  16. 16.
    Richard Hull and Jianwen Su. Untyped sets, inventions, and computable queries. In Proceedings 8th ACM Sumposium on Principles of Database Systems, pages 347–360, 1989.Google Scholar
  17. 17.
    G. D. Plotkin. Post-graduate lecture notes in advanced domain theory. Department of Computer Science, University of Edinburgh, 1981. Available by email from: kondoh@harl.hitachi.co.jp.Google Scholar
  18. 18.
    Dan Suciu. Domain-independent queries on databases with external functions. Technical Report MS-CIS-94-48/L&C 87, University of Pennsylvania, Philadelphia, PA 19104, October 1994.Google Scholar
  19. 19.
    Dan Suciu. Fixpoints and bounded fixpoints for complex objects. In Catriel Beeri, Atsushi Ohori, and Dennis Shasha, editors, Proceedings of 4th International Workshop on Database Programming Languages, New York, August 1993, pages 263–281. Springer-Verlag, January 1994. See also UPenn Technical Report MS-CIS-93-32.Google Scholar
  20. 20.
    Dan Suciu and Val Breazu-Tannen. A query language for NC. In Proceedings of 13th ACM Symposium on Principles of Database Systems, pages 167–178, Minneapolis, Minnesota, May 1994. See also UPenn Technical Report MS-CIS-94-05.Google Scholar
  21. 21.
    Rodney W. Topor. Domain-independent formulas and databases. Theoretical Computer Science, 52:281–306, 1987.Google Scholar

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Dan Suciu
    • 1
  1. 1.University of PennsylvaniaPhiladelphia

Personalised recommendations