scientific article; zbMATH DE number 176244
From MaRDI portal
Publication:4035348
Recommendations
Cited in
(21)- Role of determinism in query languages for data bases
- Circumscribing DATALOG: expressive power and complexity
- The expressive power of the bounded-iteration construct
- Querying disjunctive databases through nonmonotonic logics
- Bounded arity Datalog () queries on graphs
- Polynomial-time computable stable models
- The Kolmogorov expressive power of Boolean query languages
- Bounded fixpoints for complex objects
- Expressive power of SQL.
- The dichotomous intensional expressive power of the nested relational calculus with powerset
- Comparison of expressive power of some query languages for databases
- The expressive power of the temporal query language \(L_{\mathcal H}\)
- Expressiveness of structured document query languages based on attribute grammars
- scientific article; zbMATH DE number 2080398 (Why is no real title available?)
- scientific article; zbMATH DE number 2080461 (Why is no real title available?)
- scientific article; zbMATH DE number 1515857 (Why is no real title available?)
- Abstract interpretation of database query languages
- Expressiveness of efficient semi-deterministic choice constructs
- A framework for comparing query languages in their ability to express Boolean queries
- The expressiveness of a family of finite set languages
- Queries=examples+counterexamples
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035348)