When users access a data warehouse, their queries usually involve aggregate data. These type of software is used to perform these queries OLAP
<h3>what is OLAP?</h3>
- OLAP (online analytical processing) is a computing strategy that allows users to easily and selectively extract and query data to explore it from various issues of view.
- OLAP industry brain queries often aid in trends analysis, financial reporting, sales forecasting, budgeting, and other planning purposes.
- For example a user can ask that data be analyzed to portray a spreadsheet displaying all of a business's beach ball effects sold in Florida in July, compare income figures with those for the same effects in September, and then see a comparison of other product sales in Florida in the same period.
To learn more about OLAP, refer to:
brainly.com/question/26691784
#SPJ4
Answer: For the optimal B-tree to be built, we select t so that a full node uses as much of a disk block as possible. In a full
node there are 2t−1 keys (4 bytes each), 2t−1 data record references (8 bytes each), 2t child
pointers (4 bytes each), a parent pointer (4 bytes), the number of keys (4 bytes) and the leaf
bit (which we’ll go ahead and assume takes 4 bytes though 1 bit would do). Hence we want to
pick t as large as we can so that 12(2t−1)+ 4(2t)+ 12 = 32t ≤ 4096. Solving for t yields that
we need t = 128. In class, we argued that the number of disk pages that must be read (d-1
using the notation from class) is at most logt(n + 1)/2. Since log128(n + 1)/2 = log128 ≈ 2.7
the number of levels below the root must be an integer, during a search at most 2 disk pages will need
to be brought into main memory.
Your correct answer would be a, seems reasonable
