for the ‘‘Quorum reads’’, which requires the system to check for inconsistency
across multiple replicas before reading. Surely the second
option causes some amount of latency. Difference in latency
between these two options can be a factor of four or more [22].
(7) Scalability and Complexity Analysis.
Fig. 1 shows the NoSQL Scalability Complexity relationship.
As shown in the figure Key-value NoSQL are suitable for data
intensive applications, while the Graph databases (Non Aggregate)
NoSQL are best fit for applications dealing with complex data. It
is also evident from the figure that, the Document (Aggregate oriented)
NoSQL is the most suitable NoSQL databases having a good
balance of ‘‘Data Complexity’’ and ‘‘Data Size’’. Since 90% of use
cases are much below the ‘‘Data Size’’ supported by the entire
NoSQL database, still most of the application is perfectly running
with conventional RDBMS.
(8) NRW Analysis.
NRW (Node, Read, Write) analysis is used to analyze the
characteristics of distributed database how they will trade off
Consistency, Read and Write performance