On the power of stratified logic programs with value invention for expressing database transformations

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

Abstract

The expressive power of the family of ILOG(−) languages is investigated. The languages are rule based, with value invention and stratified negation. The chosen semantics for value invention is based on Skolem functor terms. We show that, in presence of value invention, the whole expressive power is achieved using programs made of two strata, and that ILOG (i.e., the class of programs with non-equality and without negation) express the downward monotone list constructive transformations.

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 ACM SIGMOD International Conf. on Management of Data, pages 159–173, 1989.Google Scholar
  2. 2.
    S. Abiteboul and V. Vianu. Datalog extensions for database queries find updates. Journal of Comp. and System Sc., 43(1):62–124, August 1991.Google Scholar
  3. 3.
    F. Afrati, S. Cosmadakis, and M. Yannakakis. On Datalog vs. polynomial time. In Tenth ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems, pages 13–25, 1991.Google Scholar
  4. 4.
    K. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 493–574. Elsevier Science Publishers (North-Holland), Amsterdam, 1990.Google Scholar
  5. 5.
    P. Atzeni, L. Cabibbo, and G. Mecca. IsaLog: A declarative language for complex objects with hierarchies. In Ninth IEEE Int. Conf. on Data Engineering, pages 219–228, 1993.Google Scholar
  6. 6.
    L. Cabibbo. On the power of stratified logic programs with value invention for expressing database transformations. Technical report, Dip. di Informatica e Sistemistica, Universita di Roma “La Sapienza”, 1994.Google Scholar
  7. 7.
    A.K. Chandra and D. Harel. Computable queries for relational databases. Journal of Comp. and System Sc., 21:333–347, 1980.Google Scholar
  8. 8.
    E.F. Codd. A relational model for large shared data banks. Communications of the ACM, 13(6):377–387, 1970.Google Scholar
  9. 9.
    M.R. Garey and D.S. Johnson. Computers and Intractability. W.H. Freeman and Company, San Francisco, 1979.Google Scholar
  10. 10.
    M. Gyssens, J. Paredaens, and D. Van Gucht. A graph-oriented object database model. In Ninth ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems, pages 417–424, 1990.Google Scholar
  11. 11.
    R. Hull and J. Su. Algebraic and calculus query languages for recursively typed complex objects. Journal of Comp. and System Sc., 47(1):121–156, August 1993.Google Scholar
  12. 12.
    R. Hull and J. Su. Deductive query languages for recursively typed complex objects. Technical report, University of Southern California, 1993.Google Scholar
  13. 13.
    R. Hull and M. Yoshikawa. ILOG: Declarative creation and manipulation of object identifiers. In Sixteenth Int. Conf. on Very Large Data Bases, pages 455–468, 1990.Google Scholar
  14. 14.
    P.G. Kolaitis. The expressive power of stratified logic programs. Information and Computation, 90(1):50–66, January 1991.Google Scholar
  15. 15.
    J. Van den Bussche. Formal Aspects of Object Identity in Database Manipulation. PhD thesis, University of Antwerp, 1993.Google Scholar
  16. 16.
    J. Van den Bussche, D. Van Gucht, M. Andries, and M. Gyssens. On the completeness of object-creating query languages. In 33rd Annual Symp. on Foundations of Computer Science, pages 372–379, 1992.Google Scholar

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Luca Cabibbo
    • 1
  1. 1.Dipartimento di Informatica e SistemisticaUniversita di Roma “La Sapienza”RomaItaly

Personalised recommendations