Pages that link to "Item:Q1177142"
From MaRDI portal
The following pages link to A comparison between algebraic query languages for flat and nested databases (Q1177142):
Displaying 8 items.
- Principles of programming with complex objects and collection types (Q672333) (← links)
- The powerset algebra as a natural tool to handle nested database relations (Q1198662) (← links)
- Domain-independent queries on databases with external functions (Q1389449) (← links)
- Bounded fixpoints for complex objects (Q1392283) (← links)
- Equivalence and normal forms for the restricted and bounded fixpoint in the nested algebra (Q1854400) (← links)
- Towards tractable algebras for bags (Q1924389) (← links)
- The comparative analysis of the expressive possibilities of the SQL-92 standard and the classical SQL(SEQUEL) (Q2737143) (← links)
- Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions (Q5940927) (← links)
