Describe the storage structure of indexed sequential files, Database Management System

Assignment Help:

Describe the storage structure of indexed sequential files and their access method. 

Ans:   Storage structure of Indexed Sequential files and their access: To achieve fast random access to records in a file, we can utilize an index structure. An index record contains a search key value and pointers to data records that is related with a specific search key. An ordered index stores the values of the search keys in sorted order. A file may have various indices on different search keys. If the files consisting of the records are sequentially ordered, a primary index is an index whose search key also describes the sequential order of the file. Such types of files are termed as index sequential files. There are two sorts of ordered indices: dense and sparse. In dense index, and index record appears only for a few of the search-key in the files as displayed below.

2288_Describe the storage structure of indexed sequential files and their access method.png

To access a specific record with search key value, K, by using dense index we search index record along with search key value, K, by which reach the first entry of data record along with search key value K. After that the data records are searched linearly to acquire the required record. If either the index record is not there or the linear search arrive the data record with different search key value, then the record is not there. Here now for sparse index, we search index record along with search key value, K or the index record with highest search key value less as compared to K, from which arrives the first entry of data record with search key value K or highest value less than K. After that the data records are searched linearly to acquire the required record. If the linear searches the data record with search key value greater as compared to K, then the record is not there.


Related Discussions:- Describe the storage structure of indexed sequential files

Design of distributed databases, Design Of Distributed Databases: The dist...

Design Of Distributed Databases: The distributed databases are mainly relational at local level. So a local database schema is the similar as that of a centralised database design

What is the used of specifying alias, What is the used of specifying alias?...

What is the used of specifying alias? Specifying alias: is used to rename column or attribute in a table.

Create the table, Question: Using the data model express the following ...

Question: Using the data model express the following queries in SQL. (a) Create the Table named "Cinema" and make the cinema_code to be the primary key of the relation and

Database Normalization, I have a homework assignment due today by midnight....

I have a homework assignment due today by midnight. I need help understanding databasse normalization and determining the type of form violation & how to fix the violation.

What is rigorous two phase locking protocol, Differentiate strict two phase...

Differentiate strict two phase locking protocol and rigorous two phase locking protocol. In strict two phase locking protocol all exclusive mode locks taken by a transaction is

Why object-oriented system use the relational dbms, Why, generally does an ...

Why, generally does an object-oriented system use the relational DBMS? The reasons for using relational DBMS for OO systems could be any combination of following: a. Many or

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?

Write query to select student from math department, Consider the table stud...

Consider the table student and list names of students in the departments other than maths and computer. SELECT std_name FRM student WHERE dept_name NOT IN (‘Maths','Computer);

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

State the meaning of object representation, State the meaning of Object Rep...

State the meaning of Object Representation  The term object representation means "to represent object with the help of objects model symbols". Implementing objects is too simp

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