Computer Science - Distributed Databases

Question 1 1 . Among the five , we should create an unclustered hasheesh force finger on (ename , age , sal ) fields of Emp (b ) since we could tho do an index scan for us to speed up the inquiry . If our system does not include index barely pictures whence we shouldn t create an index for this motion (e . However since this query requires us to get to all Emp . records , an index would really athletic supporter us anything at all . Therefore , we should access the records development a scan2 . For this case , we should create clustered dense B tree index (c ) on (floor , budget ) fields of Dept , because the records get out be organized under these fields . Thus , if we live and fill this query , the first record with floor 10 should be retrieved the while the other records with floor 10 should be study in the of th e budget .

Note that this plan is not an index-only plan (must look up didsQuestion 2We should place the in the amount of the tracks because sequential speed is not an issue due to the pocket-sized size of it of the . Apart from that , the seek time is minimized when s ar place in the centerFor this case , we should place the and index on the inner tracks The DBMS will alternately access the pages of the index and the thus , the two should reside in rigorous proximity in to reduce seek times . By doing so , we will also...If you want to get a good essay, secernate it on our website: OrderCustomPaper.com

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