In: Computer Science
Disadvantage of Contiguous files:
Fragmentation take place in Contiguous file allocation method which include internal as well as external fragmentation.That effect its efficiency make system slow.
As we know that in Contiguous file system files are stored in Contiguously in memory so when ever we want to add more data to file its is dependent on space whether there is space available Contiguously in memory.
Disadvantage of indexed files:
As we know that overhead pointer is
used in indexed files that pointer has large size.
Overhead pointer slow/ is not efficient when it comes to proper use
of memory.
Disadvantage of multi-level indexed files:
As we know binary search is used in multilevel indexed files. it take to long to load desired file as it load different file to check. It take to long to make files in order. Maintenance is inefficient in multi-level indexed files system. Insertion and deletion requires to much work for system to do.
Improve performance of multi-level indexed files.
By using B Tree performance of multi-level indexed files system can
improved.
By using B+ Tree performance of multi-level indexed files system
can improved.
Both are type of search tree
IF YOU HAVE ANY QUERY PLEASE COMMENT DOWN BELOW
PLEASE GIVE A THUMBS UP