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, A student entity type has the following attributes,name..

A student entity type has the following attributes,name..

Define a relation schema, A Relation Schema represented by R(A1, A2, .....

A Relation Schema represented by R(A1, A2, ..., An) is made up of the relation name the list of attributes and R Ai that it contains. A relation is described as a set of tuples

Commercial database architecture, At its most essential level the DBMS arch...

At its most essential level the DBMS architecture can be divide into two parts: the back end and the front end. The back end is responsible for managing the physical database an

Explain embedding sql statements, Question 1 Explain the functions of t...

Question 1 Explain the functions of the following Storage Manager Buffer Manager Transaction Manager 2 Discuss about system catalog in a relational DBMS 3

Where and having clause in sql, WHERE and HAVING clause in SQL ? The WH...

WHERE and HAVING clause in SQL ? The WHERE clause is commonly used for implementing conditions on each tuple of the relation. The HAVING clause is used in combination along wi

Describe relational model, Describe relational model? Structure of rela...

Describe relational model? Structure of relational data base Basic structure Database schema Keys Schema diagram Query languages

Create a database for their customers, The ABC Bank authority now wants to ...

The ABC Bank authority now wants to create a database for their customers. So you are requested to modify your program of Assignment A3 as follows. The main program first displa

Define deadlock avoidance, Define Deadlock avoidance These protocols a...

Define Deadlock avoidance These protocols as well ensure that the system will never enter a deadlock state although the way it is done is different from deadlock prevention. I

What are the general transformation rules, What are the General Transformat...

What are the General Transformation Rules for Relational operations?  Ans: The transformation rules transform one relational algebra expression to AN EQUIVALENT ONE  1. E

Explain the components of database system in details., Explain the compone...

Explain the components of Database System in details.

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