Computer Science - Distributed Databases

Question 1 1 . Among the five , we should create an unclustered hash office finger on (ename , age , sal ) fields of Emp (b ) since we could nonwithstanding do an index scan for us to speed up the inquiry . If our system does not include index further pictures whence we shouldn t create an index for this examination (e . However since this query requires us to irritate all Emp . records , an index would really suffice us anything at all . Therefore , we should access the records apply a scan2 . For this case , we should create clustered dense B tree index (c ) on (floor , budget ) fields of Dept , because the records go out be organized under these fields . Thus , if we fare 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 the budget .

Note that this plan is not an index-only plan (must look up didsQuestion 2We should place the in the midway of the tracks because sequential speed is not an issue due to the delicate 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 fill proximity in to reduce seek times . By doing so , we will also...If you want to get a skilful essay, secernate it on our website: BestEssayCheap.com< /a>

If you want to get a full essay! , visit our page: cheap essay