保留函数的分解

上传人:痛*** 文档编号:244220502 上传时间:2024-10-03 格式:PPT 页数:10 大小:787KB
返回 下载 相关 举报
保留函数的分解_第1页
第1页 / 共10页
保留函数的分解_第2页
第2页 / 共10页
保留函数的分解_第3页
第3页 / 共10页
点击查看更多>>
资源描述
Click to edit Master title style,Click to edit Master text styles,Second level,Third level,Fourth level,Fifth level,*,*,*,Enforcing Functional Dependencies,This presentation was prepared by Yufei Tao,http:/www.cse.cuhk.edu.hk/taoyf,Outline,Dependency preserving decomposition,保留函數的分解,Canonical functional dependencies,最簡約的函數依賴,2,FD as a constraint,We already know that a functional dependency may reflect a constraint in the underlying application.,函數依賴通常是實際應用中的一條要求。,If every customer can have a single account,如果每個客戶只能擁有一個賬戶:,cust,-id,acc-id,Assume that we want to check whether the FD holds in:,假設我們想檢查在下表中上面的函數依賴是否存在:,DEPOSIT(,transaction,-id,cust,-id,acc-id,amount,).,In other words, check if there are two,tuples,having the same,cust,-id,but different,acc-id,.,就是要查是否有兩個元組有相同的,cust,-id,但不同的,acc-id,。,3,FD as a constraint (cont.),DEPOSIT(,transaction,-id,cust,-id,acc-id,amount,),cust,-id,acc-id,SELECT,cust,-id,FROM DEPOSITGROUP BY,cust,-id,HAVING COUNT(DISTINCT,acc-id,) 1,The functional dependency holds if and only if the query result is empty.,如果此檢索返回空,則上面的函數依賴得以滿足。否則,則不滿足。,Corollary: you should be able to write a trigger to reject any update that violates the functional dependency.,對了,你應該可以寫一個,激發程式來拒絕所有違反此,函數依賴的更新吧。,4,Poor decomposition,A careless decomposition can make it very costly to check a functional dependency.,一個粗心的分解可能導致高昂的檢查函數依賴的代價,Say, we decompose,例如,考慮將,DEPOSIT(,transaction,-id,cust,-id,acc-id,amount,) into,分解為,:,T,1,(,transaction-id,cust,-id,) and,T,2,(,transaction-id,acc-id,amount,).,It is easy to see that verifying,cust,-id,acc-id,requires a join between,T,1,and,T,2,.,那么,檢查此函數依賴需要一個連接操作。,In this case, we say that this dependency is,not preserved,.,這樣的話,我們說此函數依賴,未被保留,。,5,Outline,Dependency preserving decomposition,保留函數的分解,Canonical functional dependencies,最簡約的函數依賴,6,Equivalence of FD sets,Two sets of functional dependencies are,equivalent,if either set can be derived from another.,兩組可互相導出的函數依賴是,等同,的。,A,BC, B,C,A,B, AB,C, =,A,B,B,C,.,Importance: instead of enforcing 4 dependencies, it suffices to enforce 2.,重要性:無需去驗證四個函數依賴,兩個即可。,7,Canonical set,Find the simplest equivalent of ,A,B, B,C, A,C,.,將這組函數依賴化至最簡。,Answer: ,A,B, B,C,.,If a set of,FDs,cannot be simplified further, we say it is,canonical,.,如果一組函數依賴不能再繼續化簡,我們說它是,規范的,。,A,B, B,C, is canonical.,A,B, B,C, is the,canonical form,of ,A,B, B,C, A,C,.,前者為后者的,規范形式,Also called,canonical cover,.,8,Example 1,Simplify ,A,B, B,C, A,CD, to its canonical form.,將這組函數依賴化為規范形式。,9,Example 2,Simplify ,A,BC, B,C,A,B, AB,C, to its canonical form.,10,
展开阅读全文
相关资源
正为您匹配相似的精品文档
相关搜索

最新文档


当前位置:首页 > 管理文书 > 施工组织


copyright@ 2023-2025  zhuangpeitu.com 装配图网版权所有   联系电话:18123376007

备案号:ICP2024067431-1 川公网安备51140202000466号


本站为文档C2C交易模式,即用户上传的文档直接被用户下载,本站只是中间服务平台,本站所有文档下载所得的收益归上传人(含作者)所有。装配图网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。若文档所含内容侵犯了您的版权或隐私,请立即通知装配图网,我们立即给予删除!