X. Zhang and Z. M. Ozsoyoglu. On e#cient reasoning with implication constraints. In DOOD, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Computing Complete Answers to Queries in the Presence of Limited.. - Li (1999) (4 citations) (Correct)
....then variable X in Q a still needs to satisfy the constraint X 5. We might want to generalize the algorithm CQstable as follows. Given a CQAC Q, we compute its answerable subquery Q a . We test the stability of Q by testing whether Q a Q, which can be tested using the algorithms in [GSUW94, ZO93] the GZO algorithm for short) However, the following example shows that this algorithm does not always work. EXAMPLE 5.2 Consider query where relation p has a binding pattern f, and relation r has a binding pattern bf. In the first step, we find all the answerable subgoals p(X) and ....
Xubo Zhang and Meral Ozsoyoglu. On e#cient reasoning with implication constraints. In DOOD, pages 236--252, 1993. 33
Answering Queries Using Views: A Survey - Levy (23 citations) (Correct)
....been studied extensively in the literature and should be a topic of a specialized survey. Some of the cases which are most relevant to our discussion include: containment of conjunctive queries and unions thereof [CM77, SY81] conjunctive queries with built in comparison predicates [Klu88, LS93, ZO93, KMT98] and datalog queries [Shm93, Sag88, LS93, CV93, CV94] 3.3 Rewriting of a Query Using Views Given a query Q and a set of view definitions V 1 , Vm , a rewriting of the query using the views is a query expression Q # that refers only to the views V 1 , Vm . In SQL, a ....
X. Zhang and M. Z. Ozsoyoglu. On e#cient reasoning with implication constraints. In Proc. of the Int. Conf. on Deductive and Object-Oriented Databases (DOOD), pages 236--252, 1993. 42
Computing Complete Answers to Queries with Binding Restrictions - Li (1999) (Correct)
....Y 5, then variable X in Q a still needs to satisfy the constraint X 5. We might want to generalize the algorithm CQstable as follows. Given a CQAC Q, we compute its answerable subquery Q a . We test the stability of Q by testing whether Q a # Q, which can be tested using the algorithm in [7, 26] ( the GZO algorithm for short) However, the following example shows that this algorithm does not always work. EXAMPLE 5.1 Consider query P : ans(Y) p(X) r(X,Y) r(A,B) A B X # A A # Y where relation p has a binding pattern f , and relation r has a binding pattern bf . Its ....
X. Zhang and M. Ozsoyoglu. On e#cient reasoning with implication constraints. In Proc. of 3rd International Conference on Deductive and Object-Oriented Databases (DOOD), pages 236--252, 1993. 11
Efficient XML-to-SQL Query Translation: Where to Add .. - Krishnamurthy.. (2004) (2 citations) (Correct)
No context found.
X. Zhang and Z. M. Ozsoyoglu. On e#cient reasoning with implication constraints. In DOOD, 1993.
Containment of Nested XML Queries - Dong, Halevy, Tatarinov (2004) (Correct)
No context found.
X. Zhang and M. Z. Ozsoyoglu. On e#cient reasoning with implication constraints. In Proc. of DOOD, 1993. 143
Containment of Nested XML Queries - Dong, Halevy, Tatarinov (2003) (Correct)
No context found.
X. Zhang and M. Z. Ozsoyoglu. On e#cient reasoning with implication constraints. In Proc. of DOOD, 1993.
Containment of Nested XML Queries - Xin Dong Alon (2003) (Correct)
No context found.
X. Zhang and M. Z. Ozsoyoglu. On e#cient reasoning with implication constraints. In Proc. of DOOD, pages 236--252, 1993. 23
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