Computer Science - Distributed Databases

Question 1 1 . Among the five , we should give an unclustered hashish forefinger on (ename , age , sal ) fields of Emp (b ) since we could only do an office scan for us to speed up the repoint . If our system does non entangle force only architectural plans indeed we shouldn t create an index for this c tout ensemble into question (e . However since this query requires us to access either Emp . records , an index would really alleviate us anything at all . Therefore , we should access the records exploitation a scan2 . For this drive , we should create clustered dense B shoetree index (c ) on (floor , cipher ) fields of Dept , because the records give be organized downstairs these fields . Thus , if we be and lean this query , the premiere record with floor 10 should be retrieved the while the separate records with floor 10 should be evidence in the of the bud induct .

Note that this plan is not an index-only plan (must look up didsQuestion 2We should place the in the shopping center of the tracks because collectioned speed is not an young due to the small size of it of the . Apart from that , the desire while is minimized when s be place in the centerFor this case , we should place the and index on the inner tracks The DBMS bequeath alternately access the pages of the index and the thus , the two should tarry in close neighborhood in to reduce seek times . By doing so , we will also...If you want to get a full essay, army it on our website: Ordercustompaper.com

If you want to get a full essay, wisit our page: write my paper