Pages that link to "Item:Q3906490"

The following pages link to Equivalences Among Relational Expressions with the Union and Difference Operators (Q3906490):

Displayed 44 items.

• Certain answers over incomplete XML documents: extending tractability boundary (Q269320) ‎ (← links)
• Relational lattices: from databases to universal algebra (Q299191) ‎ (← links)
• Knowledge compilation meets database theory: compiling queries to decision diagrams (Q359877) ‎ (← links)
• On simplification of schema mappings (Q389226) ‎ (← links)
• A theoretical framework for knowledge-based entity resolution (Q402127) ‎ (← links)
• The complexity of equivalence, entailment, and minimization in existential positive logic (Q473196) ‎ (← links)
• The complexity of higher-order queries (Q498405) ‎ (← links)
• Decidable containment of recursive queries (Q555766) ‎ (← links)
• XML queries and constraints, containment and reformulation (Q555769) ‎ (← links)
• A time bound on the materialization of some recursively defined views (Q578941) ‎ (← links)
• Reconcilable differences (Q639856) ‎ (← links)
• Containment of conjunctive queries on annotated relations (Q639858) ‎ (← links)
• Query containment under bag and bag-set semantics (Q656574) ‎ (← links)
• Conjunctive query containment with respect to views and constraints (Q672739) ‎ (← links)
• On the equivalence of recursive and nonrecursive Datalog programs (Q676421) ‎ (← links)
• Three \(\sum^ P_ 2\)-complete problems in computational learning theory (Q685716) ‎ (← links)
• Towards an algebraic theory of information integration (Q703841) ‎ (← links)
• The relational model of data and cylindric algebras (Q761801) ‎ (← links)
• Rewriting queries using views with access patterns under integrity constraints (Q870269) ‎ (← links)
• Elimination of redundant operations in relational queries with general selection operators (Q1060024) ‎ (← links)
• Characterizations for functional dependency and Boyce-Codd normal form families (Q1069712) ‎ (← links)
• Data independent recursion in deductive databases (Q1123651) ‎ (← links)
• Speeding up inferences using relevance reasoning: a formalism and algorithms (Q1127352) ‎ (← links)
• On characterizing boundedness of database schemes with bounded dependencies (Q1199825) ‎ (← links)
• Minimizing restricted-fanout queries (Q1202893) ‎ (← links)
• Verification of knowledge bases based on containment checking (Q1274279) ‎ (← links)
• Some results on the containment and minimization of (in)equality queries (Q1329422) ‎ (← links)
• Optimization of a subclass of conjunctive queries (Q1346219) ‎ (← links)
• Can datalog be approximated? (Q1376415) ‎ (← links)
• Query containment for data integration systems (Q1394795) ‎ (← links)
• Open-world probabilistic databases: semantics, algorithms, complexity (Q2238646) ‎ (← links)
• Regular queries on graph databases (Q2402613) ‎ (← links)
• Automated reformulation of specifications by safe delay of constraints (Q2457622) ‎ (← links)
• One-sided recursions (Q2638765) ‎ (← links)
• Efficient and optimal query answering on independent schemes (Q2639633) ‎ (← links)
• Semantic Acyclicity on Graph Databases (Q3187172) ‎ (← links)
• Classifying the computational complexity of problems (Q3781088) ‎ (← links)
• (Q5091125) ‎ (← links)
• (Q5091133) ‎ (← links)
• About boundedness for some datalog and DATALOGneg programs (Q5096840) ‎ (← links)
• (Q5232911) ‎ (← links)
• A framework for comparing query languages in their ability to express Boolean queries (Q5919276) ‎ (← links)
• Graph Ramsey theory and the polynomial hierarchy (Q5943091) ‎ (← links)
• The notion of abstraction in ontology-based data management (Q6080649) ‎ (← links)