489 views
0 votes
0 votes

A B+ tree index is built on the key ‘CS’ attribute of the relation ME16. The attribute ‘CS’ is of length 32 bytes, disk blocks are of size 2048 bytes and index pointers are of size 8 bytes. The number of pointers per node is _______.

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
`JEET asked Dec 19, 2018
410 views
Consider a relation R(ABCDE) and functional dependency F1 = {A → B, C → E, B → D}.If the relation is decomposed into BCNF with lossless decomposition and dependency...
0 votes
0 votes
2 answers
2
Suvam Chatterjee asked Sep 9, 2015
509 views
I think conservative 2PL prevents deadlock also. What should be the answer? 
2 votes
2 votes
1 answer
4
h4kr asked Dec 8, 2022
294 views
I think the answer should be (B) would be right, because lets say in R, there is a FD NPA - CK, it won't qualify as BCNF even if CK is single attribute