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

Theoretical Computer Science

Volumn 254, Issue 1-2, 2001, Pages 363-377

  Van den Bussche, Jan ^a  

^a HASSELT UNIVERSITY   (Belgium)

Author keywords

Expressive power; Nested relational databases; Query languages

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; QUERY LANGUAGES; RELATIONAL DATABASE SYSTEMS; SET THEORY; THEOREM PROVING;

NESTED RELATIONAL ALGEBRA;

LINEAR ALGEBRA;

EID: 0034920160     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00301-1     Document Type: Article

References (18)

1. Non first normal form relation: An algebra allowing data restructing
2. Nested relations and complex objects in databases
3. A relational model for large shared databanks
4. The restricted and the bounded fixpoint closures of the nested relational algebra are equivalent
5. On the expressive power of database queries with intermediate types
6. Remarks on the algebra of non-first normal form relations
7. A consideration of normal form of not-necessarily-normalized relations in the relation data model
8. The structure of the Relational Database Model
9. Converting nested algebra expressions into flat algebra expressions
10. Bounded fixpoints for complex objects
11. The complexity of the evaluation of complex algebra expressions
12. Nested relational structures
13. Normal forms and conservative extension properties for query languages over collection types