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

ERD, entity relationship diagram about finance

entity relationship diagram about finance

Unit database integrity, Relations create the database. They must satisfy v...

Relations create the database. They must satisfy various properties, like no duplicate tuples, no ordering of tuples, and atomic attributes, etc. Relations that satisfy these basic

Explain trivial dependency, Explain trivial dependency? Functional depe...

Explain trivial dependency? Functional dependency of the form α ->β. is trivial if α C β. Trivial functional dependencies are satisfied by all the relations.

Eliminate columns not dependent on key, Eliminate Columns Not Dependent On ...

Eliminate Columns Not Dependent On Key The Employee Relation satisfies - First normal form - As it has no repeating groups. Second normal form - As it do not have multi-a

Define atom of domain relational calculus, Define Atom of domain relational...

Define Atom of domain relational calculus An atom has the outline 1 , x 2 , ... , x n > -> r , in which r stands for a relation on n attributes and x 1 , x 2 , ... , x n ar

Sorting field groups we cannot use more than one key field, While sorting f...

While sorting field groups we cannot use more than one key field False.

What are the requirements of algorithm designer, What are the Requirements ...

What are the Requirements of algorithm designer Algorithm designer should: i) Select proper algorithm so as to minimize implementation cost ii) Find most appropriate d

What are ways of finding out derived attributes, What are ways of finding o...

What are ways of finding out either an update is required or not for derived attributes? The ways to find out an update is required or, not are as: Explicit update

Explain the term- event, Event Occurrence of a process is called event...

Event Occurrence of a process is called event. In other words, the object can receive many input instructions. The changes which occur due to these instructions are known as e

Data envelopment analysis , I need a help with my assignment of data envelo...

I need a help with my assignment of data envelopment analysis which is due for submission next week on monday the 10th Dec. Will you be able to help so that I can submit it on tim

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