Data Fragmentation. Data Replication and Allocation. Example

advertisement

Applied Science University

Faculty:

Information Technology

Department :

Computer Information Systems

( Course Syllabus )

Credit Hours Course No. Prerequisite Year (semester) Lec./Lab. Credit CourseTitle

Advanced Database

3 1303448 1303345

2011-2012 Lecture: 3

Systems 2nd Semester Lab : 0

Coordinator Name Lecturer Room No. E-mail Office Hours

Dr. Nedhal Al Saiyd Dr. Nedhal Al Saiyd 1310 Nedhal_alsaiyd@asu.edu.jo

As it is shown in the time schedule

Course Objectives:

To teach students advanced database topics that go beyond what is covered in the prerequisite

Database Management course.

Course Description:

The course covers subjects such as transaction management, concurrency control, two-phase locking, serializability, distributed databases, introduction to data mining, indexing, and data storage.

Intended Learning Outcomes :

Successful completion of this course should lead to the following learning outcomes :

A- Knowledge and Understanding :

1.

Understand transaction properties and how a DBMS manages transactions internally.

2.

Understand the different locking techniques and algorithms.

3.

Learn how the DBMS performs transaction recovery.

4.

Gain knowledge of the internals of a DBMS and how it works.

5.

Understand the different database distribution strategies including partitioning and replication.

6.

Gain familiarity with data mining techniques and concepts.

7.

Understand the physical storage techniques that can be applied.

B- Intellectual Skills:

1.

Develop ability to determine whether two transaction schedules are equivalent or not.

2.

Compare different data mining algorithms and analyze specific areas of usage of these algorithms.

3.

Analyze a system to determine best partitioning strategy to use for distribution of data.

4.

Distinguish between manual database recovery and automatic database recovery and in which cases each one of them is used.

C) Subject Specific Skills:

1.

Analyze complex algorithms.

2.

Know how the system detects deadlocks and what strategies it uses to resolve them.

3.

Gain background theory that will be practiced in the parallel lab course.

D) Transferable Skills:

1.

Gain experience to perform well in both individual and teamwork assignments.

2.

Demonstrate responsibility and professionalism by delivering on-time to meet agreed-upon deadlines. t 1

t

3.

Use of creativity and innovation in problem solving.

4.

Develop communication skills and logical thinking abilities.

Course Contents :

Week

Topics

1+2 RELATIONAL ALGEBRA

Topic Details

Basic operations (selection, Projection, Cross-product, Set-difference,

Union, Rename), Derived operations, Composition and equivalence rules.

3+4

DISK STORAGE, BASIC

FILE STRUCTURE AND

HASHING

5 INDEXING

Memory Hierarchies and Storage Devices

Storage of Databases. Hardware description of Disk

Devices. Magnetic Tape. Buffering of Blocks.

Files, Fixed-length Records, and variable-length records, Record

Blocking and spanned vs. un-spanned records. Allocating File blocks on disk. File Headers. Ops on Files. Ordered and unordered files.

Clustered & clustered indices, sparse versus dense,

Tree-based Indexes ( ISAM and B+trees (Insertion, deletion))

6

7+8

9

First Exam

QUERY PROCESSING and QUERY

OPTIMIZATION

TRANSACTION

PROCESSING CONCEPTS

Understanding of Role and Structure of Query Processing, External

Sorting, Read and Write ops and DBMS buffers

Why Concurrency Control is needed (the three problems).

Why Recovery is needed. Transaction States. System Log. Commit point. ACID. Schedules. Characterizing Schedules based on recoverability.

10

11

TRANSACTION

PROCESSING CONCEPTS

Serial, non-serial, and conflict serializable schedules. Testing for

Conflict Serializability (precedence graph).

CONCURRENCY

CONTROL TECHNIQUES

Types of locks and system lock tables.

Guaranteeing Serializability by 2PL.

Basic, Conservative, Strict, and Rigorous 2PL

12

13 DISTRIBUTED DBMSs

Second Exam

Distributed Database Concepts. Parallel vs. Distributed Technology.

Advantages of Distributed DBs.

14 DISTRIBUTED DBMSs

Data Fragmentation. Data Replication and Allocation. Example

Fragmentation and Allocation.

Chapter

6

16

17

18

20

20

21

26

26

15

Final Exam

2

Course quality improvement :

From the market and new subjects in the field.

 From students’ feedback (Evaluation sheet).

Grade Distribution :

Assessment

- First Exam

- Second Exam

Grade

20%

20%

Date

- Assignments ( Reports /Quizzes/ Seminar / Tutorials ….)

- Final Examination

20%

40%

Reading List:

Text Book

Elmasri/Navathe, ”

Programming “, 6 th

Database Systems: Models, Languages, Design, and Application

Ed. , Pearson 20 11 .

Other

References

[1] C.J. Date, “Introduction to Database Management Systems” 8 th Edition, Addison

Wesley 2004.

[2] Kroenke D.M , “Database Processing: fundamental design & implementation”, 7 th Ed.,

Prentice Hall 2000

[3] Blaha M. & Premerlani W. ,”Object-Oriented Modeling and Design for Database

Applications “, Prentice Hall 1998

[4] Larson ,” Database Directions: from relational to distributed, multimedia and object -oriented

database systems” Prentice Hall 1995

[5] Bertino E. & Zari G.P. ,” Intelligent Database Systems” , Addison Wesley 1999

[6] Garcia , “Database Systems: the complete book” Pearson 2002

Last updated on 14/2/2012 by : Dr. Nedhal Al Saiyd t 3

Download