Opening the paper…
Database Management Systems, End Term
Consider a B-tree index to be built on the attribute EmployeeID of a table Employees, with the following properties: • The length of the attribute EmployeeID is 16 bytes. • The size of each child pointer is 8 bytes. • The size of each record pointer is 8 bytes. • The size of each disk block is 488 bytes. With the given information, what is the best choice for the order of the non-leaf nodes of the B-tree?
Consider a B-tree index to be built on the attribute EmployeeID of a table Employees, with the following properties: • The length of the attribute EmployeeID is 16 bytes. • The size of each child pointer is 8 bytes. • The size of each record pointer is 8 bytes. • The size of each disk block is 488 bytes. With the given information, what is the best choice for the order of the non-leaf nodes of the B-tree? Consider the table BandRecords as given below: Let us create two different bitmap indices, one on the Tour attribute and the other on the Genre attribute. Which of the following options will give the correct result if we want to find all bands performing in 'RetroLive' and having the genre 'Rock'? Note: Options are in the form of Tour (operation) Genre Consider the table BandRecords as given below: Consider the relational schemas Student, Course and Enrolled: Now consider the following SQL query: The query returns: Consider the relational schemas Student, Course and Enrolled: Consider the relational schemas Student, Course and Enrolled: