The following pages link to A calculus for complex objects (Q1123010):
Displaying 16 items.
- Data cleaning and query answering with matching dependencies and matching functions (Q359881) (← links)
- Algebraic and calculus query languages for recursively typed complex objects (Q686644) (← links)
- Well-definedness and semantic type-checking for the nested relational calculus (Q870267) (← links)
- Querying independent databases (Q918672) (← links)
- A semantics for complex objects and approximate answers (Q1176289) (← links)
- On the expressive power of database queries with intermediate types (Q1176290) (← links)
- The data model of FAD, a database programming language (Q1186359) (← links)
- The nested universal relation data model (Q1342865) (← links)
- CGOOD, a categorical graph-oriented object data model (Q1350521) (← links)
- Complex object multi-level fixpoint queries. (Q1353951) (← links)
- On the monotonicity of (LDL) logic programs with set. (Q1353958) (← links)
- A deductive database approach for complex objects (Q2277840) (← links)
- Normalization of class hierarchy in databases (Q2365511) (← links)
- Modeling and manipulating the structure of hierarchical schemas for the web (Q2476750) (← links)
- (Q4431092) (← links)
- Theoretical Aspects of Computing - ICTAC 2004 (Q5709996) (← links)