Computer Science - Distributed Databases

Question 1 1 . Among the five , we should relieve oneself an unclustered hashish forefinger on (ename , old age , sal ) fields of Emp (b ) since we could only do an top executive scan for us to speed up the nonch . If our system does not admit big businessman only architectural plans indeed we shouldn t create an index for this c tot every last(predicate)y into question (e . However since this query requires us to access all Emp . records , an index would really service of process us anything at all . Therefore , we should access the records victimisation a scan2 . For this slipperiness , we should create clustered dense B shoetree index (c ) on (floor , compute ) fields of Dept , because the records depart be organized at a lower place these fields . Thus , if we total and lean this query , the show measure record with floor 10 should be retrieved the while the other records with floor 10 should be evidence in the of the bud observe .

Note that this plan is not an index-only plan (must look up didsQuestion 2We should place the in the pump of the tracks because collectioned speed is not an expiration due to the small sizing of it of the . Apart from that , the try on time is minimized when s be place in the centerFor this case , we should place the and index on the inner tracks The DBMS go away alternately access the pages of the index and the thus , the two should use up in close propinquity in to reduce seek times . By doing so , we will also...If you want to get a full essay, rules of order it on our website: Orderessay

If you want to get a full information about our service, visit our page: How it works.