Consider the following scenario: • A table is sorted on indexed column and has 10,000,000 rows. • Each row is 200 bytes. • Table and index blocks are 4 kilobytes. • Assume 1 kilobyte is approximately 1,000 bytes.Assuming the index is sparse, how many entries are in the index?

Consider the following scenario: • A table has 800,000,000 rows. • Each index block is 4 kilobytes. • Each index entry is 40 bytes. • Assume 1 kilobyte is approximately 1,000 bytes.Assuming the index is dense and sorted, a binary search for one row reads approximately how many blocks?

A table occupies 3000 blocks. FlightNumber is the primary key. A single-level index on FlightNumber occupies 100 blocks. The WHERE clause of a SELECT specifies "FlightNumber = 3750".What is the maximum number of blocks necessary to process the SELECT with an index scan?

Assume the table has no index. What is the maximum number of blocks necessary to process the SELECT with a table scan?

Identify advantage and disadvantage of Sparse Index.Slower than dense index for locating the recordsLow overhead during insertion and deletionOccupies less space than dense index

A single-level ordered index where the index points to  individual records  rather than  blocks of data    is known as:  *1 pointA. Dense indexB. Sparse indexC. Primary indexD. Secondary index