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

Design of distributed databases, Design Of Distributed Databases: The dist...

Design Of Distributed Databases: The distributed databases are mainly relational at local level. So a local database schema is the similar as that of a centralised database design

Define raid structure, Define raid? Briefly explain it? A range of disk...

Define raid? Briefly explain it? A range of disk organization methods, collectively called redundant arrays of independent disks (RAID) o   Improvement of reliability throug

Timestamp type, Do NOT use the timestamp type.  Use separate date and time ...

Do NOT use the timestamp type.  Use separate date and time data types only.  Figure out how to define an SQL insert statement that uses built-in SQL (or MySQL) functions to define

Explain the steps for reduction of e-r model, Explain the steps for reducti...

Explain the steps for reduction of E-R model into relational model. Ans:(a) Entity set in E-R model will be considered as table name in relational Model. (b) Attributes of e

Hierarchical model is also known by, Hierarchical model is also known by? ...

Hierarchical model is also known by? A hierarchical model is also known as a Tree structure.

Which operator is used to compare a value to a list literals, Which operato...

Which operator is used to compare a value to a list of literals values that have been specified? BETWEEN operator is used to compare a value to a list of literals values that h

Define 2nf normal form, 2NF Normal Form : A relation schema process R i...

2NF Normal Form : A relation schema process R is in 2NF if it is in 1NF and each non-prime attribute A in R is fully functionally related on primary key. Second normal form (2N

Horizontal Fragmentation, I want to fragment existing table using java code...

I want to fragment existing table using java code... help me..!!

A table joined with itself is called, A table joined with itself is called ...

A table joined with itself is called ? A table joined with itself is known as self join table. Normal 0 false false false EN-IN X-NONE X-NONE

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