Description
The undergraduate-level course explores the file structures, that is, indexing techniques of filesystems or relational databases which use secondary devices as main storages of records. The course starts with understanding basic file operations, file structures and secondary devices. Then, the course explores the techniques of organizing and managing files of records in terms of performance. Also the course includes the variety of indexing techniques such as a simple list, binary tree, B-Tree, B+-Tree and Hashing. During the course, C++ is used to implement a test programs to understand the concept of file structures including the organization of files and indexes.
Instructor
Kyungbaek Kim
Office : Engineering Building #6, 715
Tel : +82-62-530-3438
Email : kyungbaekkim@chonnam.ac.kr
Office Hours : Tue 3pm ~ 4pm
Time and Location
Mon 1pm-2pm, Wed 1pm-2pm, Fri 1pm-2pm, Engineering Building #6, 102
Main text
- File Structures: An Object-Oriented Approach with C++, Michael J. Folk, Bill Zoellick, Greg Riccardi
Reference Text
- Data Structures and Algorithms in JAVA, Michael T. Goodrich, Roberto Tamassia
Grading Policy
- Attendance : 10%
- Homework and Quiz : 30%
- Around four to five times of homeworks and programming projects.
- Around two to three times of pop-up quiz.
- Midterm Exam : 25%
- Final Exam : 35%
Lecture Notes
- 1.Introduction
- 2.Fundamental File Processing Operations
- 3.Secondary Storage and System Software
- 4.Fundamental File Structure Concepts
- 5.Managing Files of Records
- 6.Organizing Files for Performance
- 7.Indexing
- 8.Cosequential Processing and the Sorting of Large Files
- 9.Multilevel Indexing and B-Trees
- 10.Indexed Sequential File Access and Prefix B+Trees
- 11.Hashing
Lecture notes are accessible through the eClass of JNU portal.
Homeworks, Quiz, Midterm/Final Exam
All of the materials related to homeworks, quiz, midterm exam and final exam, including solutions, are accessible through the eClass of JNU portal.