On conjunctive queries containing inequalities
From MaRDI portal
Recommendations
- Some results on the containment and minimization of (in)equality queries
- The complexity of querying indefinite data about linearly ordered domains
- scientific article; zbMATH DE number 1951561
- Answering conjunctive queries with inequalities
- On the containment problem for queries in conjunctive form with negation
Cited in
(34)- Speeding up inferences using relevance reasoning: a formalism and algorithms
- Minimizing restricted-fanout queries
- Verification of knowledge bases based on containment checking
- Answering queries using limited external query processors
- On the complexity of database queries
- Some results on the containment and minimization of (in)equality queries
- Optimization of a subclass of conjunctive queries
- Query containment for data integration systems
- A general procedure to check conjunctive query containment
- Information integration using logical views
- A technique for proving decidability of containment and equivalence of linear constraint queries
- A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
- On the complexity of tree pattern containment with arithmetic comparisons
- Answering conjunctive queries with inequalities
- Automated reformulation of specifications by safe delay of constraints
- Data sufficiency for queries on cache
- Classification of annotation semirings over containment of conjunctive queries
- Deciding equivalences among conjunctive aggregate queries
- scientific article; zbMATH DE number 3913734 (Why is no real title available?)
- A theoretical framework for knowledge-based entity resolution
- Contractibility for open global constraints
- Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons
- Counting Answers to Existential Questions
- On the finite controllability of conjunctive query answering in databases under open-world assumption
- A Top-Down Approach to Rewriting Conjunctive Queries Using Views
- Decidable containment of recursive queries
- scientific article; zbMATH DE number 6729737 (Why is no real title available?)
- On Horn Conjunctive Queries
- Containment of conjunctive queries on annotated relations
- Query containment under bag and bag-set semantics
- Conjunctive query containment with respect to views and constraints
- The complexity of querying indefinite data about linearly ordered domains
- Rewriting union queries using views
- Rewriting queries using views in the presence of arithmetic comparisons
This page was built for publication: On conjunctive queries containing inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777501)