The following pages link to (Q4864249):
Displaying 50 items.
- Sequences, datalog, and transducers (Q1278034) (← links)
- Algebras for querying text regions: Expressive power and optimization (Q1278037) (← links)
- Arity bounds in first-order incremental evaluation and definition of polynomial time database queries (Q1278038) (← links)
- Semantics and expressiveness issues in active databases (Q1278040) (← links)
- The expressive power of stratified logic programs with value invention (Q1281496) (← links)
- Temporal connectives versus explicit timestamps to query temporal databases (Q1305921) (← links)
- On the complexity of database queries (Q1307689) (← links)
- Regular path queries with constraints (Q1307690) (← links)
- Mathematical fundamentals of database and knowledge base systems (Q1353969) (← 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)
- LARS: a logic-based framework for analytic reasoning over streams (Q1648076) (← links)
- Containment of queries for graphs with data (Q1678169) (← links)
- Logic-based argumentation with existential rules (Q1678415) (← links)
- Causes for query answers from databases: datalog abduction, view-updates, and integrity constraints (Q1678427) (← links)
- A progression semantics for first-order logic programs (Q1680677) (← links)
- Certifying standard and stratified Datalog inference engines in SSReflect (Q1687733) (← links)
