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

Advantages of data distribution, Advantages of Data Distribution The pr...

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.

Relationship, what is the relationship between receipt and owner entities i...

what is the relationship between receipt and owner entities in computer sales and service company

Define variable-length records arise in database, What are the ways in whic...

What are the ways in which the variable-length records arise in database systems? Storage of many record types in a file. Record types that permit variable lengths for one o

Architecture, With the help of a suitable diagram gives module wise explana...

With the help of a suitable diagram gives module wise explanation of system architecture of DBMS.on..

Relational DB, Suppose R is a relation with attributes A1, A2,..., An. As a...

Suppose R is a relation with attributes A1, A2,..., An. As a function of n, tell how many superkeys R has, if: 1.1 The only key is A1. 1.2 The only key is A1 and A2. 1.3 The o

Table handling, Table Handling  In RDBMS more than one table can be tac...

Table Handling  In RDBMS more than one table can be tackled at a time by using join operation. Join operation is a relational operation that causes 2 tables with a common domai

Nested query, what is correlation in nested query

what is correlation in nested query

Generalization and specialization, design a generalization specialization h...

design a generalization specialization hierarchy for a motor vehicle sales company. the company sells motorcycles, passenger cars, vens and buses.

What are the uses of odbc, What are the uses of ODBC? Under what circumstan...

What are the uses of ODBC? Under what circumstances we use this technology? ODBC expose database capabilities within a standardized way to the application programmer by an ap

What is relational calculus, What is Relational calculus? Relational c...

What is Relational calculus? Relational calculus is a Non- Procedural language.

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