| Z. M. Ozsoyoglu, "Query Optimization in Distributed Databases", Ph.D. Thesis, Dept. of CS, Univ. of Alberta, Canada, 1980. |
....from f ; 6=g, and 2) for any pair of terms u 1 and u 2 in T erm(C) there is at most one (in)equality (of the forms u 1 op u 2 or u 2 op u 1 ) in C. The second assumption is based on the observation that more than one (in)equalities between two terms are either mergeable, or inconsistent ([29]) Next we define a binary relation on T erm(C) as follows. Definition 3.5 Let C be a set of (in)equalities. The binary relation on T erm(C) is defined as follows: 1) u 1 u 2 if u 1 u 2 , u 1 = u 2 , or u 2 = u 1 is in C; 2) u 1 u 2 if u 1 u and u u 2 . For C to be satisfiable, ....
Z. M. Ozsoyoglu, "Query Optimization in Distributed Databases", Ph.D. Thesis, Dept. of CS, Univ. of Alberta, Canada, 1980.
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