Computer Science › Section J · Database systems › Topic J.6
Traditional file structures: indexed and hash files
Long before modern database systems, programmers worked out how to lay records out in files so they could be found fast. Their two great ideas, indexing and hashing, still sit inside every serious DBMS.
In this topic
- Underneath the database
- Sequential files and logical records
- Master files and transaction files
- Worked example: merging two sorted files
- Indexed files
- Worked example: what an index saves
- Indexes in layers
- Hash files
- Worked example: hashing into 13 buckets
- Collisions, overflow and load factor
- Common mistakes to avoid
- Key takeaways
This topic is part of Wuanberri Pro. Checking your access…