1,329 views
0 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.

Position:
Show:

Related questions

1 1 vote
1 1 answer
559
559 views
Mradul_Bhardwaj asked Jan 31, 2025
559 views
Consider the following array:After how many swaps the element 70 reach to the correct place?NOTE: [Apply selection sort]\begin{tabular}{|l|l|l|l|l|l|l|l|}\hline 70 & 60 &...
1 1 vote
1 answers 1 answer
907
907 views
`JEET asked Dec 19, 2018
907 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 prese...
0 0 votes
2 2 answers
878
878 views
Suvam Chatterjee asked Sep 9, 2015
878 views
I think conservative 2PL prevents deadlock also. What should be the answer?