Pages that link to "Item:Q1067795"
From MaRDI portal
The following pages link to Polynomial queries to relational data bases (Q1067795):
Displaying 11 items.
- Queries=examples+counterexamples (Q675974) (← links)
- Procedural languages for database queries and updates (Q751799) (← links)
- A query language allowing conditions of relational type in queries (Q1058871) (← links)
- Pragmatics and semantics of NQL, a descriptive query language for network databases (Q1825686) (← links)
- An algorithm for handling many relational calculus queries efficiently. (Q1872707) (← links)
- Relational queries computable in polynomial time (Q3753525) (← links)
- Primitive program algebras of computable functions (Q3802614) (← links)
- Declarative PTIME queries for relational databases using quantifier elimination (Q4934813) (← links)
- Query order in the polynomial hierarchy (Q5055937) (← links)
- Database Theory - ICDT 2005 (Q5316600) (← links)
- Verification, Model Checking, and Abstract Interpretation (Q5898613) (← links)