Question

11. [6] We are going to design our B+ Tree to be as optimal as possible for our old hard drives (since the management won't buy new ones, those cheapskates! We want to keep the tree as short as we can, and pack each disk block in the filesystem as tightly as possible. We also want to access our data in sorted order for printing out reports, so each leaf node will have a pointer to the next one. see figure #1 on next page for a visualization of our tree. CPU architecture: Intel Xeon with 64 bit cores Filesystem: Ext4 with 4KB (4096 byte) blocks The customer records are keyed by a random UUID of 128 bits Customer's Data record definition from the header file: #include <uuid struct CustomerData uuid t uuid; char[32] name; uint32_t ytd-sales; // customer year to date sales /I Customer 128 bit key // Customer name (char is 1 byte each)

Answer 1