Sigma-Tree:Design of a Data Structure for Storing File Data Allocation Map in a Distributed File System

The growth of the volume of data is enormous and so is the computational requirement for processing data. With the fast pace of growth of data volume, the file system design also needs to evolve fast to meet the various requirements of processing data. A significant problem in file IO is the ability to locate and access blocks or objects of a file that constitute the data. We present, in this paper, a design of a block/object allocation methodology which can handle different types of file blocks/objects. We explain the design of the methodology and introduce a new data structure that can handle different types of file IO with ease and efficiency.