Consider a relation R(a, b, c, d) containing 1,000,000 records
Consider a relation R(a, b, c, d) containing 1,000,000 records, where each page of the relation holds 10 records. R is organized as a heap file with dense secondary indexes, and the records in R are randomly ordered. Assume that attribute a is a candidate key for R, with values lying in the range 0 to 999,999. For each of the following queries, name the approach that would most likely require the fewest I/Os for processing the query. The approaches to consider follow:
∎ Scanning through the whole heap file for R.
∎ Using a B+ tree index on attribute R.a.
∎ Using a hash index on attribute R.a.
The queries are:
1. Find all R tuples.
2. Find all R tuples such that a
3. Find all R tuples such that a = 50.
4. Find all R tuples such that a > 50 and a
Â
Answers
Status NEW
Posted 11 May 2017 09:05 AM
My Price 5.00
-----------
Attachments
file 1494495363-Answer.docx preview (205 words )
C-----------ons-----------ide-----------r a----------- re-----------lat-----------ion----------- R(-----------a, -----------b, -----------c, -----------d) -----------con-----------tai-----------nin-----------g 1-----------,00-----------0,0-----------00 -----------rec-----------ord-----------s, -----------whe-----------re -----------eac-----------h p-----------age----------- of----------- th-----------e r-----------ela-----------tio-----------n h-----------old-----------s 1-----------0 r-----------eco-----------rds-----------. R----------- is----------- or-----------gan-----------ize-----------d a-----------s a----------- he-----------ap -----------fil-----------e w-----------ith----------- de-----------nse----------- se-----------con-----------dar-----------y i-----------nde-----------xes-----------, a-----------nd -----------the----------- re-----------cor-----------ds -----------in -----------R a-----------re -----------ran-----------dom-----------ly -----------ord-----------ere-----------d. -----------Ass-----------ume----------- th-----------at -----------att-----------rib-----------ute----------- a -----------is -----------a c-----------and-----------ida-----------te -----------key----------- fo-----------r R-----------, w-----------ith----------- va-----------lue-----------s l-----------yin-----------g i-----------n t-----------he -----------ran-----------ge -----------0 t-----------o 9-----------99,-----------999-----------. F-----------or -----------eac-----------h o-----------f t-----------he -----------fol-----------low-----------ing----------- qu-----------eri-----------es,----------- na-----------me -----------the----------- ap-----------pro-----------ach----------- th-----------at -----------wou-----------ld -----------mos-----------t l-----------ike-----------ly -----------req-----------uir-----------e t-----------he -----------few-----------est----------- I/-----------Os -----------for----------- pr-----------oce-----------ssi-----------ng -----------the-----------
Not Rated(0)