Explain multi level indexing with an example
The eduladder is a community of students, teachers and programmers just interested to make you to pass any exams. Because we believe that you can do more than that of just passing exams. What else we do?
Our team
Wondering how this works?
Want to pass exams? or want to help students to pass?

Ask a Question

You are here:-->View note-->View question

Explain multi level indexing with an example?

Explain

By:scribed

Taged users:
|metaphor|lohithn4gmailcom|vtunotesbysree|vijayv|Jhon|neenu2|Vinesh|metadata|Aishwarya-shetty-s|nikhil43874|

Likes:
Be first to like this question

Dislikes:
Be first to dislike this question
Talk about thisDelete|Like|Dislike|


Answers

Index records comprise search-key values and data pointers. Multilevel index is stored on the disk along with the actual database files. As the size of the database grows, so does the size of the indices. There is an immense need to keep the index records in the main memory so as to speed up the search operations. If single-level index is used, then a large size index cannot be kept in memory which leads to multiple disk accesses.

Multi-level Index

Multi-level Index helps in breaking down the index into several smaller indices in order to make the outermost level so small that it can be saved in a single disk block, which can easily be accommodated anywhere in the main memory.


metaphor

Likes:
Be first to like this answer

Dislikes:
Be first to dislike this answer
Talk about thisOnce you have earned teacher badge you can edit this questionDelete|Like|Dislike|
------------------------------------

You dont have permission to add an answer herePlease see this

Join us to pass any exams easily