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
Problem 1. Describe the following a) Advantages of Database Systems b) Functions of a DBMS Explanation of part (a) and (b) 2. Explain the following concepts w

Question: (a) What do you meant by content management and briefly describe four major components of a Content Management System? (b) Explain key benefits of a Content Manage

What is B-Tree? A B-tree eliminates the redundant storage of search-key values .It permits search key values to appear only once.

Breaking into Subsystems Decomposition is a significant technique for coping with complexity based on idea of divide and conquers. In dividing a problem into sub problems, the

Write short notes on extension and intension? In any data model, it is significant to distinguish among the description of the database and the database itself the description

Define Single Value and Multivalued attribute Single value attribute comprise a single atomic value for an entity and multivalued attribute may have much more than one value f

3. (10 points) Assume that you have been presented with the following relation for the Baxter Aviation database: Charters (Pilot#, Pilot name, Aircraft ID#, #seats, Village, Fligh

composite attribute

What are the advantages of having an index structure?      Ans: The index structures commonly provide secondary access paths, which offer alternative ways of accessing the reco