The following pages link to Database Theory - ICDT 2005 (Q5316619):
Displaying 4 items.
- The complexity of higher-order queries (Q498405) (← links)
- Well-definedness and semantic type-checking for the nested relational calculus (Q870267) (← links)
- Well-defined NRC queries can be typed (extended abstract) (Q1799317) (← links)
- On deciding well-definedness for query languages on trees (Q3546341) (← links)