1. Just list the records in as many blocks as necessary to hold the records.
2. Blocks are linked by pointer or table of block address.
This is called Heap file Organization.
please let me know if you find any better answer
thanks
Afiz's (afizshaik@gmail.com)
Heap file organization Sequential File Organization Hashing File organization
1) insersection becomes easy in heap file organization. 2) deleation process also becomes easy in heap file organization. 3) searching or retrival of data becomes hard(it take more time).
Primary file organization is the way in which we determine how the file records are physically placed on the disk and hence, how the records can be accessed. Unordered means that there is no particular order in this way, i.e. a heap algorithm is used.
A large number of file .
file organization
to have a data file with multiple access path is known as multi key file organization
There is great importance in file organization. This type of organization can be easily looked through and files are easy to retrieve.
file organization is of 3 types sequential,direct and indexed sequential where how data is accessed in eash file is decided where as file maintainence is
random file organization is a organization were you search a certain object ofr file by the use of any key and in search by randomly
Please check with your local government or relief organization for specific information on when heap assistance money will be disbursed. Dates and eligibility criteria can vary depending on your location.
hash file organisation is containing the record of the file.
Indexed sequential file organization. =In indexed sequential file organization, the records arestored in sequence according to a primary key and an index is created to allow random access of the file. This type of organization also allows the file to be accessed sequentially. Indexed sequential is the most commonlyused type of file organization. writer-k.k.b -montanna