On conjunctive queries containing inequalities

@article{Klug1988OnCQ,
  title={On conjunctive queries containing inequalities},
  author={Anthony C. Klug},
  journal={J. ACM},
  year={1988},
  volume={35},
  pages={146-160}
}
Conjunctive queries are generalized so that inequality comparisons can be made between elements of the query. Algorithms for containment and equivalence of such “inequality queries” are given, under the assumption that the data domains are dense and totally ordered. In general, containment does not imply the existence of homomorphisms (containment mappings), but the homomorphism property does exist for subclasses of inequality queries. A minimization algorithm is defined using the equivalence… CONTINUE READING
Highly Influential
This paper has highly influenced 23 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 294 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

294 Citations

01020'90'96'03'10'17
Citations per Year
Semantic Scholar estimates that this publication has 294 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…