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 are the ways in which signal can be generated, What are the ways in wh...

What are the ways in which signal can be generated A signal might be generated in many ways such as a Signal is result of particular physical condition. Whenever a process writ

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

Dependency preservation, Dependency Preservation It is obvious that the...

Dependency Preservation It is obvious that the decomposition must be lossless so that we do not lose any information from the relation that is decomposed. Dependency preservati

Operator precedence-data manipulation language, Operator Precedence The...

Operator Precedence The basic operators used in SQL are * /   - + Operators of the similar priority are evaluated From Left to right Parentheses are used to force priorit

Create a database of a motor bike racing club, You have a friend that runs ...

You have a friend that runs a motor bike club that holds racing events at various venues on weekends, on a monthly basis. Some venues are private race tracks and some are dirt trac

What are the reasons of bucket overflow, What are the reasons of bucket ove...

What are the reasons of bucket overflow? Explain any two methods for solving this problem. Ans:  It is general for file structures to be divided into equal-length partitions, k

Convert the erd into its relevant relational schema, Question: Describe...

Question: Describe briefly the three parts of the Relational Model. (a) The term integrity refers to the accuracy or correctness of the data in the database. Define the fol

Concurrency executions, Explain TPS concurreny executions stating their adv...

Explain TPS concurreny executions stating their advantages in online business advancement

Define a relation schema, A Relation Schema represented by R(A1, A2, .....

A Relation Schema represented by R(A1, A2, ..., An) is made up of the relation name the list of attributes and R Ai that it contains. A relation is described as a set of tuples

Nested relational model, what is Nested relational model? Explain with exam...

what is Nested relational model? Explain with examples.

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