📘 database indexing

1. **State the problem:** We have a table with 300,000,000 rows and a dense, sorted index. Each index block is 4 kilobytes (4,000 bytes), and each index entry is 20 bytes. We want

1. **State the problem:** We want to find how many index blocks are read during a binary search on a dense, sorted index for a table with 800,000,000 rows. 2. **Given data:**

1. **State the problem:** We want to find how many index blocks are read during a binary search on a dense, sorted index for a table with 800,000,000 rows. 2. **Given data:**

1. **State the problem:** We have a table with 30,000,000 rows, each row is 100 bytes, and the table and index blocks are 2 kilobytes (2,000 bytes). The index is sparse, and we wan