Pages that link to "Item:Q1176290"
From MaRDI portal
The following pages link to On the expressive power of database queries with intermediate types (Q1176290):
Displaying 25 items.
- A sound and complete model-generation procedure for consistent and confidentiality-preserving databases (Q549726) (← links)
- The most nonelementary theory (Q598194) (← links)
- The expressive power of cardinality-bounded set values in object-based data models (Q672334) (← links)
- Comparison of functional and predicative query paradigms (Q676417) (← links)
- Algebraic and calculus query languages for recursively typed complex objects (Q686644) (← links)
- The powerset algebra as a natural tool to handle nested database relations (Q1198662) (← links)
- On the complexity of database queries (Q1307689) (← links)
- Irreversibility problem in NL-class relations (Q1310941) (← links)
- Domain independence and the relational calculus (Q1338897) (← links)
- Finitely representable databases (Q1376408) (← links)
- The complexity of the evaluation of complex algebra expressions (Q1376410) (← links)
- Bounded fixpoints for complex objects (Q1392283) (← links)
- Well-defined NRC queries can be typed (extended abstract) (Q1799317) (← links)
- The dichotomous intensional expressive power of the nested relational calculus with powerset (Q1799321) (← links)
- Tractable query languages for complex object databases (Q1900921) (← links)
- Database query languages embedded in the typed lambda calculus (Q1923099) (← links)
- Computing queries with higher-order logics (Q2369013) (← links)
- (Q4473152) (← links)
- (Q4473258) (← links)
- An analysis of the Core-ML language: Expressive power and type reconstruction (Q4632418) (← links)
- Computable Queries for Object Oriented Databases (Q4916216) (← links)
- Expressibility of Higher Order Logics (Q4924534) (← links)
- The Descriptive Complexity of the Deterministic Exponential Time Hierarchy (Q5179012) (← links)
- Polymorphic type inference for the named nested relational calculus (Q5277792) (← 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)
