Expressiveness of Efficient Semi-Deterministic Choice Constructs

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.

[1]  Martin Otto,et al.  Inductive Definability with Counting on Finite Structures , 1992, CSL.

[2]  E. F. Codd,et al.  Relational Completeness of Data Base Sublanguages , 1972, Research Report / RJ / IBM / San Jose, California.

[3]  Stéphane Grumbach,et al.  Query Languages with Counters , 1992, ICDT.

[4]  Marc Gyssens,et al.  A graph-oriented object model for database end-user interfaces , 1990, SIGMOD '90.

[5]  Jan Van den Bussche,et al.  On the completeness of object-creating query languages , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[6]  Jan Van den Bussche,et al.  The expressive power of structured values in pure OODB's , 1991, PODS 1991.

[7]  Serge Abiteboul,et al.  Object identity as a query language primitive , 1989, SIGMOD '89.

[8]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

[9]  Serge Abiteboul,et al.  Generic Computation and its complexity , 1991, STOC '91.

[10]  Serge Abiteboul,et al.  Datalog Extensions for Database Queries and Updates , 1991, J. Comput. Syst. Sci..

[11]  David Harel,et al.  Computable Queries for Relational Data Bases , 1980, J. Comput. Syst. Sci..

[12]  E. F. Codd,et al.  A Relational Model for Large Shared Data Banks , 1970 .

[13]  Jan Van den Busschey,et al.  A semi � deterministic approach to object creation and non � determinism in database queries � , 1993 .

[14]  David J. Goodman,et al.  Personal Communications , 1994, Mobile Communications.

[15]  Jan Van den Bussche,et al.  Semi-determinism , 1992, PODS.

[16]  Michael Kifer,et al.  A logic for object-oriented logic programming , 1989, PODS '89.

[17]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[18]  Masatoshi Yoshikawa,et al.  ILOG: Declarative Creation and Manipulation of Object Identifiers , 1990, VLDB.

[19]  E. F. Codd,et al.  Further Normalization of the Data Base Relational Model , 1971, Research Report / RJ / IBM / San Jose, California.

[20]  Dieter Kratsch,et al.  Graph-Theoretic Concepts in Computer Science , 1987, Lecture Notes in Computer Science.

[21]  Marc Gyssens,et al.  A graph-oriented object database model , 1990, IEEE Trans. Knowl. Data Eng..

[22]  Victor Vianu,et al.  Procedural Languages for Database Queries and Updates , 1990, J. Comput. Syst. Sci..

[23]  Jan Van den Bussche,et al.  The expressive power structured values in pure OODB's (extended abstract) , 1991, PODS '91.

[24]  Neil Immerman,et al.  An optimal lower bound on the number of variables for graph identification , 1989, 30th Annual Symposium on Foundations of Computer Science.

[25]  Michael Kifer,et al.  A logic for object-oriented logic programming , 1989, PODS.

[26]  Marc Andries,et al.  A Language for Generic Graph-Transformations , 1991, WG.

[27]  Victor Vianu,et al.  Database method schemas and object creation , 1993, PODS '93.