A comparison between algebraic query languages for flat and nested databases
The authors present a deep comparision of the expressive power of query formalisms for flat and nested relational database models. Nested relation databases and their foundations have found much attention in the last years. The paper considers two query algebras for them, namely the nested algebra and the powerset algebra, and compare them mutually as well as to the flat relational algebra. After the introductional section, the second section introduces the nested relational database model and basic algebra operators for manipulating nested relations. The notions of schema and nested relation instances as well as the semantics of query algebra operators are defined in terms of set-theoretic concepts. The third section presents the comparison between the nested algebra and the powerset algebra. The authors show that either the nest or the difference operator can be removed as a primitive operator from the powerset algebra. The powerset algebra is shown to be equivalent to the nested algebra either extended by a least fixpoint operator or a while operator. The last section gives a brief comparison of several query languages both for the flat and the nested case. Similarities and differences between query languages for the flat and the nested case are discussed.
- Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions
- The powerset algebra as a natural tool to handle nested database relations
- Equivalence of the relational algebra and calculus for nested relations
- A uniform approach toward handling atomic and structured information in the nested relational database model
- A relational model of data for large shared data banks
- A uniform approach toward handling atomic and structured information in the nested relational database model
- Computable queries for relational data bases
- Extended algebra and calculus for nested relational databases
- Horn clause queries and generalizations
- scientific article; zbMATH DE number 4199654 (Why is no real title available?)
- scientific article; zbMATH DE number 4064541 (Why is no real title available?)
- scientific article; zbMATH DE number 4064542 (Why is no real title available?)
- scientific article; zbMATH DE number 3607517 (Why is no real title available?)
- On Database Logic
- On the expressive power of the relational algebra
- Relational queries computable in polynomial time
- Structure and complexity of relational queries
- The powerset algebra as a natural tool to handle nested database relations
- Domain-independent queries on databases with external functions
- Bounded fixpoints for complex objects
- Equivalence and normal forms for the restricted and bounded fixpoint in the nested algebra
- Towards tractable algebras for bags
- The comparative analysis of the expressive possibilities of the SQL-92 standard and the classical SQL(SEQUEL)
- A uniform approach toward handling atomic and structured information in the nested relational database model
- Solving Equations in the Relational Algebra
- Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions
- Principles of programming with complex objects and collection types
This page was built for publication: A comparison between algebraic query languages for flat and nested databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1177142)
