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

DOI10.1016/S0304-3975(99)00301-1zbMath0974.68047OpenAlexW1972514879WikidataQ127124586 ScholiaQ127124586MaRDI QIDQ5940927

No author found.

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00301-1

zbMATH Keywords

expressive powernested relational databasesquery languages

Mathematics Subject Classification ID

Database theory (68P15)

Related Items

Expressivity and Complexity of MongoDB Queries ⋮ Iterating on multiple collections in synchrony ⋮ Query lifting. Language-integrated query for heterogeneous nested collections

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non first normal form relations: An algebra allowing data restructuring
• Nested relations and complex objects in databases
• On the expressive power of database queries with intermediate types
• The complexity of the evaluation of complex algebra expressions
• Bounded fixpoints for complex objects
• Equivalence and normal forms for the restricted and bounded fixpoint in the nested algebra
• Normal forms and conservative extension properties for query languages over collection types
• A relational model of data for large shared data banks