Big data consists of huge amount of unstructured data, which is difficult to analyze. To manage this data, the authors present a simple and efficient hashing scheme that they have applied in social network data, which is a major source of big data. They have used a novel and theoretically easy to understand scheme of chaining to remove collision, which may be the outcome while storing these giant data. Their main contribution is that they have created dimensions of all the data stored to control format of data display. They have also described the design and implementation of an efficient algorithm to conduct search operation on these data.