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

Hardware failure-database recovery and security, Hardware failure :  Hardwa...

Hardware failure :  Hardware failures are the failures when some disk or hardware chip fails. This may result in loss of data. One such trouble can be that a disk gets damaged and

Which operator is cartesian product in relational algebra, Which operator i...

Which operator is Cartesian product in relational algebra? Cartesian product in relational algebra is a binary operator. (It requires two operands. e.g., P X Q)

Define raid structure, Define raid? Briefly explain it? A range of disk...

Define raid? Briefly explain it? A range of disk organization methods, collectively called redundant arrays of independent disks (RAID) o   Improvement of reliability throug

Computing the closure of a set of functional dependency, What is meant by c...

What is meant by computing the closure of a set of functional dependency? The closure of F denoted by F + is the set of functional dependencies logically implied by F.

Describe hashing in dbms, Describe Hashing in DBMS? Hashing: Hashing ...

Describe Hashing in DBMS? Hashing: Hashing is a technique to store data within an array so which storing, searching, inserting and deleting data is fast (in theory it's O(1))

Describe the terms ‘database'' and ‘data warehouse'', Problem: ‘Users a...

Problem: ‘Users and Information system specialists need to spend inordinate amounts of time locating and gathering data' (Watson and Hal, 1998) Recent developments in the ar

Define single value and multivalued attribute, Define Single Value and Mult...

Define Single Value and Multivalued attribute Single value attribute comprise a single atomic value for an entity and multivalued attribute may have much more than one value f

Client server databases, Client Server Databases- The concept behind the C...

Client Server Databases- The concept behind the Client/Server systems is simultaneous, cooperative processing. It is an approach that presents a one systems view from a user's vie

Consistency error-database errors, Consistency error : These errors happen ...

Consistency error : These errors happen due to the inconsistent state of database caused may be due to wrong implementation of commands or in case of a transaction abort.  To overc

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