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

Data handling and research methods, Data Handling and Research Methods: ...

Data Handling and Research Methods: The dataset encompassing 130 participants contains several variables measuring detrimental health related behaviours referring to the use o

What are the components of storage manager, What are the components of stor...

What are the components of storage manager? The storage manager components include a) Authorization and integrity manager b) Transaction manager c) Buffer manager d

In e-r diagram how generalization is represented, In E-R diagram how genera...

In E-R diagram how generalization is represented? in E-R diagram generalization is represented by Triangle shape.

What is a database, What is a Database? To know what database is, we ha...

What is a Database? To know what database is, we have to start from data, which is the basic building block of any DBMS. Data: Facts, figures, statistics etc. having no pa

Datawarehouse, Explain four causes for failures in data warehouse projects

Explain four causes for failures in data warehouse projects

Logical operators-logical operators, Logical Operators Rules of Preced...

Logical Operators Rules of Precedence: Order evaluated Operator 1 All comparison operators 2

Discuss the mechanism to read data from and write to a disk, Discuss the me...

Discuss the mechanism to read data from and write to a disk? Disk read/write heads are mechanisms in which read data from or write data to disk drives. The heads have gone by

What are the key features of oracle, What are the key features of Oracle? ...

What are the key features of Oracle? Key features of Oracle are as follows: • Read Consistency • Concurrency • Locking Mechanisms • Quiesce Database • RAC • Portability

Differance between procedural and non procedural dml, Differance between pr...

Differance between procedural and non procedural DML? Procedural and non procedural DML Procedural DML exactly what data is require and how to obtain those data. Non procedural

Basic set operation, These are the binary operations; i.e., each is applied...

These are the binary operations; i.e., each is applied to two relations or sets. These two relations can be union compatible excluding in case of Cartesian product. Two relations R

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