Advertisement

Expressiveness of efficient semi-deterministic choice constructs

  • Marc Gyssens
  • Jan Van den Bussche
  • Dirk Van Gucht
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 820)

Abstract

Recently, Abiteboul and Kanellakis introduced the notion of determinate query to describe database queries having the ability to create new domain elements. As there are no natural determinate-complete query languages known, more restrictive (the constructive queries) and more general (the semideterministic queries) notions of query were considered. Here, we show that the advantage of the second approach over the first is not so much in increased expressiveness, but in the ability of expressing queries more efficiently.

Keywords

Binary Relation Query Language Database Scheme Natural Class Object Creation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Abiteboul. Personal communications, 1990.Google Scholar
  2. 2.
    S. Abiteboul and P. Kanellakis. Object identity as a query language primitive. In Proc. 1989 ACM SIGMOD Int. Conf. Management of Data, in SIGMOD Rec, 18(2):159–173, 1989.Google Scholar
  3. 3.
    S. Abiteboul and V. Vianu. Non-determinism in logic-based languages. Ann. Math. Artif. Intell., 3:151–186, 1991.Google Scholar
  4. 4.
    S. Abiteboul and V. Vianu. Generic computation and its complexity. In Proc. 23rd ACM Symp. Theory of Computing, 209–219. 1991.Google Scholar
  5. 5.
    M. Andries and J. Paredaens. A language for generic graph-transformations. In Graph-Theoretic Concepts in Computer Science, Proc. Int. Workshop WG 91, LNCS 570, 63–74. Springer-Verlag, 1992.Google Scholar
  6. 6.
    J. Cai, M. Furer, and N. Immerman. An optimal lower bound on the number of variables for graph identification. In Proc. 30th IEEE Symp. Foundations of Computer Science, 612–617, 1989.Google Scholar
  7. 7.
    A. Chandra and D. Harel. Computable queries for relational database systems. J. Comput. Syst. Sci., 21(2):156–178, 1980.Google Scholar
  8. 8.
    K. Denninghoff and V. Vianu. Database method schemas and object creation. In Proc. 12th ACM Symp. Principles of Database Systems, 265–275. 1993.Google Scholar
  9. 9.
    E. Grädel and M. Otto. Inductive definability with counting on finite structures. In Proc. 6th Workshop on Computer Science Logic, LNCS 702, 231–247. Springer-Verlag, 1993.Google Scholar
  10. 10.
    S. Grumbach and C. Tollu. Query languages with counters. In Proc. 4th Int. Conf. Database Theory, LNCS 646, 124–139. Springer-Verlag, 1992.Google Scholar
  11. 11.
    M. Gyssens, J. Paredaens, and D. Van Gucht. A graph-oriented object database model. In Proc. 9th ACM Symp. Principles of Database Systems, 417–424. 1990.Google Scholar
  12. 12.
    M. Gyssens, J. Paredaens, and D. Van Gucht. A graph-oriented object database model for database end-user interfaces. In Proc. 1990 ACM SIGMOD Int. Conf. Management of Data, in SIGMOD Rec., 19(2):24–33. 1990.Google Scholar
  13. 13.
    R. Hull and M. Yoshikawa. ILOG: Declarative creation and manipulation of object identifiers. In Proc. 16th Int. Conf. on Very Large Data Bases, 455–468. 1990.Google Scholar
  14. 14.
    N. Immerman. Relational queries computable in polynomial time. Information and Control, 68:86–104, 1986.Google Scholar
  15. 15.
    M. Kifer and J. Wu. A logic for object-oriented logic programming (Maier's O-logic revisited). In Proc. 8th ACM Symp. Principles of Database Systems, 379–393. 1989.Google Scholar
  16. 16.
    J. Van den Bussche and J. Paredaens. The expressive power of structured values in pure OODB's. In Proc. 10th ACM Symp. Principles of Database Systems, 291–299. 1991.Google Scholar
  17. 17.
    J. Van den Bussche and D. Van Gucht. Semi-determinism. In Proc. 11th ACM Symp. Principles of Database Systems, 191–201. 1992. Full version submitted.Google Scholar
  18. 18.
    J. Van den Bussche, D. Van Gucht, M. Andries, and M. Gyssens. On the completeness of object-creating query languages. In Proc. 33rd IEEE Symp. Foundations of Computer Science, 372–379. 1992.Google Scholar
  19. 19.
    M. Vardi. The complexity of relational query languages. In Proc. 14th ACM Symp. Theory of Computing, 137–146. 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Marc Gyssens
    • 1
  • Jan Van den Bussche
    • 2
  • Dirk Van Gucht
    • 3
  1. 1.Dept. WNIUniversity of Limburg (LUC)DiepenbeekBelgium
  2. 2.Dept. WISINFUniversity of Antwerp (UIA)AntwerpBelgium
  3. 3.Computer Sci. Dept.Indiana UniversityBloomingtonUSA

Personalised recommendations