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

Different ways for representing s graph, W h at are the different ways by...

W h at are the different ways by which we can represent graph?  Represent the graph drawn below using those ways.     T he d iff e r e nt w a y s by

What are the things require to implement abstract data types, What are the ...

What are the things require to implement ADT Abstract data types are very useful for helping us understand the mathematical objects which we use in our computations but, of cou

Drawback of sequential file, Following are some of the drawback of sequenti...

Following are some of the drawback of sequential file organisation: Updates are not simply accommodated. By definition, random access is impossible. All records should be

How does an array differ from an ordinary variable, Normal 0 fa...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Comparisions and assignments in worst case, Q. Calculate that how many key ...

Q. Calculate that how many key comparisons and assignments an insertion sort makes in its worst case?        Ans: The worst case performance occurs in insertion

Road transport booking system, what algorithms can i use for the above titl...

what algorithms can i use for the above title in my project desing and implmentation of road transport booking system

Relative and direct files, Each data record contains a fixed place in a rel...

Each data record contains a fixed place in a relative file. Each record ought to have associated with it in integer key value which will help identify this slot. Therefore, this ke

Explain principle of optimality, Explain principle of Optimality It ind...

Explain principle of Optimality It indicates that an optimal solution to any instance of an optimization problem is composed of  optimal solutions to its subinstances.

Efficient way of storing two symmetric matrices, Explain an efficient way o...

Explain an efficient way of storing two symmetric matrices of the same order in memory. A n-square matrix array is said to be symmetric if a[j][k]=a[k][j] for all j and k. For

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