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

What is dml query langauge, What is DML Query Langauge? Data Manipulati...

What is DML Query Langauge? Data Manipulation Language (DML) - A data manipulation language is a language in which enables users to access or manipulate data as organized throu

design the logic using looping structure, 1. Design the logic, using a loo...

1. Design the logic, using a looping structure, for a program that outputs every even number from 1 through 25 along with its square and cube. 2. Mr. Sanchez owns 12 apartme

Explain the process-oriented decomposition, Breaking into Subsystems D...

Breaking into Subsystems Decomposition is a significant technique for coping with complexity based on idea of divide and conquers. In dividing a problem into sub problems, the

Emergence of client server architecture, Emergence of Client Server Archite...

Emergence of Client Server Architecture Some of the pioneering work that was completed by some of the relational database vendors permitted the computing to be distributed on m

What is meant by mean time to failure, What is meant by mean time to failur...

What is meant by mean time to failure? The mean time to failure is the amount of time that the system could run continuously without failure.

Define access time, Define access time. Access time is the time from wh...

Define access time. Access time is the time from when a read or write request is issued to when data transfer starts.

Develop network database ipad app, I want an iPad app that is a simple 1 pa...

I want an iPad app that is a simple 1 page form to complete with text. The Objective is to allow a few dozen people of the same organization (they're all on iPad) to open the app,

Explain the functions trim-length-count in oracle, Explain the following fu...

Explain the following functions of Oracle with suitable examples: (i) To_Char( ) (ii) Count( ) (iii) Trim( ) (iv) Length( ) Ans: (i) To_char( ): The TO_CHAR function conver

Optimistic concurrency control, Optimistic Concurrency Control Is locki...

Optimistic Concurrency Control Is locking the only way to stop concurrency related problems? There exist some other ways too. One such way is known as an Optimistic Concurrency

horizontal fragmentation, Horizontal Fragmentation- Horizontal fragmentati...

Horizontal Fragmentation- Horizontal fragmentation groups together the tuples in a relation that are collectively used by the main transactions. A horizontal fragment is produced b

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