Data Base Systems
Data Base Systems EEL 4852C
Popular in Course
Popular in Electrical Engineering
This 2 page Class Notes was uploaded by Mr. Chelsie Bergstrom on Wednesday September 23, 2015. The Class Notes belongs to EEL 4852C at University of South Florida taught by Yicheng Tu in Fall. Since its upload, it has received 39 views. For similar materials see /class/212708/eel-4852c-university-of-south-florida in Electrical Engineering at University of South Florida.
Reviews for Data Base Systems
Report this Material
What is Karma?
Karma is the currency of StudySoup.
Date Created: 09/23/15
EEL4852 Final review Fall 2008 Dr Yicheng Tu Chapter 1 Introduction 1 Desirable characteristics of database systems advantages over file systems 2 Instances and schemas Chapter 5 Relational algebra focus on rulesassumptions 1 Select 2 Project 3 4 Set differenceintersection 5 Cartesian product 6 Rename 7 Natural join theta join 8 Division 9 Aggregate Chapter 8 SQL 1 Basic structure of SQL queries a 39seect 39from and 39where clauses b Their algebraic equivalence c Tuple variables in SQL d Maintaineliminate duplicates e Tuple ordering 2 SQL set operations a Union b Intersection c Except Minus 3 Aggregate functions a What are the different types of aggregates b 39group by and 39having clauses 4 Nested subqueries a Set membership and comparison b Testing for empty relations V Chapter 3 ER design 5 1 Model components a Entity sets Relationship sets 2 Constraints a Cardinalities onemanytoonemany b Participation total partial 3 ERdiagram Chapter 10 Relational DB design 1 Features of good relational DB design a Redundancy b Lossless decomposition Functional dependency Atomicity and 15 Normal Form 2quotd Normal Form 3rd Normal Form BoyceCodd Normal Form oweww VII Chapter 13 Storage and File Structure 1 Storage a The storage pyramid b Hard disk performance measurements access time seek time latency 2 Sequential file organization vs ordered files VIII Chapter 14 Indexing 1 Basics a Primarysecondary index b CIusteredunclustered index 2 BTree Index Files a What s in a leaf node nonleaf node How many ofthem Fanout b Insertion c Deletion d Search a Btree 3 BTree Index Files IX Chapter 15 Query Processing 1 Selection algorithms a File scan index scan b Their costs 2 Join algorithms and their costs a Nestedloop join b Pagebased nestedloop join c Indexed nestedloop join d SortMerge Join XI Chapter 17 Transactions ACID properties 2 Transaction states active commit abort failed partially committed 3 Serializability a Conflict serializability b Test for conflict In addition to the homework problems I strongly suggest you solve the similar problems from the book Final exam will be held at 530pm on December 11 2008 Thursday in room ENB108 same room for our regular class meeting It will be a 2hour closed booksnotesedevices exam Good luck