Sparse and dense indexes, Database Management System

Assignment Help:

Sparse and Dense Indexes

These indexes in principle are the similar as that of indexes used at the back of the book. The key facts of the indexes are:

  • They are arranged on the order of the index value (ascending or descending) as per the option of the creator.
  • The indexes are logically individual files (just like individual index pages of the book).
  • An index is firstly formed for fast access of information.
  • The primary index is the index on the ordering field of the data file while a secondary index is the index on any other field, therefore, more useful.

 But what are dense and sparse indexes?

 Sparse indices are the indices that do not contain all the available values of a field. An index sets the records as per the index values. A sparse index is where the size of the group is one or more, whereas in a dense index the size of the group is 1. In other words a dense index have one index entry for each value of the indexing attributes, while a sparse index also known as non-dense index have few index entires out of the available indexing attribute values. For instance, the primary index on enrolment number is sparse, whereas secondary index on student name is dense.

 

 


Related Discussions:- Sparse and dense indexes

What is interaction diagram, What is Interaction Diagram An interactio...

What is Interaction Diagram An interaction diagram shows an interaction, comprises of a set of objects and their relationships including the messages that may be dispatched be

Union - basic set operation, UNION If R1 and R2 are two union compatibl...

UNION If R1 and R2 are two union compatible relations then R3 = R1 ∪ R2 is the relation having tuples that are either in R1 or in R2 or in both. In case, R3 will have tuples

Entity integrity, Before defines the second type of integrity constraint, v...

Before defines the second type of integrity constraint, viz., Entity Integrity, we should be well-known with the concept of NULL. Mostly, NULL is intended as a basis for dealing

How the one-to-one associations have to be implemented, Discuss how the one...

Discuss how the one-to-one associations have to be implemented. Some of properties of associations can be implemented directly by providing suitable declarations of the data me

Explain the term- periodic recomputation, Explain the term- Periodic recomp...

Explain the term- Periodic recomputation Periodic recomputation:  Base values are often updated in bunches. Sometimes, it is possible to just recompute all derived attributes p

Estimate the transaction states, Suppose an instruction takes 1 nanosecond ...

Suppose an instruction takes 1 nanosecond to execute (on average), a page fault takes 20 microseconds of processor time, and it takes 300 microseconds of disk time to read or write

What are the concurrency issues, Concurrency issues Data integrity...

Concurrency issues Data integrity: Threads accessing same object need to be synchronized, such as: banking account. Deadlock: One or more threads in system are perman

Data fragmentation, Data Fragmentation "Fragmentation includes decompos...

Data Fragmentation "Fragmentation includes decomposing the data in relation to non-overlapping component relations". Why do we require fragmenting a relation?

Domain constraint, Domain Constraint It shows that each attribute in a ...

Domain Constraint It shows that each attribute in a relation has to contain an atomic value only from the corresponding domains. The data types associated with commercial RDBMS

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd