Week 19 - Are Heaps of Trees a Forest?

Perhaps Heaps & Trees would be a more fitting title for this week, pardon my attempts at wittiness. This week I got hands-on experience with B+ Trees and Indexing and implementing a heap file system in Java. I’ll admit it was a seemingly light week, but there was plenty of content to wrap my head around.

I was able to simulate an operation on an online B+ tree. By simulating these operations, Lab 9 forced me to understand how data structures like B+ trees can retrieve data efficiently. I dealt with things like node insertion, updates, and the effects on tree structure. I understand why B+ trees are widely used in databases for indexing. They maintain sorted data and allow searches, sequential access, insertions, and deletions all while being efficient. Understanding trees is such an integral part of being a computer scientist.

In Lab 12 I learned how to implement a TableHeap class that stores rows in 4096-byte blocks on disk. I was able to understand the workings of file-based storage and how a database handles data on disk. Using a bitmap was new to me. But it’s quite interesting how this data structure can efficiently manage the status of thousands of rows with just a few bytes.

Although it was a seemingly light week because of our exam, it still packed a bit of a punch. But I’m glad I got to exercise these important concepts in CS.

Prompt:

1. A SQL view is a virtual table that is created by a query. It allows you to interact with data as if it were a table, even if it doesn’t store the data. Tables allow INSERT, UPDATE, and DELETE operations. 

2. Both Java and SQL have similarities in their conditional statements and data manipulation. However, SQL is designed for queries and managing data and Java serves a wider purpose as an object-oriented program. Java can be used for things like complex application development.