P062 File Structures

Faculty of Informatics
Spring 2000
Extent and Intensity
2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
doc. Ing. Jan Staudek, CSc. (lecturer)
Guaranteed by
doc. Ing. Jan Staudek, CSc.
Department of Computer Systems and Communications – Faculty of Informatics
Contact Person: doc. Ing. Jan Staudek, CSc.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
Syllabus
  • File organizations - basic notions. Query types. Parameters for evaluation of a file organization on a magnetic disc. Model of the logical memory for file organization.
  • Basic file organization schemes: sequential, index-sequential, indexed, direct. Implementation of basic organizations.
  • Partial and interval queries, their possibilities in basic organizations. Query cost and its optimization. Hashing. Perfect hashing. Signatures, descriptors, Gray coding.
  • Dynamic hashing schemes - extendible hashing, linear hashing
  • Index structures, trees - B-trees and its variants
  • Grid file
  • Physical file organization and implementation scheme. Management of external storage.
  • Introduction to information theory, coding, data reduction, data compression algorithms.
Literature
  • FOLK, Michael J., Bill ZOELLICK and Greg RICCARDI. File structures :an object-oriented approach with C++. Reading, Mass.: Addison-Wesley, 1998, xxiv, 724. ISBN 0-201-87401-6. info
Assessment methods (in Czech)
písemná zkouška
Language of instruction
Czech
Further Comments
The course is taught annually.
The course is taught: every week.
The course is also listed under the following terms Spring 1997, Spring 1998, Spring 1999, Spring 2001, Spring 2002.
  • Enrolment Statistics (Spring 2000, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2000/P062