CST 363 - Week 4 Learning Journal

Five Concepts Learned in Intro to Database Systems:

1. Schema and Data Types: Schema defines the structure of a table by specifying column names, their data types and keys, which form the blueprint for how data is stored and accessed. 

2. Conditions and Query Evaluation: Logical conditions are used to filter data and queries apply conditions to return only the rows that satisfy the given query. 

3. Practical Uses of Java Collections: Java structures like ArrayList to manage schemas and tuples, and practiced accessing elements by index to support efficient query and table operations. 

4. Heap tables: Combines schemas, blocked files and bitmaps to create a disk-based table that can insert, delete and lookup rows in a way similar to a simple database storage engine. 

5. Bitmaps: A bitmap efficiently tracks which row slots in a table are free or occupied, helping the system quickly find available space after deletes. 

Questions about databases: 

1. How do real-world database systems efficiently handle concurrent access?

2. What's the difference between heap files, B+ tree indexes, and hash indexes and when should each one be used?

3. What strategies do production databases use to handle concurrent queries and ensure data consistency when multiple user are reading/writing at the same time?

Comments

Popular posts from this blog

CST 349 - Week 4 Learning Journal

CST349 Week 2 - Learning Journal

CST 349 - Week 5 Learning Journal