## On the expressive power of database queries with intermediate types (1991)

Venue: | Journal of Computer and System Sciences |

Citations: | 45 - 2 self |

### BibTeX

@ARTICLE{Hull91onthe,

author = {Richard Hull and Jianwen Su},

title = {On the expressive power of database queries with intermediate types},

journal = {Journal of Computer and System Sciences},

year = {1991},

volume = {43},

pages = {219--267}

}

### OpenURL

### Abstract

The set-height of a complex object type is defined to be its level of nesting of the set construct. In a query of the complex object calculus which maps a database D to an output type T,anintermediate type is a type which is used by some variable of the query, but which is not present in D or T.Foreachk, i ≥ 0 we define CALCk,i to be the family of calculus queries mapping from and to types with set-height ≤ k and using intermediate types with set-height ≤ i. In particular, CALC0,0 is the classical relational calculus, and CALC0,1 is equivalent to the family of secondorder (relational) queries. Several results concerning these families of languages are obtained. A primary focus is on the families CALC0,i, which map relations to relations. Upper and lower bounds in terms of hyper-exponential time and space on the complexity of these families are provided. The CALC0,i hierarchy does not collapse with respect to expressive power. The union ∪0≤iCALC0,i is exactly the family of elementary queries, i.e., queries with hyper-exponential complexity. The expressive power of queries from the complex object calculus interpreted using semantics based on the use of arbitrarily large finite or infinite set of invented values is studied. Under these semantics, the expressive power of the relational calculus is not increased, and the CALC0,i hierarchy collapses at CALC0,1. In general, queries with these semantics may not be computable. We also consider an alternative semantics which yields a family of queries equivalent to the computable queries. 1

### Citations

631 | Towards a theory of declarative knowledge - APT, BLAIR, et al. - 1988 |

538 |
The complexity of relational query languages
- VARDI
- 1982
(Show Context)
Citation Context ...us, transitive closure is in CALC0,1− CALC0,0. Also, it is easily seen that CALC0,1 is equivalent in expressive power to the second order queries SO of [CH82]. We show here that the (data) complexity =-=[Var82]-=- of CALC0,i (i ≥ 1) is bounded below by (i−1)-level hyper-exponential time, and above by (i−1)-level hyperexponential space. Furthermore, CALC0,i is able to express all (generic) queries from flat dat... |

468 |
The theory of relational databases
- Maier
(Show Context)
Citation Context ...e computation. We introduce several semantics for the calculus based on invented values to isolate this “use” from other uses. (One of these turns out to be equivalent to the unlimited interpretation =-=[Mai83]-=-). Using these alternative semantics the CALC0,i hierarchies collapse at CALC0,1. Furthermore, under these semantics there is a ‘universal type’ Tuniv which can be used to encode objects of all types.... |

283 |
Generalized first-order spectra and polynomial-time recognizable sets
- Fagin
- 1974
(Show Context)
Citation Context ...ar82] stating that SF is complete in NPTIME. Part (b), which could be proved based on reasoning analogous to that used in the proof of Theorem 4.4 (presented shortly), is a special case of the result =-=[Fag74]-=- stating that the family of problems definable in existential second-order logic is equal to NPTIME. Part (c) is trivial. ✷ Parts (a) and (b) of the above theorem indicate the close relationship betwe... |

277 | Relational queries computable in polynomial time - Immerman - 1986 |

277 |
The polynomial-time hierarchy
- Stockmeyer
- 1976
(Show Context)
Citation Context ... queries defined by stratified datalog programs [ABW88, vG88]. Results of [CH85, Kol87] imply that DATALOG ¬ ❁ CALC0,1. Finally, is was observed that SO essentially expresses the polynomial hierarchy =-=[Sto77]-=-. The final result of this section concerns intermediate types in queries from the relational calculus. These arise from the use of tuple variables whose arity is not equal to the arity of the input o... |

270 | The functional data model and the data language DAPLEX - Shipman - 1981 |

249 | Structure and Complexity of Relational Queries
- Chandra, Harel
- 1982
(Show Context)
Citation Context ... is on queries which map flat relations to flat relations. From this perspective, we are studying a family of natural extensions of the relational calculus, in the general spirit of Chandra and Harel =-=[CH82]-=-, and DATALOG. In this paper, we establish a hierarchy of queries which lies between the second order queries (SO) of [CH82] and the computable queries of [CH80, AV87]. We thus provide a framework for... |

207 |
Universality of data retrieval languages, in
- Aho, Ullman
(Show Context)
Citation Context ...lculus which computes the transitive closure of a binary relation. This query uses a variable whose type has set-height 1. Because the transitive closure cannot be computed in the relational calculus =-=[AU79]-=-, this demonstrates the fact that using intermediate types with set-height > 0 yields increased expressive power in a calculus-based language. In this paper we define CALCk,i (ALGk,i) to be the set of... |

194 | Database description with SDM: A semantic database model - HAMMER, MCLEOD - 1981 |

181 |
A formal semantic database model
- Abiteboul, Hull
(Show Context)
Citation Context ...e constructs. The types we define here are essentially equivalent to the non-first normal form relations of [Mak77, JS82, FT83], the complex objects of [AB88], and the (object) types of the IFO model =-=[AH87]-=- (and from other semantic data models). They are also essentially equivalent to the formats of [HY84] except that the marked union (or generalization) construct is not included here. Finally, there is... |

131 | Negation as failure using tight derivations for general logic programs - Gelder - 1988 |

124 | Beeri: On the Power of Languages for the Manipulation of Complex Objects INRIA Rapports de Recherche No. 846
- Abiteboul, C
- 1988
(Show Context)
Citation Context ...of complex types, objects and instances; and the complex object calculus and algebra. In this framework, types are built from set and tuple constructs. The calculus and algebra are similar to that in =-=[AB88]-=-, but do not include “built-in” (or “user defined”) predicates or functions. Due to the particular focus of the investigation, we use a somewhat restricted notion of complex object, but it will be cle... |

116 |
Computable Queries for Relational Data Bases
- Chandra, Harel
- 1980
(Show Context)
Citation Context ... or countable invention may not be computable. Hence, a notion of “terminal invention” is proposed and its semantics is shown to be essentially equivalent to the computationally complete languages QL =-=[CH80]-=- and detTL [AV88]. For the formal development, we view each class CALCk,i to be a set of purely syntactic objects. Recall from Section 2 that for a query Q = {t/T | φ(t)}, asetY ⊆ U, and an input inst... |

111 | Extended algebra and calculus for nested relational databases - Roth, Korth, et al. - 1988 |

110 | Remarks on the Algebra of Non First Normal Form Relations - Jaeschke, Schek - 1982 |

85 | Col: A logic-based language for complex objects - ABITEBOUL, GRUMBACH - 1988 |

82 | A calculus for complex objects - Bancilhon, Khoshafian - 1986 |

73 | Logic Programming with Sets - Kuper - 1987 |

72 | A consideration on normal form of notnecessarily-normalised relation in the relational data model - Makinouchi - 1977 |

61 |
Procedural and declarative database update languages (Extended Abstract
- Abiteboul, Vianu
- 1988
(Show Context)
Citation Context ...ention may not be computable. Hence, a notion of “terminal invention” is proposed and its semantics is shown to be essentially equivalent to the computationally complete languages QL [CH80] and detTL =-=[AV88]-=-. For the formal development, we view each class CALCk,i to be a set of purely syntactic objects. Recall from Section 2 that for a query Q = {t/T | φ(t)}, asetY ⊆ U, and an input instance d, Q| Y [d] ... |

59 |
semantics
- Abrial
- 1974
(Show Context)
Citation Context ...sting to compare this refinement of Lemma 6.5 with discussions in the folklore of semantic data modeling stating, intuitively, that any semantic model can be “reduced” to a Binary Data Model (such as =-=[Abr74]-=-), whose only data structure, essentially, is binary relation. Intuitively, the result here indicates two approaches to measuring the expense of such reductions: considering either (a) the number of a... |

53 |
The format model: a theory of database organization
- Hull, Yap
- 1984
(Show Context)
Citation Context ...ons of [Mak77, JS82, FT83], the complex objects of [AB88], and the (object) types of the IFO model [AH87] (and from other semantic data models). They are also essentially equivalent to the formats of =-=[HY84]-=- except that the marked union (or generalization) construct is not included here. Finally, there is a close relationship between the types here and the Logical Data Model of [KV84]. Example 2.1: Figur... |

53 |
A New Approach to Database Logic
- Kuper, Vardi
- 1984
(Show Context)
Citation Context ...ied variously as complex objects [AB88, BK89, Hul87], nested or non-first normal form relations [FT83, RKS88, JS82], and also arise in the semantic [AH87, HM81, HK87, Shi81] and other database models =-=[KV84]-=-, etc. Recent work on query languages for complex objects has focused on developing [AB88, KV84, RKS88] and studying [KV88, GvG88] natural extensions of the relational calculus and algebra to use the ... |

44 |
A survey of theoretical research on typed complex database objects
- Hull
- 1988
(Show Context)
Citation Context ...o present a result concerning the use of intermediate types in relational queries. To motivate the discussion, we present an example for computing transitive closure which appears in [AB88] (see also =-=[Hul87]-=-), and an example for recognizing even cardinality (see also [CH82]). Example 3.1: Consider the database schema D = 〈PAR: T1〉 (where T1 =[U, U]) and formula φ as in Example 2.4. Let database d = 〈PAR:... |

40 | The expressive power of stratified logics programs - Kolaitis - 1991 |

37 |
Equality and Domain Closure in First-Order Databases
- Reiter
- 1980
(Show Context)
Citation Context ... is a predicate symbol. Formulas are built using the sentential connectives in the usual manner, and with ‘typed’ quantifiers ((∀x/T φ) and(∃x/T φ)), similar in spirit to the approach taken by Reiter =-=[Rei80]-=-. Speaking intuitively, a typed quantifier of a variable can be viewed as assigning a type to the occurrences of that variable within the scope of the quantifier. Finally, a ‘typed calculus query’ fro... |

33 |
A.K.: Programming primitives for database languages
- Chandra
- 1981
(Show Context)
Citation Context ... the domain is assumed, then the language relational calculus plus fixpoint [CH82] has expressive power equivalent to PTIME queries [Var82, Imm86], and that the language relational algebra plus while =-=[Cha81]-=- has expressive power equivalent to PSPACE queries [Var82]. On the other hand, if an order for the domain is not given, the exact relationships between these languages and (generic) PTIME and PSPACE a... |

32 | Sets and negation in a logical database language (LDLl - Beeri - 1987 |

28 |
Untyped sets, inventions, and computable queries
- Hull, Su
- 1989
(Show Context)
Citation Context ...rtion of this result was demonstrated in [AGSS86], and the 250scomplete result was independently developed in [HS88] (details appear in [HS89a]). Also, our study of countable invention is extended in =-=[HS89c]-=-, where it is shown to have essentially the same expressive power as the arithmetic hierarchy. Finally, we discuss the relationship between the calculus with invention and “computable queries” studied... |

27 |
On Spectra
- Bennett
- 1962
(Show Context)
Citation Context ...ime (or space). Finally, we show that the CALC0,i hierarchy does not collapse because for each i ≥ 0, CALC0,i is strictly weaker than CALC0,i+1. 220sThe proof of this is based on a spectra theorem of =-=[Ben62]-=-. The study of the use of intermediate types just described is closely related to an independent investigation by Kuper and Vardi [KV88]. They characterize the complexity of families of queries (with ... |

26 |
Principles of Database Systems, 2nd Edition
- Ullman
- 1982
(Show Context)
Citation Context ...out intermediate types into a certain form, based on which the proof of Theorem 3.11 is easily 234scarried out (this proof is reminiscent to the proof that domain calculus can simulate tuple calculus =-=[Ull82]-=-). Lemma 3.10: For any query Q = {t | φ(t)} ∈CALC0,0 which does not use intermediate types, there exists an equivalent query Q ′ which also has no intermediate types, such that: Q ′ = {t |∃v1 ···∃vk (... |

24 | Operators for non-first-normal-form relations - Fischer, Thomas - 1983 |

23 |
Gucht. \Possibilities and Limitations of Using Flat Operators in Nested Algebra Expressions
- Paredaens, Van
- 1988
(Show Context)
Citation Context ...m the algebra for nested relations [FT83, JS82]. Let ALG− denote the algebra for nested relations which includes the usual operators and nest and unnest, but not the powerset operator. It is shown in =-=[PvG88]-=- that the ALG − 0,i collapses, and that ∪0≤iALG − 0,i ≡ CALC0,0, i.e., the relational calculus. Finally, this approach has also been applied to analyze the expressive power of queries directed towards... |

22 | Domain independence and the relational calculus
- Hull, Su
- 1994
(Show Context)
Citation Context ...me expressive power as with the limited interpretation. A key portion of this result was demonstrated in [AGSS86], and the 250scomplete result was independently developed in [HS88] (details appear in =-=[HS89a]-=-). Also, our study of countable invention is extended in [HS89c], where it is shown to have essentially the same expressive power as the arithmetic hierarchy. Finally, we discuss the relationship betw... |

21 |
Reduction of a relational model with infinite domains to the finite-domain case
- Ailamazyan, Gilula, et al.
- 1986
(Show Context)
Citation Context ...pretation. In other words, the relational calculus with the unlimited interpretation has the same expressive power as with the limited interpretation. A key portion of this result was demonstrated in =-=[AGSS86]-=-, and the 250scomplete result was independently developed in [HS88] (details appear in [HS89a]). Also, our study of countable invention is extended in [HS89c], where it is shown to have essentially th... |

20 |
A transcation language complete for database update and specification
- Abiteboul, Vianu
- 1987
(Show Context)
Citation Context ...SO. We also consider queries from the complex object calculus which use invented values as “scratch paper”. This is related to the ‘with new’ construct used in connection with procedural languages in =-=[AV87]-=- and to the creation of new object identifiers supported in many object-oriented database models. This yields a family of languages, some equivalent to the computationally ‘complete’ languages of [CH8... |

18 |
Learning logic
- Jacobs, jordan
- 1985
(Show Context)
Citation Context ...se Systems, March, 1988.” † Current address: Computer Science Department, University of California, Santa Barbara, CA 93106. 219sarrived at a calculus language in the spirit of Jacobs’ database logic =-=[Jac82]-=-, and a corresponding algebra which has equivalent expressive power. In this paper we initiate an investigation into how the use of sets in these languages extends their expressive power, and increase... |

18 | On the Complexity of Queries in the Logical Data Model
- Kuper, Vardi
- 1993
(Show Context)
Citation Context ...per-exponential amount of time, and which have a bounded number of alternations of ‘existential’ and ‘universal’ states (which correspond to the number of quantifier alternations in the formula). 240s=-=[KV88]-=- also studies the impact of permitting intermediate types whose tuples have differing widths. Thus, [KV88] provides a much more complete picture of the complexity of queries involving the set construc... |

16 |
The powerset algebra as a result of adding programming constructs to the nested relational algebra
- Gyssens, Gucht
- 1988
(Show Context)
Citation Context ...ight 1 [Var82]. The relationship of the fixpoint operator, while loops, and the powerset operator in the context 1 σ is extended naturally to databases. 230sof a complex object algebra is explored in =-=[GvG88]-=-. Furthermore, given instances of types in τ0, the problem of recognizing even cardinality is easily expressed using an intermediate type from τ1 as shown by the following example. Example 3.2: Let th... |

15 |
Relative information capacity of simple relational schemata
- Hull
- 1986
(Show Context)
Citation Context ... denoted C ≡ C ′ ,ifC ⊑ C ′ and C ′ ⊑ C. Finally, C is (strictly) less expressive than C ′ , denoted C ❁ C ′ ,ifC ⊑ C ′ and C �≡ C ′ . Definition: If C ⊆ U, Q : D → T is a query, then: Q is C-generic =-=[Hul86]-=-, if1 f ◦ σ = σ ◦ f for each permutation σ over U with ∀x ∈ C, σ(x) =x. Q is generic if Q is C-generic for some finite C. It is clear that each query in the calculus and algebra described here is gene... |

13 |
On Accessing Object-oriented Databases: Expressive Power, Complexity, and Restrictions
- Hull, Su
- 1989
(Show Context)
Citation Context ...∪0≤iALG − 0,i ≡ CALC0,0, i.e., the relational calculus. Finally, this approach has also been applied to analyze the expressive power of queries directed towards semantic and object-oriented databases =-=[HS89b]-=-. Appendix: ProofofProposition 6.9 Proposition 6.9: If objects built using infinite sets are permitted, then for each i ≥ 0, CALC ci 0,i ❁ CALCci 0,i+1 . Proof: The proof uses a diagonal argument. Mor... |

9 | Horn clauses and generalizations - Chandra, Harel - 1985 |

9 | Semantic data modeling: Survey, applications, and research issues - Hull, King - 1987 |