Performance Metrics for Decision Support in Big Data vs. Traditional RDBMS Tools & Technologies
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2016, Vol 7, Issue 11
Abstract
In IT industry research communities and data scientists have observed that Big Data has challenged the legacy of solutions. ‘Big Data’ term used for any collection of data or data sets which is so large and complex and difficult to process and manage using traditional data processing applications and existing Relational Data Base Management Systems (RDBMSs). In Big Data; the most important challenges include analysis, capture, curation, search, sharing, storage, transfer, visualization and privacy. As the data increases in various dimensions with various features like structured, semi structured and unstructured with high velocity, high volume and high variety; the RDBMSs face another fold of challenges to be studied and analyzed. Due to the aforesaid limitations of RDBMSs, data scientists and information managers forced to rethink about alternative solutions for handling such data with 3Vs.Initially research study focused on to develop an intelligent base for decision makers so that alternative solutions for long term suitable solutions and handle the data and information with 3Vs can be designed. In this research attempts has been made to analyze the feature based capabilities of RDBMSs and then performance experimentation, observation and analysis has been done with Big Data handling tools and technologies. The features considered for scientific observation and analysis were resource consumption, execution time, on demand scalability, maximum data size, structure of the data, data visualization, and ease of deployment, cost and security. Finally the research provides a decision support metrics for decision makers in selecting the appropriate tool or technology based on the nature of data to be handled in the target organizations.
Authors and Affiliations
Alazar Baharu, Durga Prasad Sharma
Keywords
Related Articles
- EP ID EP396951
- DOI 10.14569/IJACSA.2016.071128
- Views 82
- Downloads 0
Most Valuable Player Algorithm for Solving Minimum Vertex Cover Problem
Minimum Vertex Cover Problem (MVCP) is a combinatorial optimization problem that is utilized to formulate multiple real-life applications. Owing to this fact, abundant research has been undertaken to discover valuable MV...
A Personalized Hybrid Recommendation Procedure for Internet Shopping Support
Lately, recommender systems (RS) have offered a remarkable breakthrough to users. It lessens the user time cost thereby delivering faster and better results. After purchasing a product there are recommendations according...
A Comparative Study of Stereovision Algorithms
Stereo vision has been and continues to be one of the most researched domains of computer vision, having many applications, among them, allowing the depth extraction of a scene. This paper provides a comparative study of...
Vague Set Theory for Profit Pattern and Decision Making in Uncertain Data
Problem of decision making, especially in financial issues is a crucial task in every business. Profit Pattern mining hit the target but this job is found very difficult when it is depends on the imprecise and vague envi...
Fault-Tolerant Fusion Algorithm of Trajectory and Attitude of Spacecraft Based on Multi-Station Measurement Data
Aiming at the practical situation that the navigation processes of spacecrafts usually rely on several different kinds of tracking equipments which track the spacecraft by turns, a series of new outlier-tolerant fusion a...