Database

Ch8.relational design

8.1 features of good design

8.1.1 larger alternatives

why design is good ?

Otherwise ,a larger alternative(schema) may cause:

1)redundancy

2)update may cause inconsistency

3)update may bring nulls

8.1.2 smaller alternatives

Functional dependency : A-->B,   i.e.A determines uniquely B (a kind of function relation , injection) ,lead to repetition in schema.

//An e.g. of bad deposition.

So,how do we make a smaller alternative(schema)?

It is impossible to divide a larger schema into a smaller one by means of finding repetition caused by join(why impossible? large amount of data and unknown of relations int the real world).

What matters is the the functional dependency(the rules in the real world).

On the other hand,a smaller alternative(schema) may cause:

1) lossy decomposition.which means when you decompose relation X,getting Y&Z.You will find  Y join Z !=X.

8.2 atomic domains &1st normal form

atomic if elements of the domain are considered to be indivisible units.

a relation schema R is in first normal form (1NF) if the domains of all attributes of R are atomic.

Discuss in whether cs0114 is an atomic domain.

8.3 Decomposition Using Functional Dependencies

Recall notation

1)Roman letter stands for a relation set while Greek letter for other attribute set(always one attribute).

2)K is a super-key of r (R).(candidate key is a minimal super-key )

3)we use single lowercase letter in our definitions and algorithms,not for eg. Instructor.

4)instance of r means a particular value at some given time.

8.3.1 Keys and Functional Dependencies

Define :relations have feature of functions .

α → β holds on R if and only if for any legal relations r(R), whenever any

two tuples t1 and t2 of r agree on the attributes α, they also agree

on the attributes β. That is,

t1[α] = t2 [α] ⇒ t1[β ] = t2 [β ]

We say that the instance satisfies the functional Dependency

We say that the functional dependency   α → β  holds on schema r (R)

A functional dependency is trivial if it is satisfied by all instances of a relation

Example:

4 ID, name → ID

4 name → name

l In general, α → β is trivial if β ⊆ α Some times  α !→ β  but alpha,gamma->beta.

(i.e.. In some special instance of instructor,name may ->ID,but it is not true for all instances)

notation F+ to denote the closure(satisfy transitive) of the set F,

8.3.2 BoyceCodd Normal Form

Boyce–Codd normal form (BCNF) eliminates all redundancy that can be discovered based on functional dependencies.

Formal definition

A relation schema R is in BCNF with respect to a set F of

functional dependencies if for all functional dependencies in F+ of

the form

α → β

where α ⊆ R and β ⊆ R, at least one of the following holds:

1)α → β is trivial (i.e., β ⊆ α)

2)nα is a superkey for R

In other words,BCNF requires that all nontrivial dependencies be of the form α → β  , where  α is a superkey.

In other words,BCNF requires that all α → β ,where α is not super key , to be trivial.

Suppose we have a schema R and a non-trivial dependency α →β

causes a violation of BCNF.

We decompose R into:

• (α U β )

• ( R - ( β - α ) )

It’s quite reasonable.

8.3.3 BCNF and Dependency Preservation

About testing constrains.

Constraints, including functional dependencies, are costly to check in practice unless they pertain to only one relation

A decomposition is dependency preserving.If it is sufficient to test only those dependencies on each individual relation of a decomposition in order to ensure that all functional dependencies hold

It is not always possible to achieve both BCNF and dependency preservation(in some cases, decomposition into BCNF can prevent efficient testing of certain functional dependencies.)

, we consider a weaker normal form, known as third normal form.

When a dependency whose attributes do not all appear in any one schema we call it is not dependency preserving.

BCNF is not dependency preserving but  3rdNF is.

second normal(满足第一范式且不存在partial dependency(部分依赖)the 3rd rule of 3rd NF) form is of historical significance only and is not used in practice.

8.3.4 Third Normal Form

A relation schema R is in third normal form (3NF) if for all:

α → β in F+

at least one of the following holds:

l α → β is trivial (i.e., β ∈ α)

l α is a superkey for R

l Each attribute A in β – α is contained in a candidate key for R.

(NOTE: each attribute may be in a different candidate key)

BCNF requires that all nontrivial dependencies be of the form α→β , where  α is a superkey.

Third normal form (3NF) relaxes this constraint slightly by allowing certain nontrivial functional dependencies whose left side is not a superkey.

Third condition is a minimal relaxation of BCNF to ensure dependency preservation (will see why later).

Normalization:

In the case that a relation scheme R is not in “good” form,

decompose it into a set of relation scheme {R1, R2, ..., Rn} such that

l each relation scheme is in good form

l the decomposition is a lossless-join decomposition

l Preferably, the decomposition should be dependency preserving

8.4 8.5 8.6:theorem &&algorithm for decomposition using NF

[Database.System.Concepts(6th.Edition.2010)].Abraham.Silberschatz. Ch8学习笔记的更多相关文章

  1. #翻译#原文来自Database.System.Concepts(6th.Edition.2010)2.6Relational Operations,原文作者Abraham Silberschaz , Henry F. Korth , S. Sudarshan

    2.6关系操作 所有的过程关系查询语言都提供一组操作,这些操作可以应用于单个关系或一对关系.这些操作具有良好的和期望的属性,它们的结果总是一个单一的关系.这个属性允许一个以模块化的方式组合其中的几个操 ...

  2. [转载]ECMA-262 6th Edition / Draft August 24, 2014 Draft ECMAScript Language Specification

    http://people.mozilla.org/~jorendorff/es6-draft.html#sec-23.4 Draft Report Errors and Issues at: htt ...

  3. 配置recovery_min_apply_delay后重启standby节点报错:psql: FATAL: the database system is starting up

    环境: pg版本:PostgreSQL 9.4.4 on x86_64 系统版本:CentOS release 6.6 linux内核版本:2.6.32-504.8.1.el6.x86_64 今天测试 ...

  4. Principle and Application of Database System

    <数据库系统原理与应用>课程教学大纲 英文名称:Principle and Application of Database System 课程类型:专业必修课 学时/学分:48+16/3. ...

  5. 备库搭建后,进入备库报错psql: FATAL: the database system is starting up

        备库搭建后,进入备库报错psql: FATAL:  the database system is starting up  原因:备库配置文件没有hot_standby = on   mast ...

  6. Anatomy of a Database System学习笔记 - 概论、并发控制

    <Anatomy of a Database System>这篇发表于87年.一共48页的论文据说是DBA入门必看,但是找了全网没有找到中文翻译.这篇文章对关系型数据库确实有提纲挈领的作用 ...

  7. VSTO 学习笔记(十)Office 2010 Ribbon开发

    原文:VSTO 学习笔记(十)Office 2010 Ribbon开发 微软的Office系列办公套件从Office 2007开始首次引入了Ribbon导航菜单模式,其将一系列相关的功能集成在一个个R ...

  8. VSTO学习笔记(八)向 Word 2010 中写入表结构

    原文:VSTO学习笔记(八)向 Word 2010 中写入表结构 前几天公司在做CMMI 3级认证,需要提交一系列的Word文档,其中有一种文档要求添加公司几个系统的数据库中的表结构.我临时接到了这项 ...

  9. 【VS开发】VSTO 学习笔记(十)Office 2010 Ribbon开发

    微软的Office系列办公套件从Office 2007开始首次引入了Ribbon导航菜单模式,其将一系列相关的功能集成在一个个Ribbon中,便于集中管理.操作.这种Ribbon是高度可定制的,用户可 ...

随机推荐

  1. Sandcastle Help File Builder(.NET帮助文档工具)的版本选择心得——支持VS2010至VS2015,高版本项目文件问题

    作者: zyl910 一.缘由 "Sandcastle Help File Builder"(简称SHFB)是一个很好用.NET 帮助文档生成工具. 但它的每个版本支持的VS版本范 ...

  2. [转] 阿里研究员谷朴:API 设计最佳实践的思考

    API是软件系统的核心,而软件系统的复杂度Complexity是大规模软件系统能否成功最重要的因素.但复杂度Complexity并非某一个单独的问题能完全败坏的,而是在系统设计尤其是API设计层面很多 ...

  3. 30天自制操作系统 - 来一个hello world

    helloos.nas 源码: ; hello-os ; TAB= ; 以下这段是标准的FAT12格式软盘专用代码 DB 0xeb, 0x4e, 0x90 DB "HELLOIPL" ...

  4. Atitit 分布式管理 vs 集中式管理

    Atitit 分布式管理 vs 集中式管理 1. 集中式管理缺点 1 1.1. 单点故障 1 1.2. 没有灵活性 1 1.3. 打败vs 征服 参考 尼可罗·马基雅弗利编著的<君主论> ...

  5. electron-vue开发爬坑指南

    electron-vue开发遇到的爬坑过程,遇到了以下几种坑: 1:静态资源目录访问不了,想访问放在static目录下的静态资源,使用express指定静态目录访问不到,解决办法:使用electron ...

  6. 查看哪个用户登录过服务器 记录 时间 和 ip

    who /var/log/wtmp 1>wtmp 一个用户每次登录进入和退出时间的永久纪录

  7. (转)java术语(PO/POJO/VO/BO/DAO/DTO)

    转自:http://blog.csdn.net/gaoyunpeng/article/details/2093211 PO(persistant object) 持久对象在o/r 映射的时候出现的概念 ...

  8. WebRTC的视频解码原理简析

    WebRTC的视频部分,包含采集.编解码(I420/VP8).加密.媒体文件.图像处理.显示.网络传输与流控(RTP/RTCP)等功能. 视频采集---video_capture:       源代码 ...

  9. QT工程文件的条件编译选择与额外的编译参数配置

    QTCreator打开.pro工程文件后,依据不同的构建套件创建项目组.在项目组中,点开构建步骤的“详情”,增加一个自己的宏定义,比如: DEFINES+=IMX_287 然后,我们在.pro文件中添 ...

  10. Unable to install SQL Server (setup.exe), VS Shell installation has failed with exit code 1638.

    The problem is likely that there's a newer version of the Visual C++ Redistributable than SQL Server ...