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
Describe an data dictionary? A data dictionary is a data structure which keeps meta data about the structure of the database ie. the schema of the database.

Differentiate between various levels of data abstraction? Data Abstraction - Abstraction is the procedure to hide the irrelevant things from the users and represent the rele

What is a primary index? A primary index is an index whose search key also explains the sequential order of the file.

The database files accept the actual data and are typically the biggest in size. Depending on their shape, the tables for all the user operation can go in one database file-but

What is self-transition? If there is a transition which goes back to same state, it is known as "self- transition." With a trigger action exit action would be executed f

describe objectivde of file organisation

Use inheritance as an implementation technique when you are going to use inheritance as an implementation technique, you can achieve same goal in a safer way by making one cla

Describe a technique for direct search? Explain how data is stored within a file so which direct searching can be performed. For a file of unordered fixed length records by u

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?

3. (10 points) Assume that you have been presented with the following relation for the Baxter Aviation database: Charters (Pilot#, Pilot name, Aircraft ID#, #seats, Village, Fligh