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

Views-data control, Views A view is like a window by which data from ta...

Views A view is like a window by which data from tables can be changed or viewed. The table on which a view is based is known as Base table. The view is stored as a SELECT stat

Single valued normalisation, Single Valued Normalisation  Codd in the y...

Single Valued Normalisation  Codd in the year 1972 formed three normal forms (1NF, 2NF, and 3NF). These were based on functional dependencies between the attributes of a relati

What are the various states of transaction process, What are the various st...

What are the various states through which a transaction passes through in its lifetime?  Briefly discuss all the events that causes transition from one state to another.   Ans:

Explain the cascadeless schedule, Explain the Cascadeless Schedule A ca...

Explain the Cascadeless Schedule A cascadeless schedule is one in which for every pair of transactions Ti and Tj like that Tj reads a data item before written by Ti, the commit

Define instance and schema, Define instance and schema? Instance: Colle...

Define instance and schema? Instance: Collection of data stored in the data base at a certain moment is Schema: The overall design of the data base is known as the data base

Hashing.., various techniques of hashing?

various techniques of hashing?

The data of a view is not physically stored, The data of a view is not phys...

The data of a view is not physically stored, but derived from one or more tables. True the data of a view is not physically stored

Give an example of enforcement in typing, Give an example of enforcement in...

Give an example of enforcement in Typing. You can understand the idea of enforcement as it makes sure objects of dissimilar classes may not be interchanged as below:  Exampl

Data modelling, Law Associates is a large legal practice based in Sydney.  ...

Law Associates is a large legal practice based in Sydney.  You have been asked to design a data model for the practice based upon the following specification: The practice emplo

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