Secondary indexes, Database Management System

Secondary Indexes

Let consider the student database and its clustering index and primary (only one will be applicable at a time). Now consider the state when the database is to be searched or accessed in the alphabetical order of names. Any search on a student name would need sequential data file search, therefore, is going to be very time consuming. Such a search on an average would need reading of half of the total number of blocks.

Therefore, we require secondary indices in database systems. A secondary index is files that have records having a secondary index field value which is not the ordering field of the data file, and a pointer to the block that have the data record. Please note that even if a data file can have only single primary index (as there can be only single ordering of a database file), it can have many secondary indices.

Secondary index can be described on an alternate key or non-key attributes. A secondary index that is described on the alternate key will be dense as secondary index on non-key attributes would need a bucket of pointers for one index entry. Let us define them in more detail with the help of Figures.

                        828_Secondary Indexes.png

Posted Date: 3/7/2013 6:31:01 AM | Location : United States







Related Discussions:- Secondary indexes, Assignment Help, Ask Question on Secondary indexes, Get Answer, Expert's Help, Secondary indexes Discussions

Write discussion on Secondary indexes
Your posts are moderated
Related Questions
What are deadlocks?  How can they be avoided?  Ans: Deadlock considers to a particular condition when two or more processes are every waiting for another to release a resource,

Can a domain, assigned to a data element be changed? Yes.  We can do so by just overwriting the entry in the field domain.

Advantages of Data Distribution The primary benefit of distributed database systems is the ability to access and share data in a reliable and efficient manner.

Rearrange Classes and Operations Sometimes, the similar operation is defined across different classes and can easily be inherited from a familiar ancestor, but more often oper

What is a candidate key? Minimal super keys are known as candidate keys.

Redo Logs: Any database must have minimum two redo logs. These are the rules for the database; the redo logs record all modifies to the system objects or user objects. If any type


What is Primary key? Primary Key - Primary key is one of the candidate keys which uniquely identifies each row in the relation.

Q.  What is relational algebra and calculus? Explain the relational algebra operators :- Selection and predicate, set operation, joins and division. Sol. Relational Algebra

In a relation, tuples are not inserted in any definite order. Ordering of tuples is not defined as a part of a relation definition. Though, records may be structured later accordin