Download Syllabus - COW :: Ceng

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Entity–attribute–value model wikipedia , lookup

Relational algebra wikipedia , lookup

SQL wikipedia , lookup

Open Database Connectivity wikipedia , lookup

Microsoft Jet Database Engine wikipedia , lookup

Concurrency control wikipedia , lookup

Functional Database Model wikipedia , lookup

Database wikipedia , lookup

Clusterpoint wikipedia , lookup

Versant Object Database wikipedia , lookup

Relational model wikipedia , lookup

Database model wikipedia , lookup

Transcript
CENG 351 Data Management and File Structures
Fall 2009 - Syllabus
Section 2
Instructor:
Nihan Çiçekli
Tel.: 2105582, Office: A308, [email protected]
Lecture Hours:
Tuesday 9:40
BMB3
Thursday 13:40 - 15:30
BMB3
Course web page: http://cow.ceng.metu.edu.tr
Teaching Assistants:
Nilgün Dağ
[email protected]
Ömer Nebil Yaveroğlu
[email protected]
Catalog Description
This course will require the students to develop insight into the physical characteristics of mass storage
media used to store files, file processing and data management techniques. The student will be introduced
principles behind the database management systems-DBMS and DBMS applications. The students will be
required to practice the course material through non-programming and programming assignments
References
1. Betty Salzberg, File Structures: An Analytic Approach, Prentice Hall, 1988.
2. Raghu Ramakrishnan, Database Management Systems (3rd. ed.), McGraw Hill, 2003.
3. Michael J. Folk, Bill Zoellick and Greg Riccardi, File Structures, An object oriented approach
with C++, Addison-Wesley, 1998.
4. R. Elmasri, S.B. Navathe, Fundamentals of Database Systems, 4 th edition, Addison-Wesley, 2004.
Course Outline
1. Secondary storage media and their physical characteristics.
2. Fundamental File Structure Concepts
3. Sequential File Processing
4. External Sorting of Large Files
5. Midterm I
6. Indexing: Multilevel Indexing and B+trees
7. Hashing (static, linear, extendible hashing)
8. Introduction to relational database systems
9. Midterm II
10. Relational Model and E/R Modeling
11. Relational Algebra, Relational Calculus
12. SQL-Structural Query language
13. SQL Query Evaluation and optimization issues
Grading
3 Homework and 3 Programming Assignments
Midterm Exam 1
Midterm Exam 2
Final
30%
20%
20%
30%
Grading Policies
1. You may miss the midterm exams only if you inform me BEFORE the exam and you have a legal
excuse (e.g. medical report).
2. Late assignments are penalized up to 10 % per day. The last assignment may not be turned in late.
3. All written assignments, exams and programs are to be your own work. No grouping is allowed.