B0B36DBS: Database Systems
Exams |
Lectures |
Practicals |
Timetable |
Deadlines |
Recordings |
Requirements |
Assignments |
Topics
Basic Information
- Annotation:
B0B36DBS (full-time study)
- Lecturer: Martin Svoboda
- Tutors: Jana Ahmad, Radomír Černoch, Bogdan Kostov, Zdeněk Kouba, Martin Řimnáč, Martin Svoboda, Gustav Šír
- Schedule:
B0B36DBS
- Lectures:
- Tuesday 12:45 - 14:15 (KN:E-107)
- Practical classes conducted in Czech:
- Group 101 - Zdeněk Kouba: Tuesday 14:30 - 16:00 (KN:E-307)
- Group 102 - Martin Svoboda: Tuesday 16:15 - 17:45 (KN:E-307)
- Group 103 - Martin Svoboda: Tuesday 18:00 - 19:30 (KN:E-307)
- Group 104 - Bogdan Kostov: Wednesday 9:15 - 10:45 (KN:E-328)
- Group 109 - Radomír Černoch, Gustav Šír: Wednesday 16:15 - 17:45 (KN:E-328)
- Group 110 - Radomír Černoch, Gustav Šír: Wednesday 18:00 - 19:30 (KN:E-328)
- Group 105 - Martin Řimnáč: Thursday 12:45 - 14:15 (KN:E-311)
- Online classes from 26. 3. 2020 via BigBlueButton platform
- Group 106 - Martin Řimnáč: Thursday 14:30 - 16:00 (KN:E-311)
- Online classes from 26. 3. 2020 via BigBlueButton platform
- Group 107 - Martin Řimnáč: Thursday 16:15 - 17:45 (KN:E-311)
- Online classes from 26. 3. 2020 via BigBlueButton platform
- Group 108 - Martin Řimnáč: Thursday 18:00 - 19:30 (KN:E-311)
- Online classes from 26. 3. 2020 via BigBlueButton platform
- Practical classes conducted in English:
- Group 111 - Jana Ahmad: Wednesday 11:00 - 12:30 (KN:E-328)
- Password for online lectures and practical classes was sent by e-mail
- Table with points from practical classes, homework assignments and exam tests
Exam Dates
On-Site Exams
- Thursday 28. 5. 2020: 14:45 - 16:15 (KN:E-107)
- Wednesday 3. 6. 2020: 12:30 - 14:00 (KN:E-107)
- Wednesday 10. 6. 2020: 12:30 - 14:00 (KN:E-107)
- Wednesday 17. 6. 2020: 10:15 - 11:45 (KN:E-107)
- Tuesday 23. 6. 2020: 10:15 - 11:45 (KN:E-107)
- Wednesday 1. 7. 2020: 10:15 - 11:45 (KN:E-107)
- Wednesday 15. 7. 2020: 10:15 - 11:45 (KN:E-107)
- Wednesday 9. 9. 2020: 14:45 - 16:15 (KN:E-107)
- There will be no additional exam dates
Zoom Exams
- Primarily intended for those who are outside of the Czech Republic
- Wednesday 3. 6. 2020: 12:00 - 15:00
- Wednesday 10. 6. 2020: 12:00 - 15:00
- Wednesday 17. 6. 2020: 9:00 - 12:00
- Tuesday 23. 6. 2020: 9:00 - 12:00
- Wednesday 1. 7. 2020: 9:00 - 12:00
- Wednesday 15. 7. 2020: 9:00 - 12:00
Lectures
Practical Classes
Timetable
|
Zdeněk Kouba
101 |
Martin Svoboda
102+103 |
Bogdan Kostov
104 |
Jana Ahmad
111 |
R. Černoch, G. Šír
109+110 |
Martin Řimnáč
105+106+107+108 |
| 01 - Conceptual Modeling |
Tuesday 18. 2. |
Tuesday 18. 2. |
Wednesday 19. 2. |
Wednesday 19. 2. |
Wednesday 19. 2. (GŠ) |
Thursday 20. 2. |
| 02 - Conceptual Modeling |
Tuesday 25. 2. |
Tuesday 25. 2. |
Wednesday 26. 2. |
Wednesday 26. 2. |
Wednesday 26. 2. (GŠ) |
Thursday 27. 2. |
| 03 - Conceptual Modeling |
Tuesday 3. 3. |
Tuesday 3. 3. |
Wednesday 4. 3. |
Wednesday 4. 3. |
Wednesday 4. 3. (GŠ) |
Thursday 5. 3. |
| 04 - Relational Model |
Self-study |
Self-study |
Self-study |
Self-study |
Self-study (GŠ) |
Self-study |
| 05 - SQL: Data Definition |
Tuesday 24. 3. |
Tuesday 24. 3. |
Wednesday 25. 3. |
Wednesday 25. 3. |
Wednesday 25. 3. (RČ) |
Thursday 26. 3. |
| 06 - SQL: Data Querying |
Tuesday 31. 3. |
Tuesday 31. 3. |
Wednesday 1. 4. |
Wednesday 1. 4. |
Wednesday 1. 4. (RČ) |
Thursday 2. 4. |
| 07 - SQL: Data Querying |
Tuesday 7. 4. |
Tuesday 7. 4. |
Wednesday 8. 4. |
Wednesday 8. 4. |
Wednesday 8. 4. (RČ) |
Thursday 16. 4. |
| 08 - SQL: Advanced Constructs |
Self-study |
Self-study |
Self-study |
Self-study |
Self-study (RČ) |
Self-study |
| 09 - Relational Algebra |
Tuesday 14. 4. |
Tuesday 14. 4. |
Wednesday 15. 4. |
Wednesday 15. 4. |
Wednesday 15. 4. (RČ) |
Thursday 23. 4. |
| 10 - JDBC, JPA |
Tuesday 21. 4. |
Tuesday 21. 4. |
Wednesday 22. 4. |
Wednesday 22. 4. |
Wednesday 22. 4. (RČ) |
Thursday 30. 4. |
| 11 - Functional Dependencies |
Tuesday 28. 4. |
Tuesday 28. 4. |
Wednesday 29. 4. |
Wednesday 29. 4. |
Wednesday 29. 4. (GŠ) |
Thursday 7. 5. |
| 12 - Functional Dependencies |
Tuesday 12. 5. |
Tuesday 12. 5. |
Wednesday 6. 5. |
Wednesday 6. 5. |
Wednesday 6. 5. (GŠ) |
Thursday 14. 5. |
| 13 - Presentations |
Tuesday 19. 5. |
Tuesday 19. 5. |
Wednesday 20. 5. |
Wednesday 20. 5. |
Wednesday 20. 5. (RČ) |
Thursday 21. 5. / 28. 5. |
Homework Deadlines
|
Zdeněk Kouba
101 |
Martin Svoboda
102+103 |
Bogdan Kostov
104 |
Jana Ahmad
111 |
R. Černoch, G. Šír
109+110 |
Martin Řimnáč
105+106+107+108 |
| 00 - Topic selection | Tuesday 3. 3. | Tuesday 3. 3. | Wednesday 4. 3. | Wednesday 4. 3. | Wednesday 4. 3. | Thursday 5. 3. |
| 01 - Conceptual Schema | Monday 9. 3. | Monday 9. 3. | Tuesday 10. 3. | Tuesday 10. 3. | Tuesday 10. 3. | Wednesday 11. 3. |
| 02 - Relational Schema | Monday 30. 3. | Monday 30. 3. | Tuesday 31. 3. | Tuesday 31. 3. | Tuesday 31. 3. | Wednesday 1. 4. |
| 03 - SQL Schema | Monday 6. 4. | Monday 6. 4. | Tuesday 7. 4. | Tuesday 7. 4. | Tuesday 7. 4. | Wednesday 8. 4. |
| 04 - SQL Queries | Monday 13. 4. | Monday 13. 4. | Tuesday 14. 4. | Tuesday 14. 4. | Tuesday 14. 4. | Wednesday 22. 4. |
| 05 - Relational Algebra | Monday 20. 4. | Monday 20. 4. | Tuesday 21. 4. | Tuesday 21. 4. | Tuesday 21. 4. | Wednesday 29. 4. |
| 06 - Database Application | Monday 18. 5. | Monday 18. 5. | Tuesday 19. 5. | Tuesday 19. 5. | Tuesday 19. 5. | Wednesday 20. 5. / 27. 5. |
Class Recordings
- Recordings of online classes are accessible via a user name student and the same password as for the online meetings
- Recordings can only be used for personal study purposes and may not be published or otherwise disseminated in any way
Lectures
Formal Requirements
- Attendance during practical classes is not compulsory, yet warmly recommended
- Altogether 6 individual homework assignments will take place during the semester
- Everyone must choose their distinct topic, not later than on the day of the third practical class
- This topic must be reported to and explicitly accepted by your tutor in advance
- Possible topics could be: library, cinema, cookbook, university, flights, etc.
- See the list below for additional suitable topics, feel free to choose your own topic
- Your homework solutions must be within the topic, original, realistic, and non-trivial
- Solutions can only be submitted via BRUTE system at https://cw.felk.cvut.cz/brute/
- At most 130 points in total can be gained for all the homework assignments
- Solutions are awarded by up to 20 or 30 points respectively, depending on the assignment
- In case of any shortcomings, fewer points will be awarded appropriately
- Solutions can be submitted even repeatedly, only the latest version is assessed
- Once a given assignment is assessed by the tutor, it cannot be resubmitted once again
- Delay of one whole day is penalized by 5 points, shorter delays are penalized proportionally
- Should the delay be even longer, the penalty stays the same and does not further increase
- All the homework assignments must be submitted before the intended exam date in order to be considered
- None of the homework assignments is compulsory, yet you are encouraged to submit all of them
- Notify your tutor in case you are waiting for the assessment of the homework submitted after the deadline
- During some of the practical classes, extra activity points can be acquired, too
- At least 100 points is required for the course credit to be granted
- Half of all the points above this boundary will be transferred as bonus points to the exam
- Course credits granted in previous years are not acknowledged
- Only students with a course credit already acquired can sign up for the final exam
- The final exam consists of a compulsory written test and an optional oral examination
- At most 100 points can be acquired from the actual final written test
- This test consists of a theoretical part (open and multiple choice questions) and a practical part (exercises)
- Having less than 30% points from any of the two parts prevents from passing the exam successfully
- The final score corresponds to the sum of the written test and bonus points, if any
- Based on the result, everyone can voluntarily choose to undergo an oral examination
- The only condition is to have at least 50 points from the test and bonus points
- In such a case, the final score is further adjusted by up to minus 10 to plus 5 points
- The oral examination can also be requested by the examiners in case of uncertainties in the test
- Final grade: 90 points and more for A, 80+ for B, 70+ for C, 60+ for D, and 50+ for E
Homework Assignments
- Preliminaries:
- Homework solutions can only be submitted via BRUTE system at https://cw.felk.cvut.cz/brute/
- Respect the prescribed names of individual files to be submitted (case sensitive, including extensions)
- Place all the files into the root directory of your submission (when submitting archives)
- Do not include shared libraries or any other files that are not explicitly requested
- Topic selection deadlines:
- Group 101 - Zdeněk Kouba - Tuesday 3. 3. 2020 until 23:59
- Groups 102 and 103 - Martin Svoboda - Tuesday 3. 3. 2020 until 23:59
- Group 104 - Bogdan Kostov - Wednesday 4. 3. 2020 until 23:59
- Group 111 - Jana Ahmad - Wednesday 4. 3. 2020 until 23:59
- Groups 109 and 110 - Radomír Černoch, Gustav Šír - Wednesday 4. 3. 2020 until 23:59
- Groups 105, 106, 107 and 108 - Martin Řimnáč - Thursday 5. 3. 2020 until 23:59
1: Conceptual Schema
- Points: 20
- Assignment:
- Create a diagram of an ER conceptual schema of your individual topic
- It must contain all the following constructs:
- Altogether at least (exactly) 5 and at most (about) 8 entity types
- Attributes of all kinds (ordinary, structured, multivalued)
- Identifiers (ordinary as well as composed)
- At least 1 entity type must have at least 2 identifiers
- Altogether at least 5 relationship types with cardinalities specified, each used at least once (1..1, 0..1, 0..N, 1..N)
- Recursive relationship type
- Ternary (or even more complicated) relationship type
- ISA hierarchy with constraints specified (complete/partial, exclusive/overlapping)
- Weak entity type
- Provide a textual description of your individual topic in a natural language
- Requirements:
- Each entity type must have at least one identifier
- You must not use artificial identifiers (e.g. automatically generated integer ids) unless absolutely necessary
- You must distinguish between multiple ordinary identifiers and one composed identifier
- Software:
- Conventions:
- Relationship type cardinalities 1..1 may be omitted
- Underline identifiers
- Submission:
- /er-diagram.pdf: PDF file (or PNG/JPEG image) with an exported diagram of your ER schema
- /er-description.pdf: text file with a description of your individual topic
- Deadlines:
- Group 101 - Zdeněk Kouba - Monday 9. 3. 2020 until 23:59
- Groups 102 and 103 - Martin Svoboda - Monday 9. 3. 2020 until 23:59
- Group 104 - Bogdan Kostov - Tuesday 10. 3. 2020 until 23:59
- Group 111 - Jana Ahmad - Tuesday 10. 3. 2020 until 23:59
- Groups 109 and 110 - Radomír Černoch, Gustav Šír - Tuesday 10. 3. 2020 until 23:59
- Groups 105, 106, 107 and 108 - Martin Řimnáč - Wednesday 11. 3. 2020 until 23:59
2: Relational Schema
- Points: 20
- Assignment:
- Transform your ER diagram into the relational model schema
- I.e. transform all the involved entity types, relationship types, attributes as well as identifiers
- Describe all foreign keys
- Requirements:
- Use a textual syntax described in the lecture (or see below)
- Your relational schema must correspond to the ER schema
- Respect original names of all types and attributes when forming names for relations
- Rename them or use new names only when it makes sense or it is necessary
- You must not introduce new artificial identifiers (e.g. automatically generated integer ids)
- You may modify your ER schema (from the previous assignment) if necessary
- You must extend and/or correct your ER schema in case it did not contain all the required constructs
- You must work with the traditional Relational model without NULL values
- Conventions:
- Table(Key1, Atribute1, Atribute2, ...)
- Underline keys (distinguish between multiple ordinary keys and one composed key)
- Describe foreign keys explicitly
- Submission:
- /er-diagram.pdf: PDF file (or PNG/JPEG image) with a diagram of the original ER schema (possibly altered, will not be assessed)
- /rm-schema.pdf: Relational schema described using the textual notation
- Deadlines:
- Group 101 - Zdeněk Kouba - Monday 30. 3. 2020 until 23:59
- Groups 102 and 103 - Martin Svoboda - Monday 30. 3. 2020 until 23:59
- Group 104 - Bogdan Kostov - Tuesday 31. 3. 2020 until 23:59
- Group 111 - Jana Ahmad - Tuesday 31. 3. 2020 until 23:59
- Groups 109 and 110 - Radomír Černoch, Gustav Šír - Tuesday 31. 3. 2020 until 23:59
- Groups 105, 106, 107 and 108 - Martin Řimnáč - Wednesday 1. 4. 2020 until 23:59
3: SQL Schema
- Points: 20
- Assignment:
- Transform your relational schema into the corresponding SQL schema
- I.e. use CREATE TABLE statements to create a schema of your relational database
- Satisfy all the following requirements:
- Use appropriate data types
- Ensure referential integrity including meaningful referential actions
- Use each of the following integrity constraints at least once: NOT NULL, PRIMARY KEY, UNIQUE, CHECK
- At least one constraint must be defined as a column-level constraint and one table-level constraint
- At least one constraint must be associated with an explicit name
- Requirements:
- Your SQL script must be syntactically correct and executable without errors, even repeatedly
- Use DROP TABLE IF EXISTS statements at the beginning of the script to drop all the tables first
- Do not use tools to generate your SQL statements automatically, write them on your own
- You are encouraged to introduce new artificial primary keys (e.g. integer ids) whenever appropriate
- You are encouraged to define columns allowing NULL values whenever appropriate
- In both the cases preserve the relational model schema (from the previous assignment) without any adjustments
- You may otherwise modify your relational schema if necessary
- You must extend and/or correct your relational schema in case it did not contain all the required constructs
- Only use the public schema in your database
- Do not use fully qualified names of your tables (i.e. only write their local names without schemas)
- Do not use spaces, accented or other unusual characters in names of your tables or columns
- You must not use PostgreSQL table inheritance mechanism
- Other database management systems such as MySQL or other are not permitted to be used
- Software:
- Server:
- Host: slon.felk.cvut.cz, port: 5432, initial password sent by e-mail
- Password modification: ALTER ROLE db18_login WITH PASSWORD 'password';
- Submission:
- /rm-schema.pdf: Relational schema described using the textual notation (possibly altered, will not be assessed)
- /sql-schema.sql: SQL script with a definition of your database schema
- Deadlines:
- Group 101 - Zdeněk Kouba - Monday 6. 4. 2020 until 23:59
- Groups 102 and 103 - Martin Svoboda - Monday 6. 4. 2020 until 23:59
- Group 104 - Bogdan Kostov - Tuesday 7. 4. 2020 until 23:59
- Group 111 - Jana Ahmad - Tuesday 7. 4. 2020 until 23:59
- Groups 109 and 110 - Radomír Černoch, Gustav Šír - Tuesday 7. 4. 2020 until 23:59
- Groups 105, 106, 107 and 108 - Martin Řimnáč - Wednesday 8. 4. 2020 until 23:59
4: SQL Queries
- Points: 20
- Assignment:
- Express at least 5 non-trivial queries in SQL within your database
- Use at least once each of the following constructs:
- Natural join, generic inner join, as well as outer join
- Grouping and aggregation (both GROUP BY and HAVING clauses)
- One set operation: UNION, INTERSECT or EXCEPT
- Sorting (ORDER BY clause)
- Sub-query expression
- Requirements:
- Add comments describing the intended meaning of your queries in a natural language
- For this purpose, use single-line comments -- text or multi-line comments /* text */
- All query expressions must yield different queries, i.e. they cannot be just different expressions for the same query
- Your SQL script must be syntactically correct and executable without errors, even repeatedly
- You may modify your database schema (from the previous assignment) if necessary
- You must extend and/or correct your database schema in case it did not contain all the required constructs
- Put individual clauses on separate lines and visually format your expressions so that they are easy to read
- Associate every query with a unique number so that we can easily address it in the assessment comments
- Your queries must be realistic and you must respect the natural meaning and intended usage of individual constructs
- Submission:
- /sql-schema.sql: SQL script with the definition of your database schema (possibly altered, will not be assessed)
- /sql-queries.sql: SQL script with your query expressions
- Deadlines:
- Group 101 - Zdeněk Kouba - Monday 13. 4. 2020 until 23:59
- Groups 102 and 103 - Martin Svoboda - Monday 13. 4. 2020 until 23:59
- Group 104 - Bogdan Kostov - Tuesday 14. 4. 2020 until 23:59
- Group 111 - Jana Ahmad - Tuesday 14. 4. 2020 until 23:59
- Groups 109 and 110 - Radomír Černoch, Gustav Šír - Tuesday 14. 4. 2020 until 23:59
- Groups 105, 106, 107 and 108 - Martin Řimnáč - Wednesday 22. 4. 2020 until 23:59
5: Relational Algebra
- Points: 20
- Assignment:
- Express at least 5 non-trivial queries in relational algebra within your database
- Use at least once each of the following constructs:
- Selection, projection as well as attribute renaming
- Natural join, theta join, Cartesian product, as well as outer join
- Set operation: union, intersection or minus
- Division (the second operand must be evaluated to a dynamic table with unknown number of rows in advance)
- Requirements:
- Add comments describing the intended meaning of your queries in a natural language
- All query expressions must yield different queries, i.e. they cannot be just different expressions for the same query
- You may modify your relational model schema (from the second assignment) if necessary
- You must extend and/or correct your relational schema in case it did not contain all the required constructs
- Associate every query with a unique number so that we can easily address it in the assessment comments
- Your queries must be realistic and you must respect the natural meaning and intended usage of individual constructs
- Submission:
- /rm-schema.pdf: Relational schema described using the textual notation (possibly altered, will not be assessed)
- /ra-queries.pdf: Expressions of your queries in relational algebra
- Deadlines:
- Group 101 - Zdeněk Kouba - Monday 20. 4. 2020 until 23:59
- Groups 102 and 103 - Martin Svoboda - Monday 20. 4. 2020 until 23:59
- Group 104 - Bogdan Kostov - Tuesday 21. 4. 2020 until 23:59
- Group 111 - Jana Ahmad - Tuesday 21. 4. 2020 until 23:59
- Groups 109 and 110 - Radomír Černoch, Gustav Šír - Tuesday 21. 4. 2020 until 23:59
- Groups 105, 106, 107 and 108 - Martin Řimnáč - Wednesday 29. 4. 2020 until 23:59
6: Database Application
- Points: 30
- Assignment:
- Implement a simple desktop application in Java with JPA access to the database
- Create and annotate at least 2 entities and 1 relationship in between them
- Cardinality of this relationship must be @ManyToMany
- Both the entities must have at least 5 attributes (including primary keys)
- Allow for a complex processing of 1 of the selected entities
- I.e. implement all the following CRUD use cases...
- CREATE: insertion of a new entity instance
- READ: browsing of a list of all entity instances
- UPDATE: modification of attributes of an existing entity instance
- DELETE: removal of an existing entity instance
- Allow for a complex processing of the selected relationship
- I.e. implement all the following CRUD use cases...
- CREATE: insertion of a new relationship instance by choosing both the involved entity instances
- READ: browsing of a list of all related entity instances for a given entity instance
- DELETE: removal of an existing relationship instance
- Requirements:
- Your application must have a graphical user interface (e.g. using Swing or JavaFX)
- Use must connect to our server at slon.felk.cvut.cz and only use your assigned database
- You must only use JPA (i.e. you must not directly use JDBC in any way)
- You may modify your database schema (from the third assignment) if necessary
- Fill all the involved tables with sample realistic data (not necessarily from your application)
- Comment your source files
- You must check the validity of input values provided by users
- Software:
- Files:
- Submission:
- Whole NetBeans / Idea project with all source files
- Executable application (*.jar file runnable without any additional arguments)
- Deadlines:
- Group 101 - Zdeněk Kouba - Monday 18. 5. 2020 until 23:59
- Groups 102 and 103 - Martin Svoboda - Monday 18. 5. 2020 until 23:59
- Group 104 - Bogdan Kostov - Tuesday 19. 5. 2020 until 23:59
- Group 111 - Jana Ahmad - Tuesday 19. 5. 2020 until 23:59
- Groups 109 and 110 - Radomír Černoch, Gustav Šír - Tuesday 19. 5. 2020 until 23:59
- Groups 105, 106, 107 and 108 - Martin Řimnáč - Wednesday 20. 5. / 27. 5. 2020 until 23:59
- Presentation:
- There will be compulsory presentations during the very last practical class
Individual Topics
- Try to propose your own original topic in the first place
- You can also get inspired by the following topics (in alphabetical order, in Czech only)
-
Adresní místa,
Aquapark,
Armáda,
Aukce,
Autobusové nádraží,
Autosalon,
Autoškola,
Banka,
Bankovní účet,
Bazar,
Bezpečnostní agentura,
Blog,
Botanická zahrada,
Burza,
Catering,
Cestovní kancelář,
Cukrárna,
Cvičiště pro psy,
Čajovna,
Čerpací stanice,
Dálniční poplatky,
Darování zážitků,
Deskové hry,
Detekce plagiátů,
Diskuzní fórum,
Divadelní hry,
Divadlo,
Dodávka vody,
Docházkový systém,
Dopravní dispečink,
Dopravní nehody,
Dopravní podnik,
Dopravní uzavírky,
Doručování zásilek,
Dotační programy,
Ekologické centrum,
Elektronická evidence tržeb,
Elektronické recepty,
Evidence smluv,
Evidence součástek,
Evidence zaměstnanců,
Exekuce,
Farmářské trhy,
Filmy,
Finanční poradenství,
Finanční trhy,
Finanční úřad,
Fitness centrum,
Fotbalová liga,
Fotbalový tým,
Fotoalbum,
Galerie,
Golfové kluby,
Grantová agentura,
Hardware,
Hobby market,
Hodinový manžel,
Hokejová liga,
Horská služba,
Hotel,
Hrady a zámky,
Hřbitov,
Hudební festival,
Hudební nástroje,
Hudební produkce,
Jaderná elektrárna,
Jazyková škola,
Jazykové pobyty,
Jednání zastupitelstva,
Jeskyně,
Jídelníček,
Jízdenky na autobus,
Jízdní řády,
Jurský park,
Kadeřnický salon,
Kamionová doprava,
Kasino,
Katastr nemovitostí,
Kavárna,
Kino,
Kniha jízd,
Knihkupectví,
Knihovna,
Konference,
Koňské dostihy,
Koupaliště,
Kravín,
Kuchařka,
Kurýrní služba,
Kurzy vaření,
Laboratoř,
Lékárna,
Lékařská karta pacienta,
Léky,
Lesní školka,
Letecká společnost,
Letecká záchranná služba,
Letiště,
Letní tábor,
Logistická firma,
Logistické centrum,
Logistický sklad,
Loterie,
Lyžařská škola,
Lyžařský areál,
Márnice,
Mateřská škola,
Menzy,
Městská hromadná doprava,
Městské exkurze,
Mobilní operátor,
Mobilní telefony,
Modely vláčků,
Multifunkční aréna,
Muniční sklad,
Muzeum,
Mýtné brány,
Nabídky dovolené,
Nabídky práce,
Nadnárodní společnost,
Náhradní díly,
Národní park,
Nebankovní půjčky,
Nemocnice,
Nutriční hodnoty,
Obchodní centrum,
Obchodní rejstřík,
Očkování do ciziny,
Odevzdávání úkolů,
Online cvičení,
Online půjčovna seriálů,
Ordinace lékaře,
Orientační běh,
Osobní doklady,
Osobní trenér,
Parkoviště,
Pekárna,
Personální agentura,
Pěstounská péče,
Pivovar,
Pizzerie,
Plánovací kalendář,
Plánování schůzek,
Platební karty,
Plavecký bazén,
Pneuservis,
Počítačové hry,
Pohádky,
Pojišťovna,
Policejní databáze,
Politické strany,
Populární hudba,
Porodnice,
Poslanecká sněmovna,
Pošta,
Potravinová banka,
Požární ochrana,
Pracovní úřad,
Provoz metra,
Průmyslová zóna,
Předpověď počasí,
Přepravní kontrola,
Přírodní rezervace,
Přístupový systém,
Psí útulek,
Psychiatrická léčebna,
Půjčovna auta,
Půjčovna lodí,
Půjčovna svatebních šatů,
Realitní agentura,
Redakční systém,
Registr obyvatel,
Regulační poplatky,
Restaurace,
Rezervace letenek,
Rezervace místností,
Rezervace ubytování,
Rezervace v restauraci,
Rozvodná síť,
Rozvoz jídla,
Rybářské potřeby,
Řízení letecké dopravy,
Řízení projektů,
Sázková kancelář,
Sbírka zákonů,
Sdílená kola,
Sdílené cestování,
Síť bankomatů,
Síť multikin,
Skautské středisko,
Sklad nápojů,
Skládka,
Sklárna,
Sociální dávky,
Sociální síť,
Soudní řízení,
Spalovna,
Spediční firma,
Společenství vlastníků jednotek,
Sportovní klub,
Sportovní turnaj,
Správa objektů,
Správce financí,
Srovnávač ubytování,
Stáj,
Státy světa,
Stavební řízení,
Stavebnice lego,
Stavebniny,
Střední škola,
Střelnice,
Studijní materiály,
Studijní systém,
Supermarket,
Světové dědictví,
Svoz a likvidace odpadů,
Symfonický orchestr,
Šachová databáze,
Taneční škola,
Taxi služba,
Televizní program,
Televizní seriály,
Třídní kniha,
Turistické cesty,
Turistický oddíl,
Turistický ruch,
Ubytování v soukromí,
Uprchlický tábor,
Úschovna zavazadel,
Územní plán,
Válečné konflikty,
Včelař,
Večerka,
Vědecké projekty,
Vědecké publikace,
Velkochov drůbeže,
Velkoobchod,
Veřejná zeleň,
Veřejné zakázky,
Vesmír,
Veterinární klinika,
Vězení,
Videopůjčovna,
Virtuální prohlídky,
Víza,
Vlakové nádraží,
Vojenský prostor,
Volby,
Volnočasové aktivity,
Vozový park,
Vrakoviště,
Vydavatelství novin,
Výkaz práce,
Výrobní procesy,
Vysokoškolská kolej,
Výstava,
Výstaviště,
Výtvarná díla,
Vývoj softwaru,
Vzdělávací instituce,
Webhosting,
Webový obchod,
Zábavní centrum,
Zahrádkářská kolonie,
Zahradnictví,
Záchytka,
Zastavárna,
Zbraně,
Zdravotní pojišťovna,
Zdravotní úhrady,
Zemědělská výroba,
Zimní úklid komunikací,
Zoologická zahrada,
Zpravodajská služba,
Žákovská knížka,
Železniční síť
- Nevertheless, the following topics are not allowed this semester
- Student information system
- Airport and flight tickets
- Library
- Cinema
- Games of all kinds
Recommended Literature
- Pokorný J. - Valenta M.: Databázové systémy.
ISBN: 978-80-01-05212-9.
Nakladatelství ČVUT, Praha, 2013.