The binary chop technique can be used to reduce record search time by as much as half the time taken.ĭisadvantages of sequential file organization.The sorting makes it easy to access records.For example, of the file has records with key fields 20, 30, 40, 50, 60 and the computer is searching for a record with key field 50, it starts at 40 upwards in its search, ignoring the first half of the set.Īdvantages of sequential file organization.Since the records are sorted, it is possible to know in which half of the file a particular record being searched is located, Hence this method repeatedly divides the set of records in the file into two halves and searches only the half on which the records is found. ![]() ![]() ![]() Because the record in a file are sorted in a particular order, better file searching methods like the binary search technique can be used to reduce the time used for searching a file.Retrieval requires searching sequentially through the entire file record by record to the end.Records are stored and accessed in a particular order sorted using a key field.There are four methods of organizing files on a storage media. File organization is very important because it determines the methods of access, efficiency, flexibility and storage devices to use. File organization refers to the way data is stored in a file.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |