The powerset algebra as a natural tool to handle nested database relations

DOI10.1016/0022-0000(92)90041-GzbMath0752.68024OpenAlexW2069597938MaRDI QIDQ1198662

Marc Gyssens, Dirk Van Gucht

Publication date: 16 January 1993

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(92)90041-g

zbMATH Keywords

query languagesnested relations

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (4)

Query languages for bags and aggregate functions ⋮ Bounded fixpoints for complex objects ⋮ Principles of programming with complex objects and collection types ⋮ Equivalence and normal forms for the restricted and bounded fixpoint in the nested algebra

Cites Work

• Unnamed Item
• Unnamed Item
• Database relations with null values
• Computable queries for relational data bases
• On the expressive power of database queries with intermediate types
• A comparison between algebraic query languages for flat and nested databases
• On the expressive power of the relational algebra
• Structure and complexity of relational queries
• A lattice-theoretical fixpoint theorem and its applications
• A uniform approach toward handling atomic and structured information in the nested relational database model
• Horn clause queries and generalizations
• A relational model of data for large shared data banks

This page was built for publication: The powerset algebra as a natural tool to handle nested database relations