Multilevel indexing scheme, Database Management System

Assignment Help:

Multilevel Indexing Scheme

Consider the indexing scheme where the address of the block is consider in the index for each record, for a little file, this index would be little and can be processed efficiently in the main memory. Though, for a large file the size of index can also be very big. In such a case, one can make a hierarchy of indexes with the lowest level index pointing to the records, whereas the higher level indexes point to the indexes on indexes.

The following points about the multi-level indexes given below:

  • The lowest level index points to every record in the file; therefore is costly in terms of space.
  • Insertion, updating, and deletion of records need changes to the multiple index files as well as the data file. Therefore, maintenance of the multi-level indexes is also expensive.

After discussing so much about the indexes let us now turn our attention to how an index can be executed in a database. The indexes are executed through B Trees. The following section defines the index execution in more detail.

 


Related Discussions:- Multilevel indexing scheme

Difference between clustered and a non-clustered index, What are the differ...

What are the difference between clustered and a non-clustered index? A clustered index is a special type of index that reorders the way records in the table are physically stor

Subclassing, In the ER diagram, one example of subclassing is depicted foll...

In the ER diagram, one example of subclassing is depicted following the Services entity. The subclasses Item Based and Time Based are created. The entity Services gains the attribu

Dbms built for online transaction processing, Problem: A DBMS built for...

Problem: A DBMS built for Online Transaction Processing (OLTP) is usually regarded as unsuitable for data warehousing. Each system is designed with a different set of requireme

Benefits and drawbacks of heap files, Benefits of heap files 1.   This i...

Benefits of heap files 1.   This is a easy file Organisation method. 2.   Insertion is somehow capable. 3.   Good for bulk-loading data into a table. 4.   Best if file

Differance between unordered and ordered file, Differance between Unordered...

Differance between Unordered and ordered file ? Unordered file do no has any sequence although ordered file has arranged in a few sequence and data are assigned in ordered form

Explain how the binary tree, QUESTION (a) Give two advantages of using ...

QUESTION (a) Give two advantages of using Linked List as compared to arrays. (b) (i) You are working as programmer at the Orange Mauritius branch. You have been asked to cre

Explain differance between primary and secondary storage, Explain differanc...

Explain differance between Primary and secondary storage ? Primary and secondary storage Computer storage is classified within primary(main) memory and secondary(per

Ldb hierarchy there should exist one get statement, It is mandatory that fo...

It is mandatory that for every table in the LDB hierarchy there should exist one GET statement in the report. False.  It is not essential.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd