FI:PA152 Efficient Use of DB Systems - Course Information
PA152 Efficient Use of Database SystemsFaculty of Informatics
- Extent and Intensity
- 2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).
- doc. RNDr. Vlastislav Dohnal, Ph.D. (lecturer)
RNDr. Matej Antol (assistant)
RNDr. Petra Budíková, Ph.D. (assistant)
- Guaranteed by
- doc. RNDr. Eva Hladká, Ph.D.
Department of Computer Systems and Communications - Faculty of Informatics
Supplier department: Department of Computer Systems and Communications - Faculty of Informatics
- Thu 21. 2. to Thu 9. 5. Thu 8:00–9:50 D3
- Knowledge of problems in the extent of PB154 Database Systems (or PB168) and PV062 File Organization courses.
- 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
- Applied Informatics (programme FI, N-AP)
- Information Technology Security (eng.) (programme FI, N-IN)
- Information Technology Security (programme FI, N-IN)
- Bioinformatics (programme FI, N-AP)
- Information Systems (programme FI, N-IN)
- Mathematics with Informatics (programme PřF, N-MA)
- Parallel and Distributed Systems (programme FI, N-IN)
- Computer Graphics (programme FI, N-IN)
- Computer Networks and Communication (programme FI, N-IN)
- Computer Systems (programme FI, N-IN)
- Embedded Systems (eng.) (programme FI, N-IN)
- Embedded Systems (programme FI, N-IN)
- Service Science, Management and Engineering (eng.) (programme FI, N-AP)
- Service Science, Management and Engineering (programme FI, N-AP)
- Social Informatics (programme FI, B-AP)
- Theoretical Informatics (programme FI, N-IN)
- Upper Secondary School Teacher Training in Informatics (programme FI, N-SS) (2)
- Artificial Intelligence and Natural Language Processing (programme FI, N-IN)
- Image Processing (programme FI, N-AP)
- Course objectives
- The aim of the course is to become familiar with the capabilities of database systems and their efficient use.
- Learning outcomes
- Student will be able to:
- understand the principles of relational database systems;
- analyze performance of query processing;
- optimize processed queries both by rewriting them and by creating indexes and applying other techniques;
- Explain principles of logging and recovery from failure;
- Design basic replication strategies to achieve high availability;
- Design a disk storage for the database system.
- Data storage: efficient use of secondary storage, records, blocks. Searching: index structures, sequential files, trees, hashing, multidimensional indexes.
- Query execution: evaluation plan, algebraic laws, cost estimation, algorithms for operators, sorting and joining relations, query execution and pipelining.
- Query optimization: contribution of indexes, referential integrity, materialized views, table partitioning, disk storage.
- Database optimization: relational schema tuning, index optimization, database monitoring tools.
- Transaction management: properties and their implementation, concurrency control, scheduling, data and index locking, logging and recovery from failures.
- Database security: access rights, data security.
- Spatial databases: indexes, operators.
- Analytical tools.
- recommended literature
- SILBERSCHATZ, Abraham, Henry F. KORTH and S. SUDARSHAN. Database system concepts. 5th ed. Boston: McGraw-Hill, 2006. xxvi, 1142. ISBN 0072958863. info
- GARCIA-MOLINA, Hector, Jeffrey D. ULLMAN and Jennifer WIDOM. Database system implementation. Upper Saddle River: Prentice Hall, 2000. xv, 653 s. ISBN 0-13-040264-8. info
- Teaching methods
- Lectures and three home assignments.
- Assessment methods
- Completing home assignments, written exam. The evaluation includes both the score obtained from homeworks and the written exam. Written exam includes both test questions (choice of options) and free-hand answers.
- Language of instruction
- Follow-Up Courses
- Further Comments
- Study Materials
The course is taught annually.