On the containment and equivalence of database queries with linear constraints (extended abstract)
- 1 May 1997
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 30 references indexed in Scilit:
- Queries with arithmetical constraintsTheoretical Computer Science, 1997
- A closed-form evaluation for Datalog queries with integer (gap)-order constraintsTheoretical Computer Science, 1993
- On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the realsJournal of Symbolic Computation, 1992
- On conjunctive queries containing inequalitiesJournal of the ACM, 1988
- Two-Way Counter Machines and Diophantine EquationsJournal of the ACM, 1982
- Efficient optimization of a class of relational expressionsACM Transactions on Database Systems, 1979
- Reversal-Bounded Multicounter Machines and Their Decision ProblemsJournal of the ACM, 1978
- The entity-relationship model—toward a unified view of dataACM Transactions on Database Systems, 1976
- Reversal-bounded multipushdown machinesJournal of Computer and System Sciences, 1974
- Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing MachinesAnnals of Mathematics, 1961