The following pages link to (Q4864249):
Displayed 50 items.
- Decidable containment of recursive queries (Q555766) (← links)
- XML queries and constraints, containment and reformulation (Q555769) (← links)
- On reasoning about structural equality in XML: a description logic approach (Q555777) (← links)
- Computing with infinitary logic (Q672337) (← links)
- Conjunctive query containment with respect to views and constraints (Q672739) (← links)
- Proving semantical equivalence of data specifications (Q678825) (← links)
- Inherent complexity of recursive queries (Q696953) (← links)
- Hypertree decompositions and tractable queries (Q696962) (← links)
- Aggregate operators in constraint query languages (Q696963) (← links)
- Towards an algebraic theory of information integration (Q703841) (← links)
- Order-sorted logic programming with predicate hierarchy (Q814621) (← links)
- An incremental algorithm for DLO quantifier elimination via constraint propagation (Q814643) (← links)
- A semantic approach to optimize linear datalog programs (Q854685) (← links)
- Deciding implication for functional dependencies in complex-value databases (Q860838) (← links)
- Database query languages and functional logic programming (Q867491) (← links)
- Well-definedness and semantic type-checking for the nested relational calculus (Q870267) (← links)
- Rewriting queries using views with access patterns under integrity constraints (Q870269) (← links)
- An Ehrenfeucht-Fraïssé game approach to collapse results in database theory (Q870360) (← links)
- Propagating XML constraints to relations (Q878752) (← links)
- Specification and verification of data-driven Web applications (Q878758) (← links)
- Weighted hypertree decompositions and optimal query plans (Q878759) (← links)
- An equational logic based approach to the security problem against inference attacks on object-oriented databases (Q881598) (← links)
- Question answering and database querying: bridging the gap with generalized quantification (Q881829) (← links)
- On the complexity of division and set joins in the relational algebra (Q882434) (← links)
- Magic Sets and their application to data integration (Q882436) (← links)
- Dependency-preserving normalization of relational and XML data (Q882439) (← links)
- Reasoning about XML update constraints (Q923878) (← links)
- World-set decompositions: Expressiveness and efficient algorithms (Q944380) (← links)
- Structure identification of Boolean relations and plain bases for co-clones (Q955340) (← links)
- Reactors: a data-oriented synchronous/asynchronous programming model for distributed applications (Q1004062) (← links)
- Axiomatizing functional dependencies in the higher-order entity-relationship model (Q1014410) (← links)
- Modeling virtual worlds in databases (Q1028981) (← links)
- Circumscribing DATALOG: expressive power and complexity (Q1127538) (← links)
- Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974) (← links)
- Reasoning about nondeterministic and concurrent actions: A process algebra approach (Q1277769) (← links)
- 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)
- 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)