Indexed (indexed sequential) file organisation, Database Management System

Indexed (Indexed Sequential) File Organisation

It organises the file like a big dictionary, i.e., records are kept in order of the key but an index is stored which also allows a type of direct access. The records are kept sequentially by primary key values and there is an index built over the primary key field.

The retrieval of a data from a sequential file, on average, needs access to half the records in the file, making such inquiries not only useless but very time consuming for big files. To improve the query response time of a sequential file, a type of indexing method can be added.

An index is a set of address pairs, index value. Indexing associates a set of objects to a set of orderable quantities, which are generally smaller in number or their properties. Therefore, an index is a mechanism for faster search. While the indices and the data blocks are stored together physically, they are logically distinct. Let us use the word an index file to defines the indexes and let us refer to data files as data records. An index can be small sufficient to be read into the main memory.

A sequential file that is indexed on its primary key is known as an index sequential file. The index permits for random access to records, as the sequential storage of the records of the file gives easy access to the sequential records. An additional feature of this file system is the over flow area. The overflow area gives additional space for record addition without the need to make.

 

 

Posted Date: 3/7/2013 6:17:04 AM | Location : United States







Related Discussions:- Indexed (indexed sequential) file organisation, Assignment Help, Ask Question on Indexed (indexed sequential) file organisation, Get Answer, Expert's Help, Indexed (indexed sequential) file organisation Discussions

Write discussion on Indexed (indexed sequential) file organisation
Your posts are moderated
Related Questions
List two restrictions that are applied on the modification (updation, insertion or deletion) of base tables through view.  Ans: The two restrictions are: 1. If a view

Explain the term - Control as Concurrent Tasks As we know, any object can be implemented as a task in programming language or operating system. This is the most general approa

What type of view of total database content? Data base content Conceptual view of total database contain.

Objectives differentiate DDBMS and conventional DBMS; Describe Network topology for DDBMS; Describe the concepts of horizontal and vertical fragmentation; Descr

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

Question 1 Discuss about second normal form and third normal form Question 2 Write short note on                        1) Data Manipulation Language 2) Data Definition La

Why is database design important?

Rearrange Classes and Operations Sometimes, the similar operation is defined across different classes and can easily be inherited from a familiar ancestor, but more often oper

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

Two Phase Locking (2PL) The two-phase locking protocol having of two phases: Phase 1 : The lock acquisition phase : If a transaction T needs to read an object, it wants to