Efficient Implementation of Dynamic Array SystemUsing MapReduce Framework

In recent years managing Big Data is a big challenge. Big data has huge volume, variety of format and its volume increases at a very high velocity. Traditional data structures fail to handle these types of data. Moreover Big Data storage scheme is very expensive. So some efficient scheme is needed. In this paper we show the application of dynamic Extendible Array for Big data storage. It is an efficient scheme which has better performance over other approaches. We used MapReduce concept to distribute the data in heterogeneous environment. The data that belongs to different dimensions are distributed to different machines to do the operations efficiently. The basic operations including insertion, deletion, update and retrieval of various types namely point key query, single key query and range key query are performed. Moreover the dynamic extension of the structure without reorganizing the existing data is performed. Experimental results are well studied. We used cheap commodity machines for our implementation.