Principles of Data Organisation (NDBI007)

Basic Information

Annotation (source: SIS)
Lecturer: Irena Holubová (irena.holubova (at) matfyz.cuni.cz)
Tutor: Pavel Koupil (pavel.koupil (at) matfyz.cuni.cz)
Lectures
Schedule
- Lectures: Thursday 10:40 - 12:10 (room S5)
- Practical classes:
  - Czech version every even/odd Wednesday 14:00 - 15:30 (room SU2)
  - English version based on individual consultation
Table with points

Formal Requirements

Practical classes:
- Attendance is not compulsory, yet recommended
- During each 2nd to 6th practical class, 1 activity point can be acquired for solving exercises
- English class may take place in the form of individual consultations and extended homeworks
You will be assigned 5 individual homework during the semester
- There will be standard and extended version of the homework
- If you miss a practical class, completing an extended version of homework may award you by 1 extra activity point
- Otherwise, up to 3 activity points can be earned for complete and correct solution
- There will always be 13 days for completing homework assignment
- Particular homework solution can be submitted only once
- No late submission is accepted
Individual programming task
- Optionally, you may choose an approach (presented during the semester) to implement as a user-friendly graphical simulator
- Approaches include, e.g., primary index, indirect index, bitmaps, Cormack, Larson and Kalja, Fagin, Litwin, LHPE-RL, B-Tree, B+-Tree, B*-Tree, various splitting methods in R-Tree and R*-Tree
- Teamwork is allowed, but the points will be distributed
- Up to 15 points can be granted for complete and correct implementation
Course credit:
- At least 5 points from practical classes and individual assignments is required for the course credit to be granted
- Note that all above 5 activity points are transferred as bonus points to the exam (up to 30 points)

18. 10. 2023: Static Indexes and Bitmaps

Study Material:
Solution:
- NDBI007_02_Solution.pdf
Homework Assignment:
- NDBI007_A1.pdf
- The solution can be handed in by email or on paper before the beginning of the next practical class
- Deadline: By the start of the 3rd practical class where you are enrolled in SIS

1. 11. 2023: Static Hashing

Study Material:
Solution:
- NDBI007_03_Solution.pdf
Homework Assignment:
- NDBI007_A2.pdf
- records_A2.csv
- The solution can be handed in by email or on paper before the beginning of the next practical class
- Deadline: By the start of the 4th practical class where you are enrolled in SIS

15. 11. 2023: Dynamic Hashing

Study Material:
Solution:
- NDBI007_04_Solution.pdf
Homework Assignment:
- NDBI007_A3.pdf
- records_A3.csv
- The solution can be handed in by email or on paper before the beginning of the next practical class
- Deadline: By the start of the 5th practical class where you are enrolled in SIS

29. 11. 2023: B-Tree

Study Material:
Solution:
- NDBI007_05_Solution.pdf
Homework Assignment:
- NDBI007_A4.pdf
- records_A4.csv
- The solution can be handed in by email or on paper before the beginning of the next practical class
- Deadline: By the start of the 6th practical class where you are enrolled in SIS

13. 12. 2023: R-Tree, Splitting of an Overflown Node

Study Material:
Solution:
- NDBI007_06_Solution.pdf
Homework Assignment:
- NDBI007_A5.pdf
- The solution can be handed in by email or on paper before the beginning of the consultation class where you are enrolled in SIS

Basic Information