推 断题 CreateTime93.pptVIP

Chapter 7 The Query Compiler;The Stages of Query Compilation;Parsing;A Grammar of a Simple Subset of SQL ;;An Example;;SELECT title FROM StarsIn, MovieStar WHERE starName =name AND birthdate LIKE ‘%1960’; 　Preprocessor;Algebraic Laws for Improving Query Plans;Commutative and Associative Laws; Theta Join：R∞ S = S∞ R c c Suppose R(a,b), S(b,c) and T(c,d). (R ∞ S) ∞ T R ∞ ( S ∞ T ) R.aS.b ad R.aS.b ad ;Laws Involving Selection;Transformation Examples;σLaw for Binary Operators;σC(R∪S) = σC(R)∪σC(S) σC(R―S) = σC(R)―S = σC(R)―σC(S) σC(R×S) = σC(R)×S σC(R∞S) = σC(R)∞S σC(R ∞ S) =σC(R)∞ S D D σC(R∩S) = σC(R)∩S For example, R(a,b) and S(b,c) σa=1 OR a=3(σbc(R∞S) →σa=1 OR a=3(R∞σbc(S));Pushing Selections;ПstarName, studioName;Laws Involving Projection; Basic Laws： ? ПL(R∞S)=ПL(ПM(R)∞ПN(S)) ? ПL(R∞S)=ПL(ПM(R)∞ПN(S)) C C ? ПL(R×S)=ПL(ПM(R) ×ПN(S)) where M,N are attributes of R and S respectively or input attributes in L ;Suppose there are relations R(a,b,c), S(c,d,e) Пa+e→x,b→y(R∞S) Пa+e→x,b→y(Пa,b,c(R)∞Пc,e(S)) Пa+e→x,b→y( R∞Пc,e(S)) ? ПL(R∪B S)=ПL(R)∪B ПL(S) ? Projections cannot be pushed below ∪S,―,∩. For example, R(a,b):{(1,2)}; S(a,b): {(1,0)} Пa(R∩S)=Φ， Пa(R)∩Пa(S)={(1)};Projection Involving Some Computation;Pushing a projection below a selection;Laws About Joins and Products;Laws Involving Duplicate Elimination;Several laws that push δ ;For example, R has two copies of t tuple，S has one copy of t;Laws Involving Grouping and Aggregation;An Example; Combine the selection and product into an equijoin Generate a δ belowγ Generate a П between the γ and the introduced δ to project onto year and birthdate; From Parse Trees to Logical Query Plans;Translation of A Parse Tree to an Al