Multilevel indexing scheme, Database Management System

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.

 

Posted Date: 3/8/2013 6:13:28 AM | Location : United States







Related Discussions:- Multilevel indexing scheme, Assignment Help, Ask Question on Multilevel indexing scheme, Get Answer, Expert's Help, Multilevel indexing scheme Discussions

Write discussion on Multilevel indexing scheme
Your posts are moderated
Related Questions
This project requires you to create a database design.  Your design will be documented in a set of Entity-Relationship diagrams.  Draw a set of Entity-Relationship diagrams to mode

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

Given the following set of functional dependencies {cf→ bg, g → d, cdg → f, b → de, d → c} defined on R(b,c,d,e,f,g) a. Is cf→ e implied by the FDs? b. Is dg a superkey?

Lack of Redundancy We have talked about the problems of repetition of information in a database. Such repetition should be stay away as much as possible. Let us state once again t

What are the difference between clustered and a non-clustered index? A clustered index is a special type of index that reorders the way records in the table are physically stor

Describe Database state in details? Database state: The actual data within the database at a particular moment in time is known as a database state.

Explain briefly concurrent task by taking an example. Concurrent Task- The concurrent occurrence of more than one event is called concurrent task. Operating systems can handl

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

What are the two types of errors? The two types of errors are: a) Logical error b) System error

Which component is not included in database environment ? A users component is not included in database environment.