Pages that link to "Item:Q1151060"
From MaRDI portal
The following pages link to Computable queries for relational data bases (Q1151060):
Displayed 50 items.
- On inflationary fix-point operators safety (Q266210) (← links)
- Model checking Petri nets with names using data-centric dynamic systems (Q315291) (← links)
- The consequences of eliminating NP solutions (Q458458) (← links)
- Relational completeness of query languages for annotated databases (Q532367) (← links)
- The expressiveness of a family of finite set languages (Q672126) (← links)
- Principles of programming with complex objects and collection types (Q672333) (← links)
- The expressive power of cardinality-bounded set values in object-based data models (Q672334) (← links)
- Computing with infinitary logic (Q672337) (← links)
- A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs (Q672662) (← links)
- A semideterministic approach to object creation and nondeterminism in database queries (Q676418) (← links)
- On the equivalence of recursive and nonrecursive Datalog programs (Q676421) (← links)
- Algebraic and calculus query languages for recursively typed complex objects (Q686644) (← links)
- A closed-form evaluation for Datalog queries with integer (gap)-order constraints (Q688670) (← links)
- The navigational power of web browsers (Q692917) (← links)
- Procedural languages for database queries and updates (Q751799) (← links)
- Negation in rule-based database languages: A survey (Q753476) (← links)
- Fundamental properties of deterministic and nondeterministic extensions of Datalog (Q756410) (← links)
- Structural characterizations of the navigational expressiveness of relation algebras on a tree (Q896017) (← links)
- Hypothetical datalog: Complexity and expressibility (Q915436) (← links)
- Descriptive characterizations of computational complexity (Q1123616) (← links)
- An alternative way to represent the cogroup of a relation in the context of nested databases (Q1124381) (← links)
- Circumscribing DATALOG: expressive power and complexity (Q1127538) (← links)
- Datalog extensions for database queries and updates (Q1176285) (← links)
- On the expressive power of database queries with intermediate types (Q1176290) (← links)
- A comparison between algebraic query languages for flat and nested databases (Q1177142) (← links)
- Equivalence of the relational algebra and calculus for nested relations (Q1192209) (← links)
- The powerset algebra as a natural tool to handle nested database relations (Q1198662) (← links)
- Query languages for hierarchic databases (Q1201723) (← links)
- An extension of fixpoint logic with a symmetry-based choice construct (Q1271477) (← links)
- Extended order-generic queries (Q1302301) (← links)
- Complete geometric query languages (Q1307692) (← links)
- Hereditarily-finite sets, data bases and polynomial-time computability (Q1311973) (← links)
- Domain independence and the relational calculus (Q1338897) (← links)
- An overview of transaction logic (Q1341707) (← links)
- First-order queries on databases embedded in an infinite structure (Q1350000) (← links)
- On rules of abduction. (Q1353881) (← links)
- Static and dynamic aspects of goal-oriented concurrency control (Q1353964) (← links)
- Non-determinism in logic-based languages (Q1360676) (← links)
- On the expressive power of F-logic language (Q1375331) (← links)
- Finitely representable databases (Q1376408) (← links)
- A query language for NC (Q1376409) (← links)
- The complexity of the evaluation of complex algebra expressions (Q1376410) (← links)
- Metafinite model theory (Q1383163) (← links)
- Domain-independent queries on databases with external functions (Q1389449) (← links)
- The Kolmogorov expressive power of Boolean query languages (Q1389450) (← links)
- Queries with arithmetical constraints (Q1391932) (← links)
- Scalar aggregation in inconsistent databases. (Q1401279) (← links)
- Queries and computation on the web (Q1575133) (← links)
- Minimal-change integrity maintenance using tuple deletions (Q1776402) (← links)
- A technique for proving decidability of containment and equivalence of linear constraint queries (Q1807671) (← links)