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.
The following extended abstract presents research results of the Belgian Incentive Program “Information Technology” — Computer Science of the future, initiated by the Belgian State — Prime Minister's Service — Science Policy Office. The scientific responsability is assumed by its authors.
Research Assistant of the Belgian National Fund for Scientific Research.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Abiteboul. Personal communications, 1990.
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.
S. Abiteboul and V. Vianu. Non-determinism in logic-based languages. Ann. Math. Artif. Intell., 3:151–186, 1991.
S. Abiteboul and V. Vianu. Generic computation and its complexity. In Proc. 23rd ACM Symp. Theory of Computing, 209–219. 1991.
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.
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.
A. Chandra and D. Harel. Computable queries for relational database systems. J. Comput. Syst. Sci., 21(2):156–178, 1980.
K. Denninghoff and V. Vianu. Database method schemas and object creation. In Proc. 12th ACM Symp. Principles of Database Systems, 265–275. 1993.
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.
S. Grumbach and C. Tollu. Query languages with counters. In Proc. 4th Int. Conf. Database Theory, LNCS 646, 124–139. Springer-Verlag, 1992.
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.
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.
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.
N. Immerman. Relational queries computable in polynomial time. Information and Control, 68:86–104, 1986.
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.
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.
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.
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.
M. Vardi. The complexity of relational query languages. In Proc. 14th ACM Symp. Theory of Computing, 137–146. 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gyssens, M., Van den Bussche, J., Van Gucht, D. (1994). Expressiveness of efficient semi-deterministic choice constructs. In: Abiteboul, S., Shamir, E. (eds) Automata, Languages and Programming. ICALP 1994. Lecture Notes in Computer Science, vol 820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58201-0_61
Download citation
DOI: https://doi.org/10.1007/3-540-58201-0_61
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58201-4
Online ISBN: 978-3-540-48566-7
eBook Packages: Springer Book Archive