Towards an Efficient Maintenance of Address Space Overflow for Array Based Storage System

Array based storage and retrieval systems are demanded in many high dimensional systems like Big data for their easy maintenance. However, the lack of scalability of the conventional approaches degrades with the dynamic size of data sets as they entail reallocation in order to preserve expanded data velocity. To maintain the velocity of data, the storage system must be scalable enough by allowing subjective expansion on the boundary of array dimension. Again, for an array based storage system, if the number of dimension and length of each dimension of the array is very high then the required address space overflows and hence it is impossible to allocate such a big array in the memory. The index array offers a dynamic storage scheme for preserving expanded data velocity by employing indices for each dimension. In this paper we demonstrate a scalable array storage scheme that divides expanded data size into segments. Hence it is able to maintain overflow and can improve the storage utilization than the conventional one. The system converts the n dimensions of the array into 2 dimensions, hence it involves only 2 indices which ensures lower cost of index computation and higher data locality.