The following pages link to (Q4864249):
Displayed 50 items.
- Regular path queries with constraints (Q1307690) (← links)
- Finitely representable databases (Q1376408) (← links)
- A query language for NC (Q1376409) (← links)
- A first step towards implementing dynamic algebraic dependences (Q1389443) (← links)
- Models of approximation in databases (Q1389445) (← links)
- A probabilistic view of Datalog parallelization (Q1389447) (← links)
- The Kolmogorov expressive power of Boolean query languages (Q1389450) (← links)
- A corrected 5NF definition for relational database design (Q1390959) (← links)
- Queries with arithmetical constraints (Q1391932) (← links)
- Bounded fixpoints for complex objects (Q1392283) (← links)
- Query containment for data integration systems (Q1394795) (← links)
- Verification of relational transducers for electronic commerce (Q1394796) (← links)
- On the content of materialized aggregate views (Q1394799) (← links)
- Reachability and connectivity queries in constraint databases (Q1394800) (← links)
- Integrity constraints for XML (Q1394804) (← links)
- Expressive power of SQL. (Q1401278) (← links)
- Scalar aggregation in inconsistent databases. (Q1401279) (← links)
- Algebraic rewritings for optimizing regular path queries. (Q1401283) (← links)
- On temporal logic versus Datalog (Q1401358) (← links)
- Incremental recomputation in local languages. (Q1401928) (← links)
- On the complexity of single-rule datalog queries. (Q1401945) (← links)
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. (Q1401972) (← links)
- On the complexity of equational problems in CNF (Q1404988) (← links)
- On the impact of regular functional dependencies when moving to a possibilistic database framework. (Q1414788) (← links)
- Chance discovery in medicine -- detection of rare risky events in chronic diseases (Q1432007) (← links)
- Games and total Datalog\(^{\lnot}\) queries (Q1575136) (← links)
- Local properties of query languages (Q1575140) (← links)
- Path constraints in semistructured databases (Q1591150) (← links)
- Relational transducers for electronic commerce (Q1591155) (← links)
- Querying spatial databases via topological invariants (Q1591156) (← links)
- Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
- Rewriting queries using views over monadic database schemas (Q1603453) (← links)
- Correspondence and translation for heterogeneous data (Q1606125) (← links)
- Expressiveness of concept expressions in first-order description logics (Q1606296) (← links)
- Query automata over finite trees (Q1607226) (← links)
- The expressiveness of DAC (Q1608890) (← links)
- Magic sets for disjunctive Datalog programs (Q1761296) (← links)
- Matching dependencies: semantics and query answering (Q1762196) (← links)
- A complete axiomatization of fuzzy functional dependencies using fuzzy function (Q1770793) (← links)
- Minimal-change integrity maintenance using tuple deletions (Q1776402) (← links)
- On the complexity of deciding typability in the relational algebra (Q1777227) (← links)
- A technique for proving decidability of containment and equivalence of linear constraint queries (Q1807671) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
- Adding for-loops to first-order logic (Q1854443) (← links)
- Abstract state machines and computationally complete query languages (Q1854519) (← links)
- Functional queries in datalog (Q1862647) (← links)
- On the decidability of the termination problem of active database systems (Q1884939) (← links)
- Ontology-based semantic search on the web and its combination with the power of inductive reasoning (Q1928818) (← links)
- From orthogonal projections to a generalized quantum search (Q1937233) (← links)
- Heterogeneous active agents. III: Polynomially implementable agents (Q1978315) (← links)