A decision procedure for conjunctive query disjointness
- 29 March 1989
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 134-139
- https://doi.org/10.1145/73721.73735
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Efficiently updating materialized viewsPublished by Association for Computing Machinery (ACM) ,1986
- Locking Expressions for Increased Database ConcurrencyJournal of the ACM, 1983
- Complexity, convexity and combinations of theoriesTheoretical Computer Science, 1980
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980
- Simplification by Cooperating Decision ProceduresACM Transactions on Programming Languages and Systems, 1979
- Equivalences among Relational ExpressionsSIAM Journal on Computing, 1979
- The complexity of testing predicate locksPublished by Association for Computing Machinery (ACM) ,1979
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975