Register

Database: Multilevel Indexing

• edited
2,093 views
2 votes
2 votes

In the following question, How to know that at first level (base level) index entries will be recorded for a block or for each record?https://gateoverflow.in/2311/gate1993_14

See the highlighted part below, what if we have multilevel secondary inedxing?


• edited
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

1.8k
views
2 answers
2 votes
aditi19 asked Nov 23, 2018
1,780 views
B+ Tree Self Doubt
what is the minimum and maximum number of keys for non-leaf nodes and leaf nodes for B+ Tree of order p?
User Avatar
438
views
1 answers
0 votes
aditi19 asked Nov 23, 2018
438 views
B+ Trees
can anyone share some good resources fot B+ tree deletion?
User Avatar
1.5k
views
2 answers
3 votes
srestha asked May 17, 2019
1,538 views
Made Easy Test Series:Database-Indexing
The minimum number of nodes (both leaf and non-leaf) of $B^{+}$ tree index required for storing $5500$ keys and order of $B^{+}$ tree is $8$________________( ... in 2nd level.Am I missing something??But in ans they divided by only $8$ :(
User Avatar
658
views
0 answers
2 votes
Ayush Upadhyaya asked Oct 12, 2018
658 views
Database-Indexing
I have two doubts here(1)Doubt1-The number of blocks needed to store file must be 3000 and not 2930. Record organisation is unspanned and so 1 ... consider multi-level indexing with primary index. What should be the correct answer here?
User Avatar
Link Copied!