dbTalk Databases Forums  

how to prove

comp.databases.theory comp.databases.theory


Discuss how to prove in the comp.databases.theory forum.



Reply
 
Thread Tools Display Modes
  #1  
Old   
Helen2007
 
Posts: n/a

Default how to prove - 02-10-2012 , 07:18 PM






dear all

How can I prove Qa: p(X,Y) is not contained in Qb: p(A,'a')? I have
proved the containment in the other direction using mapping, but not
sure how to proceed with this case.


Thanks in advance
Helen

Reply With Quote
  #2  
Old   
compdb@hotmail.com
 
Posts: n/a

Default Re: how to prove - 02-14-2012 , 12:08 AM






On Feb 10, 5:18*pm, Helen2007 <helen.ack... (AT) googlemail (DOT) com> wrote:
Quote:
How can I prove Qa: p(X,Y) is not contained in Qb: p(A,'a')? I have
proved the containment in the other direction using mapping, but not
sure how to proceed with this case.
I don't know this notation or terms. One can guess that you want to
prove
~(forall a [p(a, 'a')] -> forall x, y [p(x, y)])
Suggest you try a counterexample.

Googling +"Qa: p(X,Y)" +"contained in" gives a single hit 'Logical
query optimization by proof-tree transformation' (Ramakrishnan/Sagiv/
Ullman/Vardi 1993) "... have frontiers that are related to the p(X, Y)
nodes by Qa: p(X, Y) : a(X, Z) p(Z, ... A set of proof trees S is said
to be contained in another, say, T, if every fact ...", consistent
with my guess. Context is helpful for any question, like the topic or
paper or textbook you're reading & it's polite when it's homework to
say so.

philip

Reply With Quote
Reply




Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

vB code is On
Smilies are On
[IMG] code is On
HTML code is Off



Powered by vBulletin Version 3.5.3
Copyright ©2000 - 2013, Jelsoft Enterprises Ltd.