Assume that each tuple of Sailors is 50 bytes long, that a page can hold 80 Sailors tuples, and that we have 500 pages of such tuples. For each of the following selection conditions, estimate the...

anybody ?Assume that each tuple of Sailors is 50 bytes long, that a page can hold 80 Sailors<br>tuples, and that we have 500 pages of such tuples. For each of the following selection<br>conditions, estimate the number of pages retrieved, given the catalog information in<br>the question.<br>1. Assume that we have a B+-tree indexT on the search key ( Sailors.sid ), and as-<br>sume that IHeight(T) = 4, IN Pages(T) = 50, Low(T)<br>= 1, and High(T)<br>= 100,000.<br>(a) oSailors.sid<50,000 (Sailors)<br>(b) oSailors.sid=50,000 (Sailors)<br>2. Assume that we have a hash index T on the search key ( Sailors.sid ), and assume<br>that IHeight(T) = 2, INPages(T) = 50, Low(T) = 1, and High(T) = 100,000.<br>(a) osailors.sid<50,000 (Sailors)<br>

Extracted text: Assume that each tuple of Sailors is 50 bytes long, that a page can hold 80 Sailors tuples, and that we have 500 pages of such tuples. For each of the following selection conditions, estimate the number of pages retrieved, given the catalog information in the question. 1. Assume that we have a B+-tree indexT on the search key ( Sailors.sid ), and as- sume that IHeight(T) = 4, IN Pages(T) = 50, Low(T) = 1, and High(T) = 100,000. (a) oSailors.sid<50,000 (sailors)="" (b)="" osailors.sid="50,000" (sailors)="" 2.="" assume="" that="" we="" have="" a="" hash="" index="" t="" on="" the="" search="" key="" (="" sailors.sid="" ),="" and="" assume="" that="" iheight(t)="2," inpages(t)="50," low(t)="1," and="" high(t)="100,000." (a)=""><50,000>

Jun 11, 2022
SOLUTION.PDF

Get Answer To This Question

Related Questions & Answers

More Questions ยป

Submit New Assignment

Copy and Paste Your Assignment Here