Register

MADE EASY TEST SERIES

264 views
0 votes
0 votes

Database table (R) consist 1000 records. The number of minimum B+ tree index blocks required to build dense B+tree index for relation (R) are _________. Assume order of B+ tree root node atleast 1 key atmost 12 key and other nodes of B+ tree order atleast 6 keys and atmost 12 keys.

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Mrityudoot asked Jan 12
142 views
Made Easy Test Series
Isn’t F$^{+}$ minimal cover? If C $\rightarrow$ A is already there, then why does augmented CD $\rightarrow$ A needs to be?
Isn’t F$^{+}$ minimal cover? If C $\rightarrow$ A is already there, then why does augmented CD $\rightarrow$ A needs to be?
User Avatar
0 votes
0 votes
1 answer
2
tulsidas.bhu asked Jan 8
178 views
made easy test series
Can anyone explain how the answer is 10?
Can anyone explain how the answer is 10?
User Avatar
1 votes
1 votes
1 answer
3
Sajal Mallick asked Nov 5, 2023
351 views
MADE EASY TEST SERIES
Unique not null is equivalent to primary key. Relational Algebra and SQL has same expressive power. Which of the above statements are False?
Unique not null is equivalent to primary key.Relational Algebra and SQL has same expressive power.Which of the above statements are False?
User Avatar
2 votes
2 votes
1 answer
4
kaustubh7 asked Sep 20, 2023
436 views
made easy test series 2023
Consider a relation R having seven attributes ABCDEFG. Fields of R contain only atomic values. FDs = {CD → G, A → BC, B → CF, E → A, F → EG, G → D} is set of functional dependencies. So, how many candidates key does the relation R have?
Consider a relation R having seven attributes ABCDEFG. Fields of R contain only atomic values.FDs = {CD → G, A → BC, B → CF, E → A, F → EG, G → D} is set of f...
User Avatar
Link Copied!