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 database utility, What is database utility? Database utility is...

What is database utility? Database utility is the interface among the ABAP/4 Dictionary and the underlying the SAP system.

Windows 8 Administrative Tools, Which two tools are used to administer user...

Which two tools are used to administer users for Active Directory?

N-ary relationship, For every n-ary relationship type R where n>2, we make ...

For every n-ary relationship type R where n>2, we make a new table S to represent R. We contain as foreign key attributes in s the primary keys of the relations that show the parti

Durability-transaction , Durability : This property necessitates that once ...

Durability : This property necessitates that once a transaction has committed, the changes made by it be never lost because of subsequent failure. Thus, a transaction is also a bas

Ldb hierarchy there should exist one get statement, It is mandatory that fo...

It is mandatory that for every table in the LDB hierarchy there should exist one GET statement in the report. False.  It is not essential.

What is a query tree, What is a query tree?     Ans:  A query tree, as ...

What is a query tree?     Ans:  A query tree, as well known as operator graph, is a tree data structure that corresponds to a relational algebra expression. It denotes the inpu

Define the concept of design documentation, Design Documentation  The ...

Design Documentation  The Design Document shall be an extension of Requirements Analysis Design. "The Design Document will comprise a revised and much more detailed descrip

Nested queries, Nested Queries Let us see some more complex queries in ...

Nested Queries Let us see some more complex queries in this section. Sub-queries: Some of the basic concerns of sub-queries are: A sub-query is a SELECT statemen

Difference among a database schema and a database state, What is the differ...

What is the difference among a database schema and a database state? The collection of information stored in database at particular moment in time is known as database state a

Prepare a site map and submit it in bing and google, Project Description: ...

Project Description: I am updating my Javascript + HTML website with five domains for the same website I would like to know if I want to create site map and submit it in all the

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