X hits on this document

Word document

For the exam you should be able to - page 2 / 11

37 views

0 shares

0 downloads

0 comments

2 / 11

give an example of a multivalued attribute

give an example of a multiway relationship

define functional dependency

define key of a relation

define superkey of a relation

describe the algorithm for computing a closure of a set of attributes, given a set of functional dependencies

describe the three kinds of anomalies that can occur when we try to cram too much into a single relation

define the condition called BCNF

define the condition called 3NF

state why someone might reasonable choose to keep a relational schema in 3NF rather than decompose further into BCNF

convert a domain description to an ER diagram

transform ODL to relation schemas according the rules presented in the class and in the book

transform an ER diagram to relation schemas according the rules presented in the class and in the book

extract functional dependencies from a textual description of a domain

take a set of FDs and find all keys

take a set of FDs and determine whether a set of attributes is a superkey

take a set of FDs and a relational schema and decompose the schema into BCNF

recognize the existence of multivalued dependencies from a textual description of a domain and a relational schema, and the decompose the schema into 4NF

take a set of relational schemas and combining relations based on same keys or candidate keys

Document info
Document views37
Page views37
Page last viewedTue Dec 06 21:59:52 UTC 2016
Pages11
Paragraphs265
Words2948

Comments