Equivalences Among Relational Expressions with the Union and Difference Operators
From MaRDI portal
Cited in
(45)- Conjunctive query containment with respect to views and constraints
- A framework for comparing query languages in their ability to express Boolean queries
- A theoretical framework for knowledge-based entity resolution
- Three \(\sum^ P_ 2\)-complete problems in computational learning theory
- Rewriting queries using views with access patterns under integrity constraints
- Decidable containment of recursive queries
- Certain answers over incomplete XML documents: extending tractability boundary
- Towards an algebraic theory of information integration
- On the equivalence of recursive and nonrecursive Datalog programs
- On characterizing boundedness of database schemes with bounded dependencies
- scientific article; zbMATH DE number 7561479 (Why is no real title available?)
- Automated reformulation of specifications by safe delay of constraints
- Relational lattices: from databases to universal algebra
- A time bound on the materialization of some recursively defined views
- Data independent recursion in deductive databases
- Speeding up inferences using relevance reasoning: a formalism and algorithms
- Verification of knowledge bases based on containment checking
- Some results on the containment and minimization of (in)equality queries
- The relational model of data and cylindric algebras
- scientific article; zbMATH DE number 7104937 (Why is no real title available?)
- About boundedness for some DATALOG and DATALOG\textsuperscript{neg} programs
- Query containment for data integration systems
- Regular queries on graph databases
- scientific article; zbMATH DE number 7561474 (Why is no real title available?)
- The notion of abstraction in ontology-based data management
- The complexity of equivalence, entailment, and minimization in existential positive logic
- Semantic acyclicity on graph databases
- Minimizing restricted-fanout queries
- Graph Ramsey theory and the polynomial hierarchy
- Containment of conjunctive queries on annotated relations
- Knowledge compilation meets database theory: compiling queries to decision diagrams
- Elimination of redundant operations in relational queries with general selection operators
- Classifying the computational complexity of problems
- The complexity of higher-order queries
- How database theory helps teach relational queries in database education (invited talk)
- Query containment under bag and bag-set semantics
- XML queries and constraints, containment and reformulation
- Optimization of a subclass of conjunctive queries
- Characterizations for functional dependency and Boyce-Codd normal form families
- Open-world probabilistic databases: semantics, algorithms, complexity
- One-sided recursions
- Can datalog be approximated?
- Reconcilable differences
- On simplification of schema mappings
- Efficient and optimal query answering on independent schemes
This page was built for publication: Equivalences Among Relational Expressions with the Union and Difference Operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3906490)
