## On The Power Of Languages For The Manipulation Of Complex Objects (1993)

Venue: | In Proceedings of International Workshop on Theory and Applications of Nested Relations and Complex Objects |

Citations: | 123 - 6 self |

### BibTeX

@TECHREPORT{Abiteboul93onthe,

author = {Serge Abiteboul and Catriel Beeri},

title = {On The Power Of Languages For The Manipulation Of Complex Objects},

institution = {In Proceedings of International Workshop on Theory and Applications of Nested Relations and Complex Objects},

year = {1993}

}

### Years of Citing Articles

### OpenURL

### Abstract

Various models and languages for describing and manipulating hierarchically structured data have been proposed. Algebraic, calculus-based and logic-programming oriented languages have all been considered. This paper presents a general model for complex objects, and languages for it based on the three paradigms. The algebraic language generalizes those presented in the literature; it is shown to be related to the functional style of programming advocated by Backus. The notion of domain independence familiar from relational databases is defined, and syntactic restrictions (referred to as safety conditions) on calculus queries are formulated, that guarantee domain independence. The main results are: The domain-independent calculus, the safe calculus, the algebra, and the logic-programming oriented language have equivalent expressive power. In particular, recursive queries, such as the transitive closure, can be expressed in each of the languages. For this result, the algebra needs the pow...

### Citations

634 |
Towards a theory of declarative knowledge
- Apt, Blair, et al.
- 1988
(Show Context)
Citation Context ...xpressive than (complex value) calculus. In the same spirit of introducing recursion, we now present a simple language based on recursive rules. We handle negation using the concept of "layers&qu=-=ot; as in [9, 4, 13, 40, 49]-=- and others. Given a database scheme, the relation names in it, b R 1 ; : : : ; b R n , are called base relations. The language will use names of additional relations, called derived relations. The la... |

561 |
The implementation of functional programming languages
- Jones
- 1987
(Show Context)
Citation Context ...[33]. Of course, set terms have been in use in mathematics for a long time. A similar notation for functional languages, that is indeed very close to database algebraic languages has been proposed in =-=[43], and late-=-r proposed as a query language formalism is several papers, e.g., [45]. . The expression fx j 'g can be replaced by a new variable y "anded" with 8x(x 2 y $ '). As an example, consider the q... |

467 | Comprehending monads
- Wadler
- 1990
(Show Context)
Citation Context ...er-order operations is closely related to recent research on query languages for bulk types that uses a categorytheoretic framework, and in particular to the notions of monads and comprehensions, see =-=[45, 50]-=-, and the monadic algebra of [17]. Comprehensions can be viewed as a pure form of generalized SQL (a paradigm not considered here). See the last section for further discussion. 1.2 Comparison with Pre... |

334 |
A relational model for large shared data banks
- Codd
- 1970
(Show Context)
Citation Context ... Association Franco- Israelienne pour la Recherche Scientifique et Technologique. 1 Introduction The first normal form restriction forces the components of tuples in relational databases to be atomic =-=[19]-=-. In the last decade it has been widely recognized that this restriction imposes unacceptable constraints on the use of database technology in a variety of application domains such as engineering, com... |

208 |
Universality of data retrieval languages
- Aho, Ullman
- 1979
(Show Context)
Citation Context ...eby characterizing the power of many algebras found in the literature. ffl It is well-known that even simple recursive queries (e.g., transitive closure) cannot be expressed using relational calculus =-=[8]-=-. This does not hold for our languages: it turns out that the algebra, the safe (or domain independent) calculus, and a language for complex objects based on recursive rules are equivalent. This follo... |

194 | Database description with SDM: A semantic database model
- HAMMER, MCLEOD
- 1981
(Show Context)
Citation Context ... Previous Work Our model generalizes the non-first-normal-form relational models [25, 32, 35, 39, 44]. The objects we deal with can also be seen as the objects resulting in semantic database modeling =-=[5, 30, 27]-=- from the use of aggregation (tuple constructors) and classification 2 Another operation, the powerset, was added not because a need for it was felt in the algebra itself, but rather to make the algeb... |

171 |
The Relational Model with Relation-Valued Attributes
- Schek, Scholl
- 1986
(Show Context)
Citation Context ...en introduced and studied. In the mid 80's a variety of models generalized the relational model by allowing hierarchically structured data; these are the nested relations and complex objects models 1 =-=[2, 25, 35, 44]-=-. Towards the end of the decade the emphasis shifted to semantic and particularly to object-oriented models. These models support features such as object identity, modelling of behaviour, encapsulatio... |

132 |
Negation as failure using tight derivations for general logic programs
- Gelder
- 1988
(Show Context)
Citation Context ...xpressive than (complex value) calculus. In the same spirit of introducing recursion, we now present a simple language based on recursive rules. We handle negation using the concept of "layers&qu=-=ot; as in [9, 4, 13, 40, 49]-=- and others. Given a database scheme, the relation names in it, b R 1 ; : : : ; b R n , are called base relations. The language will use names of additional relations, called derived relations. The la... |

81 | A Calculus for Complex Objects - Bancilhon, Khoshafian - 1986 |

73 | Logic Programming with Sets
- Kuper
- 1987
(Show Context)
Citation Context ...worthy of study. We consider a calculus-based language (similar to the one proposed by Jacobs [31], and those in [28, 35]), an algebra, and a logic-programming language (similar to those presented in =-=[13, 14, 37, 36, 4]). 1 Note that the w-=-ord "object" as used in "complex object", and in this paper, does not refer to the notion of object as known in object-oriented database models. In particular, our objects have no ... |

73 |
Extending relational algebra and relational calculus with set-valued attributes and aggregate functions
- Ozsoyoglu, Ozsoyoglu, et al.
- 1987
(Show Context)
Citation Context ... and values reachable from an object form a (virtual) tree. Thus, our languages can be applied to such models as well. Equivalence results of algebraic and calculus-based languages have been given in =-=[37, 41, 42, 35]-=-. The equivalence of relational algebra and calculus with aggregates was considered in [33], and extended in [41] to relations with set-valued attributes. A comparison is proposed in [35] for a non-fi... |

68 | A consideration on normal form of not-necessarily-normalized relation in the relational data model
- Makinouchi
- 1977
(Show Context)
Citation Context ...y recognized that this restriction imposes unacceptable constraints on the use of database technology in a variety of application domains such as engineering, computer aided design, or office systems =-=[34, 38, 39]-=-. Many models that incorporate more semantics into databases have been introduced and studied. In the mid 80's a variety of models generalized the relational model by allowing hierarchically structure... |

59 | Comprehensions, a query notation for DBPLs
- TRINDER
- 1991
(Show Context)
Citation Context ...of singleton sets) are natural transformations, and furthermore, they satisfy the axioms of a monad. With the empty set and union, we have a ringad. For definitions and related work, see for instance =-=[45, 50]-=-. In addition to the general framework and specific results described above, it is of interest to consider which of those languages, if any, is best for practical use. In this context, it is important... |

54 |
A New Approach to Database Logic
- Kuper, Vardi
- 1984
(Show Context)
Citation Context ...worthy of study. We consider a calculus-based language (similar to the one proposed by Jacobs [31], and those in [28, 35]), an algebra, and a logic-programming language (similar to those presented in =-=[13, 14, 37, 36, 4]). 1 Note that the w-=-ord "object" as used in "complex object", and in this paper, does not refer to the notion of object as known in object-oriented database models. In particular, our objects have no ... |

53 |
The format model: a theory of database organization
- Hull, Yap
- 1984
(Show Context)
Citation Context ... Previous Work Our model generalizes the non-first-normal-form relational models [25, 32, 35, 39, 44]. The objects we deal with can also be seen as the objects resulting in semantic database modeling =-=[5, 30, 27]-=- from the use of aggregation (tuple constructors) and classification 2 Another operation, the powerset, was added not because a need for it was felt in the algebra itself, but rather to make the algeb... |

45 | On the Expressive Power of Database Queries with Intermediate Types
- Hull, Su
- 1991
(Show Context)
Citation Context ...calculus. This is a consequence of the ability to manipulate richer structures in temporary results. In particular, the powerset operation allows one to increase the set height of values. Hull and Su =-=[29]-=- exhibit a hierarchy of languages, based on restrictions on the types of intermediate results. Our main technical results have been included in the previous, unpublished, version of this paper [2]. Th... |

44 |
A survey of theoretical research on typed complex database objects
- Hull
- 1988
(Show Context)
Citation Context ... semantic models, languages that allow one to access such structures are important and worthy of study. We consider a calculus-based language (similar to the one proposed by Jacobs [31], and those in =-=[28, 35]), an algebra, and a-=- logic-programming language (similar to those presented in [13, 14, 37, 36, 4]). 1 Note that the word "object" as used in "complex object", and in this paper, does not refer to the... |

26 |
Reloop, an algebra based query language for an object-oriented database system
- Cluet, Delobel, et al.
- 1990
(Show Context)
Citation Context ...for practical use. In this context, it is important to note that we have not considered SQL extensions in this paper. Most implemented systems actually use languages based on this paradigm, see e.g., =-=[21]-=-. Comprehensions, considered in [45, 50], can be viewed as a pure form of generalized SQL. We conjecture that language paradigms based on comprehensions or similar ideas are more suitable for user-int... |

26 |
The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas
- Paola
- 1969
(Show Context)
Citation Context ...as do not necessarily define domain independent queries. Domain independence is a semantic property, defined in terms of structures, known to be undecidable even for the classical relational calculus =-=[22, 47]-=-. The same holds for our calculus, since it contains the relational calculus. For relational calculus, there exist syntactic restrictions that guarantee domain independence, yet do not limit its expre... |

24 |
Computable queries for relational database systems
- Chandra, Harel
- 1980
(Show Context)
Citation Context ...e also new. A model slightly less general than ours has been presented in [23]. They allow nested structures in which internal nodes are sets, and the leaves are relations. They extend the results of =-=[20]-=- concerning completeness of query languages to this model. Their techniques can be extended to our model; however, completeness of languages in the sense of [20] is not treated here. For results about... |

24 |
Operators for non-first-normal-form relations
- Fischer, Thomas
- 1983
(Show Context)
Citation Context ...en introduced and studied. In the mid 80's a variety of models generalized the relational model by allowing hierarchically structured data; these are the nested relations and complex objects models 1 =-=[2, 25, 35, 44]-=-. Towards the end of the decade the emphasis shifted to semantic and particularly to object-oriented models. These models support features such as object identity, modelling of behaviour, encapsulatio... |

19 |
Gucht. An Introduction to the Completeness of Languages for Complex Objects and Nested Relations
- Abiteboul, Beeri, et al.
- 1987
(Show Context)
Citation Context ... languages to this model. Their techniques can be extended to our model; however, completeness of languages in the sense of [20] is not treated here. For results about completeness for our model, see =-=[3]-=-. The languages that we present are strictly more powerful than the relational calculus. Mappings from relations to relations can be defined using those languages, which cannot be expressed in the rel... |

19 | The Representation and Deductive Retrieval of Complex Objects - Zaniolo - 1985 |

18 |
Learning logic
- Jacobs, jordan
- 1985
(Show Context)
Citation Context ...object-oriented and semantic models, languages that allow one to access such structures are important and worthy of study. We consider a calculus-based language (similar to the one proposed by Jacobs =-=[31], and those in [28, -=-35]), an algebra, and a logic-programming language (similar to those presented in [13, 14, 37, 36, 4]). 1 Note that the word "object" as used in "complex object", and in this paper... |

17 |
Safety and correct translation of relational calculus formulas
- Gelder, Topor
- 1987
(Show Context)
Citation Context ...olds for our calculus, since it contains the relational calculus. For relational calculus, there exist syntactic restrictions that guarantee domain independence, yet do not limit its expressive power =-=[46, 48]-=-. We also consider syntactic restrictions and prove a similar result. Before we introduce the languages, we comment on an important issue that needs to be dealt with in each of them. An important clas... |

15 |
Can programming be liberated from the von Neuman style
- Backus
- 1978
(Show Context)
Citation Context ...action, the relational algebra uses a different paradigm --- it is based on a small set of operations, that encapsulate useful iterations over relations, and that can be composed to express queries. (=-=[10]-=- is a seminal paper on this paradigm of functional programming.) Our algebra is based on the same approach. Some of the classical relational operations, like union, intersection and difference can be ... |

12 |
A logic for negation in database systems
- Naqvi
- 1986
(Show Context)
Citation Context ...xpressive than (complex value) calculus. In the same spirit of introducing recursion, we now present a simple language based on recursive rules. We handle negation using the concept of "layers&qu=-=ot; as in [9, 4, 13, 40, 49]-=- and others. Given a database scheme, the relation names in it, b R 1 ; : : : ; b R n , are called base relations. The language will use names of additional relations, called derived relations. The la... |

9 |
The decision problem for database dependencies
- Vardi
- 1981
(Show Context)
Citation Context ...as do not necessarily define domain independent queries. Domain independence is a semantic property, defined in terms of structures, known to be undecidable even for the classical relational calculus =-=[22, 47]-=-. The same holds for our calculus, since it contains the relational calculus. For relational calculus, there exist syntactic restrictions that guarantee domain independence, yet do not limit its expre... |

7 |
An extension of relational algebra for summary tables
- Ozsoyoglu, Ozsoyoglu
- 1983
(Show Context)
Citation Context ... used. Thus, the second direction is also taken care of. The main results of the paper apply in this general setting (with some restrictions, see Section 8). This generalizes, for example, results of =-=[33, 41]-=-. The approach above works smoothly for the calculus-based and logic-programming paradigms. For the algebra more effort is needed. It has to include operations to allow one to describe explicitly quit... |

6 |
A database management system for document retrieval applications
- Macleod
- 1981
(Show Context)
Citation Context ...y recognized that this restriction imposes unacceptable constraints on the use of database technology in a variety of application domains such as engineering, computer aided design, or office systems =-=[34, 38, 39]-=-. Many models that incorporate more semantics into databases have been introduced and studied. In the mid 80's a variety of models generalized the relational model by allowing hierarchically structure... |

3 |
An overview of database management technology
- Kobayashi
- 1980
(Show Context)
Citation Context ...y recognized that this restriction imposes unacceptable constraints on the use of database technology in a variety of application domains such as engineering, computer aided design, or office systems =-=[34, 38, 39]-=-. Many models that incorporate more semantics into databases have been introduced and studied. In the mid 80's a variety of models generalized the relational model by allowing hierarchically structure... |

2 |
Non first normal form relations:an algebra allowing data restructuring JCSS
- Abiteboul, Bidoit
- 1986
(Show Context)
Citation Context ...lity, we actually use later the notation id for the identity function. The restriction imposed on the structure of nested relations is mostly cosmetics. A more fundamental limitation is considered in =-=[1]-=- which describes the data structure and the language used in the Verso system. Like for nested relations, set and tuple constructors must alternate. Further, a relation is defined recursively to be a ... |

2 |
A logical approach to the manipulation of Complex Objects
- Abiteboul, Grumbach
- 1988
(Show Context)
Citation Context ...worthy of study. We consider a calculus-based language (similar to the one proposed by Jacobs [31], and those in [28, 35]), an algebra, and a logic-programming language (similar to those presented in =-=[13, 14, 37, 36, 4]). 1 Note that the w-=-ord "object" as used in "complex object", and in this paper, does not refer to the notion of object as known in object-oriented database models. In particular, our objects have no ... |

2 |
A formal semantic database model TODS
- Abiteboul, Hull
- 1988
(Show Context)
Citation Context ... Previous Work Our model generalizes the non-first-normal-form relational models [25, 32, 35, 39, 44]. The objects we deal with can also be seen as the objects resulting in semantic database modeling =-=[5, 30, 27]-=- from the use of aggregation (tuple constructors) and classification 2 Another operation, the powerset, was added not because a need for it was felt in the algebra itself, but rather to make the algeb... |

2 |
Object restructuring in semantic database models
- Abiteboul, Hull
- 1986
(Show Context)
Citation Context ...ive as the algebra without powerset. (set constructors). Sets of homogeneous objects only are considered. In that respect, the data structure that we study is strictly weaker than those considered in =-=[5, 6, 30]-=-, but we believe that our results can easily be extended if heterogeneous sets are allowed. Our types can be described by trees, that is, our objects are actually values. Unlike in [37], cycles are no... |

2 |
Object Identity as a Query Language Primitive, proc
- Abiteboul, Kanellakis
- 1989
(Show Context)
Citation Context ...d models. These models support features such as object identity, modelling of behaviour, encapsulation, and isa relationships. (An extension of our model with object-oriented features can be found in =-=[7]-=-.) A variety of languages were proposed for these models, encompassing all known paradigms of query languages: algebraic, calculus-based, logic-programming oriented, and SQLextensions. The variety of ... |

2 | Structural recursion as a query language primitive - Breazu-Tannen, Buneman, et al. - 1991 |

2 |
Extension of datalog with aggregation functions. IV journees bases de Donnees Avancees
- Chen
- 1988
(Show Context)
Citation Context ...e simulated in the algebra or the calculus. To conclude this section, we consider interpreted functions and predicates into the rulebased language. A similar problem has been independently studied in =-=[18]-=-, where aggregate functions are introduced in a language resembling that of [4]. The use of interpreted functions leads to the following two problems: ffl Interpreted functions may introduce new value... |

2 |
Computable directory queries. manuscript, the Technion
- Dalhaus, Makowski
- 1985
(Show Context)
Citation Context ...on to recursive languages are new. The equivalence results obtained in the presence of interpreted functions and predicates are also new. A model slightly less general than ours has been presented in =-=[23]-=-. They allow nested structures in which internal nodes are sets, and the leaves are relations. They extend the results of [20] concerning completeness of query languages to this model. Their technique... |

2 |
clauses and database dependencies. jp JACM
- Fagin
- 1982
(Show Context)
Citation Context ...or any database structure, changing the domains (but keeping them large enough to contain all atomic entries appearing in the database relations, or the query) does not change the result of the query =-=[24]-=-. It is well known that the expressions of relational algebra (assuming complement is not used) define domain independent queries. The same holds for our algebra. Calculus formulas do not necessarily ... |

2 |
Logic Algebra and Databases Ellis Norwood Series on Computers and their applications
- Grey
- 1984
(Show Context)
Citation Context ...algebra, this would be written as aeh [A; B] i (R) (see below). Thus, the replace is a generalization of the classical project. Another example of a restructuring operation is the extend operation of =-=[26]-=-: Given a relation, it allows the addition of a component to each tuple. The name of the new component, and the expression defining the function used to compute it are specified in the operation. This... |

2 |
Equivalence of relational algebra and calculus query languages having aggregate functions
- Klug
- 1982
(Show Context)
Citation Context ... used. Thus, the second direction is also taken care of. The main results of the paper apply in this general setting (with some restrictions, see Section 8). This generalizes, for example, results of =-=[33, 41]-=-. The approach above works smoothly for the calculus-based and logic-programming paradigms. For the algebra more effort is needed. It has to include operations to allow one to describe explicitly quit... |

2 |
Extended algebra and calculus for notNF relational databases. TODS
- Korth, Roth, et al.
- 1997
(Show Context)
Citation Context ...en introduced and studied. In the mid 80's a variety of models generalized the relational model by allowing hierarchically structured data; these are the nested relations and complex objects models 1 =-=[2, 25, 35, 44]-=-. Towards the end of the decade the emphasis shifted to semantic and particularly to object-oriented models. These models support features such as object identity, modelling of behaviour, encapsulatio... |

1 |
S.Tsur, Set constructors in a logic data language
- Beeri, Naqvi, et al.
- 1991
(Show Context)
Citation Context |

1 |
Naturally embedded query languages. ICDT
- Breazu-Tannen, Buneman, et al.
- 1992
(Show Context)
Citation Context ...d to recent research on query languages for bulk types that uses a categorytheoretic framework, and in particular to the notions of monads and comprehensions, see [45, 50], and the monadic algebra of =-=[17]-=-. Comprehensions can be viewed as a pure form of generalized SQL (a paradigm not considered here). See the last section for further discussion. 1.2 Comparison with Previous Work Our model generalizes ... |