Clustering indexes, Database Management System

Clustering Indexes

It may be an excellent idea to keep data of the students in the order of the programme they have registered as most of the data file accesses may need student data of a particular programme only. An index that is formed on an ordered file whose records of a file are physically ordered on a non-key field (that is the field does not have a distinct value for every record) is known as a clustering index.

            1772_Clustering Indexes.png

 

                                Figure : A clustering Index on Programme of an employee file

                    1031_Clustering Indexes 1.png

Figure: Clustering index with separate blocks for each group of records with the same value for the clustering field

Please note the following points in the tables:

  • Data insertion and deletion is simpler than in the earlier clustering files, even now it is cumbersome.
  • The additional blocks allocated for an index entry are in the kind of linked list blocks.

 • Clustering index is one more example of a non-dense index as it has one entry for each distinct value of the clustering index field and not for all records in the file.

Posted Date: 3/7/2013 6:29:04 AM | Location : United States







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

Write discussion on Clustering indexes
Your posts are moderated
Related Questions
FDs in Relationships:  Enrols Relationship: None as it is many to many Teaches Relationship : Course code → Instructor Instructor → Course code The next question is:

Differentiate between B-tree and B + tree    Ans:  A B-tree (or Balanced Tree) is a search tree along with additional constraints that makes sure that the tree is all the time

#what is cursor its uses ? Explain it

What is SQL Profiler? SQL Profiler is a graphical tool that permits system administrators to monitor events in an instance of Microsoft SQL Server. You can capture and save dat


Lossless-Join Decomposition   Let us show an intuitive decomposition of a relation. We require a better basis for deciding decompositions since intuition may not always be r

Describe the development process of Object oriented methods Object oriented methods have roots which are strongly anchored back in the 60s, functional and structured methods we

Submit the table creation statements (including constraints) for the Database Model. Submit them all in a single script file. Also submit a document explaining what test data yo

This project will involve designing and creating a database for an organization.  In the design of a database, there is no single "perfect" design.  So your database design may not

What are the drawbacks of shadow-paging technique? The drawbacks of shadow paging is:- a) Commit Overhead b) Data fragmentation c)  Garbage collection