Database applications were built directly on top of file system to overcome the following drawbacks of using file-systems:
(i) Data redundancy and inconsistency
(ii) Difficulty in accessing Data
(iii) Data isolation
(iv) Integrity problems
Calculate the order of leaf(pleaf) and non leaf(p) nodes of a B+ tree based on the information given below Search key field = 12 bytes Record pointer = 10 bytes Block pointer = 8 bytes Block size = 1 KB
Given a block can hold either 3 records or 10 key pointers. A database contains n records, then how many blocks do we need to hold the data file and the dense index