Equivalence and normal forms for the restricted and bounded fixpoint in the nested algebra

DOI10.1006/inco.2000.2882zbMath1003.68038OpenAlexW2091973410MaRDI QIDQ1854400

Dan Suciu, Marc Gyssens, Dirk Van Gucht

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3e9508548a9df574d2281fb511acebcafb6a9740

Mathematics Subject Classification ID

Database theory (68P15) Model theory of finite structures (03C13) Descriptive complexity and finite models (68Q19)

Related Items (1)

Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions

Cites Work

• Nested relations and complex objects in databases
• The relational model with relation-valued attributes
• Fixed-point extensions of first-order logic
• Datalog extensions for database queries and updates
• A comparison between algebraic query languages for flat and nested databases
• The powerset algebra as a natural tool to handle nested database relations
• Bounded fixpoints for complex objects
• A uniform approach toward handling atomic and structured information in the nested relational database model
• Relational queries computable in polynomial time
• A relational model of data for large shared data banks

This page was built for publication: Equivalence and normal forms for the restricted and bounded fixpoint in the nested algebra