top button
Flag Notify
    Connect to us
      Facebook Login
      Site Registration Why to Join

Facebook Login
Site Registration

Which data structure is used to store a file into memory and why?

+2 votes
Which data structure is used to store a file into memory and why?
posted Nov 1, 2013 by Meenal Mishra

Share this question
Facebook Share Button Twitter Share Button Google+ Share Button LinkedIn Share Button Multiple Social Share Button

1 Answer

+2 votes

Usually Interval Trees, RB Trees, B Tries, Heaps, Bitmaps etc are used to store data.

Generic Cache for multiple modules where complete file data is not available at same time. File is stored in extents. Interval trees, Extent trees and B trees can be used. Here data may be stored in the disk but how to access data (metadata) is stored in data structure.

Read Ahead Buffers: To speed up applications performance a predictive algorithm uses pattern to read data before requested. In this case also extents can be used.

Images might be stored in bitmap with other ds to keep a count of redundant information.

Most use cases are related to high Disk IO latency and data redundancy elimination.

answer Nov 2, 2013 by Pankaj Agarwal
Contact Us
+91 9880187415
#280, 3rd floor, 5th Main
6th Sector, HSR Layout
Karnataka INDIA.