Principles of Data Organisation (NDBI007)

Home Basic Information Formal Requirements Literature Contact

Basic Information Formal Requirements 1: The Hard Disk Drive 2: Static Indexes and Bitmaps 3: Static Hashing 4: Dynamic Hashing 5: B-Tree 6: R-Tree, Splitting of an Overflown Node Literature Contact

Basic Information

Annotation (source: SIS)
Lecturer: Irena Holubová (irena.holubova (at) matfyz.cuni.cz)
Tutor: Irena Holubová (irena.holubova (at) matfyz.cuni.cz), Pavel Koupil (pavel.koupil (at) matfyz.cuni.cz)
Lectures
Schedule
- Lectures: Wednesday 9:00 - 10:30 (room S1)
- Practical classes:
  - Every even Thursday 9:00 - 10:30 (room S1)
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
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 or you will not get bonus point during practical class, completing an extended version of homework may award you by 1 extra activity point
- Otherwise, up to 5 activity points can be earned for complete and correct solution
- There will always be at least 7 days for completing homework assignment
- Particular homework solution can be submitted only once (email: pavel.koupil@matfyz.cuni.cz)
- No late submission is accepted
Course credit:
- At least 15 points from practical classes and individual assignments is required for the course credit to be granted
- All above 15 activity points are transferred as bonus points to the exam (up to 15 points)

27. 2. 2025: The Hard Disk Drive

Study Material:
- NDBI007_01_HardDiskDrive.pdf
- video recording (English)
Supplementary Material:
- deskstar.pdf
Solution:
- NDBI007_01_Solution.pdf

6. 3. 2025: 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

27. 3. 2025: 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

10. 4. 2025: 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

24. 4. 2025: 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

22. 5. 2025: 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 before 29. 5. 2025 20:00 (AoE)

Recommended Literature

Pokorný, Jaroslav, and Michal Žemlička. Základy implementace souborů a databází. Karolinum, 2004.

Contact Me

     Department of Software Engineering
         Faculty of Mathematics and Physics
         Charles University
         Malostranské náměstí 25
         118 00 Prague
         Czech Republic

pavel.koupil@matfyz.cuni.cz

     Project ELI Beamlines
         Institute of Physics
         Czech Academy of Sciences
         Za Radnicí 835
         252 41 Dolní Břežany
         Czech Republic

pavel.koupil@eli-beams.eu