International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 151 - Number 10 |
Year of Publication: 2016 |
Authors: Omkar Patinge, Vineet Karkhanis, Amey Barapatre |
10.5120/ijca2016911921 |
Omkar Patinge, Vineet Karkhanis, Amey Barapatre . Inadequacies of CAP Theorem. International Journal of Computer Applications. 151, 10 ( Oct 2016), 18-20. DOI=10.5120/ijca2016911921
In today's technical world, we are witnessing a strong and increasing desire to scale systems to successfully complete workloads in a reasonable time frame. As a result of this scaling, an additional penalty of complexity is incurred in the system. In this paper, we have explained the tradeoffs that have to be taken into consideration while designing databases using CAP theorem and the consequences of this tradeoff. Problems of the CAP theorem itself and its limitations are discussed. CAP theorem which was able to meet the demands, back when it was proposed, can't catch up to the current requirements. The problem lies in the open-ended definitions of CAP which are subject to interpretations. PACELC is an alternative to CAP and is able to overcome some of its current problems. PACELC builds on the CAP theorem and it goes one step ahead of CAP by stating that a trade-off also exists, this time between latency and consistency, provides a more complete portrayal of the potential consistency tradeoffs for distributed systems.