Methods of physically storing data in the files, Data Structure & Algorithms

Assignment Help:

This unit dealt along with the methods of physically storing data in the files. The terms fields, records & files were described. The organization types were introduced.

The several file organization techniques were discussed. Sequential File Organization finds employ in application areas where batch processing is more common. Sequential files are simple to employ and can be stored on cheap media. They are appropriate for applications that need direct access to only specific records of the collection. They do not provide sufficient support for interactive applications.

In Direct file organization, there exists a predictable relationship among the key used and to identify a specific record on secondary storage. A direct file has to be stored on a direct access device. Direct files are utilized extensively in application areas where interactive processing is utilized.

An Indexed Sequential file supports both sequential access through key value & direct access to a specific record, given its key value. It is implemented by developing an index on top of a sequential data file that resides on a direct access storage device.


Related Discussions:- Methods of physically storing data in the files

Time complexity, Run time complexity of an algorithm is depend on

Run time complexity of an algorithm is depend on

Enumerate about the data structure, Enumerate about the Data structure ...

Enumerate about the Data structure An arrangement of data in memory locations to signify values of the carrier set of an abstract data type. Realizing computational mechanis

Functions for inserting and deleting at either end of deque, Q. Devise a re...

Q. Devise a representation for a given list where insertions and deletions can be made at both the ends. Such a structure is called Deque (which means Double ended queue). Write fu

Circular linked list, In a circular linked list There is no beginning a...

In a circular linked list There is no beginning and no end.

Notes, Ask question #Minimum 10000 words accepted#

Ask question #Minimum 10000 words accepted#

Quick sort method, Q. Explain quick sort? Sort the given array using quick ...

Q. Explain quick sort? Sort the given array using quick sort method. 24 56 47 35 10 90 82 31

The threaded binary tree, By changing the NULL lines in a binary tree to th...

By changing the NULL lines in a binary tree to the special links called threads, it is possible to execute traversal, insertion and deletion without using either a stack or recursi

Explain division method, Explain Division Method Division Method: - In...

Explain Division Method Division Method: - In this method, key K to be mapped into single of the m states in the hash table is divided by m and the remainder of this division

Give the example of bubble sort algorithm, Give the example of bubble sort ...

Give the example of bubble sort algorithm For example List: - 7 4 5 3 1. 7 and 4 are compared 2. Since 4 3. The content of 7 is now stored in the variable which was h

Which is the most suitable data type, Problem 1. You are asked to store...

Problem 1. You are asked to store Names of all 100 students of class A in your Learning Centre. Which data type will you use? What is its syntax? Explaining the data typ

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