## Normal Forms and Conservative Properties for Query Languages over Collection Types (1993)

Venue: | In Proceedings of 12th ACM Symposium on Principles of Database Systems |

Citations: | 57 - 27 self |

### BibTeX

@INPROCEEDINGS{Wong93normalforms,

author = {Limsoon Wong},

title = {Normal Forms and Conservative Properties for Query Languages over Collection Types},

booktitle = {In Proceedings of 12th ACM Symposium on Principles of Database Systems},

year = {1993},

pages = {26--36}

}

### Years of Citing Articles

### OpenURL

### Abstract

Strong normalization results are obtained for a general language for collection types. An induced normal form for sets and bags is then used to show that the class of functions whose input has height (that is, the maximal depth of nestings of sets/bags/lists in the complex object) at most i and output has height at most o definable in a nested relational query language without powerset operator is independent of the height of intermediate expressions used. Our proof holds regardless of whether the language is used for querying sets, bags, or lists, even in the presence of variant types. Moreover, the normal forms are useful in a general approach to query optimization. Paredaens and Van Gucht proved a similar result for the special case when i = o = 1. Their result is complemented by Hull and Su who demonstrated the failure of independence when powerset operator is present and i = o = 1. The theorem of Hull and Su was generalized to all i and o by Grumbach and Vianu. Our result genera...

### Citations

742 | Notions of Computation and Monads
- Moggi
- 1991
(Show Context)
Citation Context ...g a counterpart to the theorem of Grumbach and Vianu. 1 Introduction In [6] we proposed a nested relational calculus and a nested relational algebra based on structural recursion [5, 4] and on monads =-=[25, 14]-=-. In this report, we describe relative set abstractionsas our third nested relational query language. This query language is similar to the well known list comprehension mechanism in functional progra... |

465 | Comprehending monads
- Wadler
- 1990
(Show Context)
Citation Context ...g a counterpart to the theorem of Grumbach and Vianu. 1 Introduction In [6] we proposed a nested relational calculus and a nested relational algebra based on structural recursion [5, 4] and on monads =-=[25, 14]-=-. In this report, we describe relative set abstractionsas our third nested relational query language. This query language is similar to the well known list comprehension mechanism in functional progra... |

333 |
Denotational Semantics, A Methodology for Language Development", W.C.Brown
- Schmidt
- 1988
(Show Context)
Citation Context ...1 ; :::; x sn n 2 e n g : ftg Semantics. The intended semantics is that of sets and functions. A detailed specification is omitted; but for example, with the usual notations of denotational semantics =-=[17, 8]-=-, [[fe j x 1 2 e 1 ; :::; x n 2 e n g]]ae = f[[e]]ae[d 1 =x 1 ; :::; d n =x n ] j d 1 2 [[e 1 ]]ae & ::: & d n 2 [[e n ]]ae[d 1 =x 1 ; :::; d n\Gamma1 =x n\Gamma1 ]g. Examples. f(x; y) j x 2 X; y 2 Y ... |

270 |
Semantics of Programming Languages. Structures and Techniques
- Gunter
- 1992
(Show Context)
Citation Context ...1 ; :::; x sn n 2 e n g : ftg Semantics. The intended semantics is that of sets and functions. A detailed specification is omitted; but for example, with the usual notations of denotational semantics =-=[17, 8]-=-, [[fe j x 1 2 e 1 ; :::; x n 2 e n g]]ae = f[[e]]ae[d 1 =x 1 ; :::; d n =x n ] j d 1 2 [[e 1 ]]ae & ::: & d n 2 [[e n ]]ae[d 1 =x 1 ; :::; d n\Gamma1 =x n\Gamma1 ]g. Examples. f(x; y) j x 2 X; y 2 Y ... |

177 |
A formal semantic database model
- ARITEBOUL, HULL
- 1984
(Show Context)
Citation Context ...proved in two ways. Firstly, Many modern data models possess an additional data structuring mechanism known variously as coproducts, variant types, sum types, or tagged unions (see Abiteboul and Hull =-=[3]-=- and Hull and Yap [12] for example). However, many papers on expressive power do not consider this feature [11, 7, 2]. We extend the nested relational calculus of [6] with variant types and prove that... |

146 |
a non-strict functional language with polymorphic types
- Turner, Miranda
- 1985
(Show Context)
Citation Context ...tractionsas our third nested relational query language. This query language is similar to the well known list comprehension mechanism in functional programming languages such as Haskell [10], Miranda =-=[22]-=-, KRC [21], etc. This language is equivalent to our earlier query languages both in terms of semantics and in terms of equational theories. This strong sense of equivalence allows our three query lang... |

132 | Naturally embedded query languages
- Breazu-Tannen, Buneman, et al.
- 1992
(Show Context)
Citation Context ... was generalized to all i and o by Grumbach and Vianu. Our result generalizes Paredaens and Van Gucht's to all i and o, providing a counterpart to the theorem of Grumbach and Vianu. 1 Introduction In =-=[6]-=- we proposed a nested relational calculus and a nested relational algebra based on structural recursion [5, 4] and on monads [25, 14]. In this report, we describe relative set abstractionsas our third... |

123 | On the Power of Languages for the Manipulation of Complex Objects
- Abiteboul, Beeri
- 1988
(Show Context)
Citation Context ...riously as coproducts, variant types, sum types, or tagged unions (see Abiteboul and Hull [3] and Hull and Yap [12] for example). However, many papers on expressive power do not consider this feature =-=[11, 7, 2]-=-. We extend the nested relational calculus of [6] with variant types and prove that the extended calculus remains conservative with respect to height of input/output. Secondly, the proof we give for r... |

109 | Structural Recursion as a Query Language
- Breazu-Tannen, Buneman, et al.
(Show Context)
Citation Context ...all i and o, providing a counterpart to the theorem of Grumbach and Vianu. 1 Introduction In [6] we proposed a nested relational calculus and a nested relational algebra based on structural recursion =-=[5, 4]-=- and on monads [25, 14]. In this report, we describe relative set abstractionsas our third nested relational query language. This query language is similar to the well known list comprehension mechani... |

109 |
Remarks on the algebra of non first normal form relations
- Jaeschke, Schek
- 1982
(Show Context)
Citation Context ... power by an operation such as a powerset. This result has a practical significance. Some databases are designed to support nested sets up to a fixed depth of nesting. For example, Jaeschke and Schek =-=[13] cons-=-ider nonfirst normal form relations in which attribute domains are limited to powersets of simple domains (that is, databases whose height is at most 2). "N RL restricted to expressions of height... |

80 |
Report on the programming language Haskell
- Hudak, Wadler
- 1991
(Show Context)
Citation Context ...lative set abstractionsas our third nested relational query language. This query language is similar to the well known list comprehension mechanism in functional programming languages such as Haskell =-=[10]-=-, Miranda [22], KRC [21], etc. This language is equivalent to our earlier query languages both in terms of semantics and in terms of equational theories. This strong sense of equivalence allows our th... |

72 |
Nested Relational Structures
- Thomas, Fischer
- 1986
(Show Context)
Citation Context ... height does not increase expressive power. This complements work by other researchers. To begin with, Paredaens and Van Gucht [15, 16] showed that the nested relational algebra of Thomas and Fischer =-=[18]-=- is conservative with respect to flat relational algebra in the sense we have described. This result implies that NRL i;o;k+1 is conservative with respect to NRL i;o;k when i = o = 1. Our result gener... |

67 | Logical and Computational Aspects of Programming with Sets/Bags/Lists
- Breazu-Tannen, Subrahmanyam
- 1991
(Show Context)
Citation Context ...all i and o, providing a counterpart to the theorem of Grumbach and Vianu. 1 Introduction In [6] we proposed a nested relational calculus and a nested relational algebra based on structural recursion =-=[5, 4]-=- and on monads [25, 14]. In this report, we describe relative set abstractionsas our third nested relational query language. This query language is similar to the well known list comprehension mechani... |

60 | Comprehension: A Query Notation for DBPLs
- Trinder
- 1991
(Show Context)
Citation Context ... of input/output. The two improvements mentioned above are presented in the section 4. 2 Relative set abstraction Wadler and Trinder argued that list/set/bag comprehension is a natural query notation =-=[20, 19, 26]-=-. They also demonstrated that this notation does not hamper query optimization. In this section we present a query language based on comprehension that is equivalent to our nested relational algebra a... |

45 | On the Expressive Power of Database Queries with Intermediate Types
- Hull, Su
- 1991
(Show Context)
Citation Context ...n i = o = 1. Our result generalizes this to conservativeness for all i and o. Hull and Su proposed a nested relational query language in which powerset is expressible and studied its expressive power =-=[11]-=-. One of their results is that it is not conservative with respect to the flat relational algebra in our sense. Writing NRL for the language obtained by adding a powerset operator to NRL, this implies... |

34 |
Recursion equations as a programming language
- Turner
- 1982
(Show Context)
Citation Context ...s our third nested relational query language. This query language is similar to the well known list comprehension mechanism in functional programming languages such as Haskell [10], Miranda [22], KRC =-=[21]-=-, etc. This language is equivalent to our earlier query languages both in terms of semantics and in terms of equational theories. This strong sense of equivalence allows our three query languages to b... |

30 |
Converting nested relational algebra expressions into algebra expressions
- Paredaens, Gucht
- 1992
(Show Context)
Citation Context ...dependent of k. Thus the ability to use intermediate expressions of great height does not increase expressive power. This complements work by other researchers. To begin with, Paredaens and Van Gucht =-=[15, 16]-=- showed that the nested relational algebra of Thomas and Fischer [18] is conservative with respect to flat relational algebra in the sense we have described. This result implies that NRL i;o;k+1 is co... |

24 |
Possibilities and Limitations of Using Flat Operators in Nested Algebra Expressions
- Paredaens, Gucht
- 1988
(Show Context)
Citation Context ...dependent of k. Thus the ability to use intermediate expressions of great height does not increase expressive power. This complements work by other researchers. To begin with, Paredaens and Van Gucht =-=[15, 16]-=- showed that the nested relational algebra of Thomas and Fischer [18] is conservative with respect to flat relational algebra in the sense we have described. This result implies that NRL i;o;k+1 is co... |

24 |
Listlessness is Better than Laziness
- Wadler
- 1984
(Show Context)
Citation Context ...form of logic formulae and the intuition behind their proof is mainly that of logical equivalence. In our case, our inspiration comes from a well known optimization strategy (see Wadler's early paper =-=[23, 24] on t-=-his subject). In plain terms, we have evaluated the query without looking at the input and managed to flatten the query sufficiently until all intermediate operators of higher heights are "optimi... |

19 |
Gucht. An Introduction to the Completeness of Languages for Complex Objects and Nested Relations
- Abiteboul, Beeri, et al.
- 1987
(Show Context)
Citation Context ...to height of input/output. Secondly, the proof we give for relative set abstraction relies on a set-based semantics. This is in line with the work of many researchers as reported in Abiteboul et. al. =-=[1]-=-, Abiteboul and Beeri [2], Hull and Su [11], Grumbach and Vianu [7], Paredaens and Van Gucht [15, 16], Gyssens and Van Gucht [9], etc. But our languages can also be given interpretations based on bags... |

17 | List Comprehensions and the Relational Calculus
- Trinder, Wadler
- 1988
(Show Context)
Citation Context ... of input/output. The two improvements mentioned above are presented in the section 4. 2 Relative set abstraction Wadler and Trinder argued that list/set/bag comprehension is a natural query notation =-=[20, 19, 26]-=-. They also demonstrated that this notation does not hamper query optimization. In this section we present a query language based on comprehension that is equivalent to our nested relational algebra a... |

14 |
A Comparison Between Algebraic Query Languages for Flat and Nested Databases
- Gyssens, Gucht
- 1991
(Show Context)
Citation Context ...line with the work of many researchers as reported in Abiteboul et. al. [1], Abiteboul and Beeri [2], Hull and Su [11], Grumbach and Vianu [7], Paredaens and Van Gucht [15, 16], Gyssens and Van Gucht =-=[9]-=-, etc. But our languages can also be given interpretations based on bags and lists. It is desirable to know whether our main result holds when the languages are used to manipulate nested lists and bag... |

14 |
Towards a Theory of Bulk Types. Fide
- Watt, Trinder
- 1991
(Show Context)
Citation Context ... of input/output. The two improvements mentioned above are presented in the section 4. 2 Relative set abstraction Wadler and Trinder argued that list/set/bag comprehension is a natural query notation =-=[20, 19, 26]-=-. They also demonstrated that this notation does not hamper query optimization. In this section we present a query language based on comprehension that is equivalent to our nested relational algebra a... |

13 |
The Format model: A theory of database organisation
- Hull, Yap
- 1984
(Show Context)
Citation Context ...irstly, Many modern data models possess an additional data structuring mechanism known variously as coproducts, variant types, sum types, or tagged unions (see Abiteboul and Hull [3] and Hull and Yap =-=[12]-=- for example). However, many papers on expressive power do not consider this feature [11, 7, 2]. We extend the nested relational calculus of [6] with variant types and prove that the extended calculus... |

11 |
Playing games with objects
- Grumbach, Vianu
- 1990
(Show Context)
Citation Context ...es the kind of functions that our languages can express. In particular, using intermediate expressions of greater heights does not add expressive power. This is in contrast to languages considered by =-=[2, 1, 11, 7]-=- where the kind of functions that can be expressed is not characterized by the height of input/output and is sensitive to the height of intermediate operators. The principal difference between our lan... |

4 |
Aconservative property of a nested relational query language
- Wong
- 1910
(Show Context)
Citation Context ...tes the same value as RN [e]. 2 Thus relative set abstraction and nested relational calculus are equivalent. Moreover, the translations preserve and reflect the equational theories of these languages =-=[27]-=-. Since our nested relational calculus does not have membership test, or anything that looks like a nesting operation, we show that they are definable. In [6], it was established that equality test eq... |

2 |
Listlessness is better than laziness II
- Wadler
- 1985
(Show Context)
Citation Context ...form of logic formulae and the intuition behind their proof is mainly that of logical equivalence. In our case, our inspiration comes from a well known optimization strategy (see Wadler's early paper =-=[23, 24] on t-=-his subject). In plain terms, we have evaluated the query without looking at the input and managed to flatten the query sufficiently until all intermediate operators of higher heights are "optimi... |