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

Central database schema, Show a centralised schema to support the operation...

Show a centralised schema to support the operation of the system you have chosen, including in particular: the product catalogue; the outlets and respective stocks; customer record

Digital, #floating point representation is used to store

#floating point representation is used to store

Hangman, a method named WonGame that checks each letter in the word is matc...

a method named WonGame that checks each letter in the word is matched by its label

What is the aim of object design, What is the aim of object design The ...

What is the aim of object design The aim of object design is to identify object which the system   contains and the interactions among them. The system implements specification

find a non-redundant cover and canonical cove, Given the following set of ...

Given the following set of functional dependencies {cf→ bg, g → d, cdg → f, b → de, d → c} defined on R(b,c,d,e,f,g) a. Is cf→ e implied by the FDs? b. Is dg a superkey?

Difference between clustered and a non-clustered index, What are the differ...

What are the difference between clustered and a non-clustered index? A clustered index is a special type of index that reorders the way records in the table are physically stor

What is stored procedure, What is Stored Procedure? A stored procedure ...

What is Stored Procedure? A stored procedure is a named group of SQL statements that have been previously formed and kept in the server database. Stored procedures accept input

horizontal fragmentation, Horizontal Fragmentation- Horizontal fragmentati...

Horizontal Fragmentation- Horizontal fragmentation groups together the tuples in a relation that are collectively used by the main transactions. A horizontal fragment is produced b

Adding redundant associations for efficient access, Adding Redundant Associ...

Adding Redundant Associations for Efficient Access Redundant associations do not add any type of information, therefore during design we should actually examine structure of o

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