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

Describe sequential file organization, Describe sequential file organizatio...

Describe sequential file organization.  Explain the rules for (i)  Inserting a new record. (ii)  Deleting an existing record.          Ans:A sequential f

What is repository?, Problem 1 Why are the operational system keys not ...

Problem 1 Why are the operational system keys not recommended for forming data warehouse primary keys? Give any two examples 2 Explain the following performance tuning techn

Datawarehouse, How to define a job scheduling strategy that will meet busin...

How to define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a

Need for a database management system, NEED FOR A DATABASE MANAGEMENT SYSTE...

NEED FOR A DATABASE MANAGEMENT SYSTEM A Database is a structured, persistent collection of data of an organisation. The database management system (DBMS) manages the database o

Relational algebraic operators, Problem Explain at least five relationa...

Problem Explain at least five relational algebraic operators with a suitable example. Note: All the above descriptions should be done by taking at least two examples from ou

Purchase orber , Run the following queries. For each query show 1) What yo...

Run the following queries. For each query show 1) What you expect the output to be based upon the data 2) the SQL code and 3) the output running the query in Oracle. 1. Show all c

A b-tree of order how much children m has maximum, A B-tree of order how mu...

A B-tree of order how much children m has maximum ? m has maximum m mchildren in a B tree.

Define deadlock recovery measures, Define Deadlock recovery measures       ...

Define Deadlock recovery measures                   To recover from deadlock, the cycle in the wait-for-graph should be broken. The common technique of doing this is to rollbac

Data base model, why are older data base model are being replaced by new da...

why are older data base model are being replaced by new data model

List some security violations, List some security violations (or) name any ...

List some security violations (or) name any forms of malicious access. A) Unauthorized reading of data B) Unauthorized modification of data C) Unauthorized destruction of

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