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
What is a candidate key? Minimal super keys are known as candidate keys.

Determine the Other System Design Issue How to realise subsystems; through hardware or software? How is object model mapped on chosen hardware software? Mapping

What are the DBMS languages? Briefly explain? Data Definition language (DDL):A database schema is specified through a set of definitions expressed through a special language

compare the features of oracle RDBMS with MySQL and Microsoft SQL server

each publisher has uniqe name a mial addrs are also kept on each pubisher.a publisher publish one book.a book publish y one publisher.book identified by isbn.each book writn by one

find a name whose address is erode from student table

Describe the nested-loop join and block-nested loop join.   Ans:   The block nested- loop join algorithm is as described below:     for every block B r of relation R do beg

Differentiate between horizontal & mixed horizontal fragmentation?

You are managing the following database system: • DBMS: Oracle 11g • OS: Sun Solaris • System architecture: Web-based application using ASP.Net • Purpose of Server: HR managem

State The position of object at any moment is called state. An object can have many states depend upon time. After receiving some input instructions, the object can change its