A New Improved Vertical Partitioning Scheme for Non Relational Databases Using Greedy Method

Abstract: Non Relational database is a database used to store large amounts of data. Improving the performance of a database system is one of the key research issues. As publications of context are rising, a new vertical partitioning scheme is proposed to handle better data load and to improve performance for non relational databases. In the proposed work, an algorithm is developed by concatenating the vertical partitioning scheme and greedy algorithm to enhance the performance of data load by altering the vertical partitioning method and to check out the time performance by using the greedy algorithm. In this paper, different performance parameters named data load, time in terms of execution time, communication time are analyzed against data size and nodes using non relational databases so that we get better results from existing algorithm.

Keywords: Non Relational Databases, Vertical Partitioning Scheme, performance, Greedy Algorithm.