BOTTCIER, S., JARKE, M., AND SCHMIDT, J. W. Adaptive predicate managers in database systems. In Proceedings of the 11th International Conference on Very Large Duta Bases (Aug. 1986), 21 29.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... (similar static analysis is required by most other semantics based protocols [17, 36, 37] If the commutativity test between two guarded actions cannot be done within a reasonable amount of time, we can conservatively assume that they do not left commute, and therefore we can delay one of them [5]. Also, a table can be constructed either a priori or on line to maintain left commutativity relations between frequently occurring guarded actions. In that sense, this approach would be similar to the right backward commutativity table used by Weihl [37] 7. COMPARISON OF PROPOSED AND EXISTING ....

BOTTCIER, S., JARKE, M., AND SCHMIDT, J. W. Adaptive predicate managers in database systems. In Proceedings of the 11th International Conference on Very Large Duta Bases (Aug. 1986), 21 29.

.... is invalidated with database updates in the form of tuple insertions deletions modifications.The second problem, which we also discuss here, is concerned with the consistency and redundancy in a constraint set when constraints are inserted or deleted (Bry et al. 1988, Manthey and Bry 1988, Bottcher et al. 1986, Bry and Manthey 1986, Kung 1984, Illarramendi et al. 1994, Zhang and Ozsoyoglu 1997) Another related problem is the containment and the disjointness of two conjunctive queries (Ullman 1989, Klug 1988, Elkan 1989) A theorem prover built on top of Prolog is given in (Manthey and Bry 1988, Bry et ....

....and Ozsoyoglu 1992, Stickel 1985) Since the deduction system for clauses of inequalities described in this paper is decidable, in our case, satisfiability refers to finite satisfiability. An algorithm that checks the satisfiability of a set of constraints involving 9 and 8 quantifiers is given by Bottcher et al. 1986). This algorithm checks the unsatisfiability of a formula with 9 and 8 quantifiers, by instantiating universal variables with existential variables or constants. If the instantiated formula is unsatisfiable then the original formula is unsatisfiable as well. Since there are exponentially many ....

[Article contains additional citation context not shown here]

Bottcher, S., Jarke, M., Schmidt, J. W., Adaptive Predicate Managers in Database Systems, 12th Int. VLDB Conf., Kyoto, 1986, pp. 21-29.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC