The following pages link to (Q3798297):
Displaying 11 items.
- Algebraic and calculus query languages for recursively typed complex objects (Q686644) (← links)
- On the complexity of queries in the logical data model (Q688665) (← links)
- An alternative way to represent the cogroup of a relation in the context of nested databases (Q1124381) (← links)
- On the expressive power of database queries with intermediate types (Q1176290) (← links)
- A comparison between algebraic query languages for flat and nested databases (Q1177142) (← links)
- The powerset algebra as a natural tool to handle nested database relations (Q1198662) (← links)
- Computing queries with higher-order logics (Q2369013) (← links)
- (Q3786039) (← links)
- An abstract machine for efficiently computing queries to well-founded models (Q4507851) (← links)
- Expressibility of Higher Order Logics (Q4924534) (← links)
- The Descriptive Complexity of the Deterministic Exponential Time Hierarchy (Q5179012) (← links)
