Course: Theory of Relational Databases

« Back
Course title Theory of Relational Databases
Course code KMI/PGSRD
Organizational form of instruction Lecture
Level of course Doctoral
Year of study not specified
Semester Winter and summer
Number of ECTS credits 12
Language of instruction Czech, English
Status of course unspecified
Form of instruction Face-to-face
Work placements This is not an internship
Recommended optional programme components None
Lecturer(s)
  • Vychodil Vilém, doc. RNDr. Ph.D.
Course content
Relational database model: Relational database. Relational schema, attributes and domains. Relations over relational schema. The relationship of relations and data tables. Operations with relations: boolean operations; selection, projection, join (natural join, equijoin, outer join). Properties of relational operations. Relational algebra. Relational calculus and its completeness. Functional dependencies and normalization: Functional dependencies and their validity. Keys. Semantic entailment of functional dependencies. Semantic equivalence of sets of functional dependencies. Syntactic entailment from functional dependencies. Armstrong rules, provability. Completeness of the logic of functional dependencies. Second and third normal form of relational schemes. Decomposition of relations. Determination of minimal bases of functional dependencies. Reduction of left-hand and right-hand sides of functional dependencies. Algorithms for determining the semantic entailment. RAP-sequences and DAGs. Structures of non-redundant and minimal covers. Boyce-Codd normal form. Multi-functional dependencies. Lossless decomposition of data tables. Query languages: Structures query language SQL: tables, sequences, indices, types of indices, integrity constraints, operations with tuples, querying, views and snapshots, cursors. Logical query language DATALOG: predicates, atoms, rules and queries; relationship between relational algebra and DATALOG; recursive rules and their semantics, fixed points, problems with negations.

Learning activities and teaching methods
Lecture
  • Preparation for the Exam - 120 hours per semester
Learning outcomes
The students become familiar with basic concepts of theory of relational databases.
1. Knowledge Describe and understand comprehensively principles and methods of relational databases.
Prerequisites
unspecified

Assessment methods and criteria
Oral exam, Written exam

Active participation in class. Completion of assigned homeworks. Passing the oral (or written) exam.
Recommended literature
  • Codd E. F. (1990). The Relational Model For Database Management: Vesion 2. Addison-Wesley, Reading, Mass.
  • Date C. J. (2000). An Introduction to Database Systems. Addison-Wesley, Reading, Mass. (sedmé vydání).
  • Date C. J. (2001). The Database Relational Model, A Retrospective Review and Analysis. Addison-Wesley Longman, Inc.
  • Galindo J., Urrutia A., Piattini M. (2006). Fuzzy Databases: Modeling, Design and Implementation. Idea Group Publ., Hershey, PA.
  • Gallaire H., Minker J. (1978). Logic and Databases. Plenum Press, NY.
  • Garcia-Molina H., Ullman J. D., Widom J. (2002). Database Systems, The Complete Book. Prentice Hall, Inc., Upper Saddle River, NJ.
  • Johnson James L. (1997). Database Models, Languages, Design. Oxford University Press.
  • Maier D. (1983). Theory of Relational Databases. Computer Science Press, Rockville.
  • Simovici D. A., Tenney R. L. (1995). Relational Database Systems. Academic Press.
  • Zaniolo Carlo a kol. (1997). Advanced Database Systems. Morgan Kaufmann, San Francisco.


Study plans that include the course
Faculty Study plan (Version) Branch of study Category Recommended year of study Recommended semester