Research on Database Schema Comparison of Relational Databases and Key-Value Stores

Abstract:

With the rapid development of Internet technology, the management capacity of traditional relational databases becomes relatively inefficient when facing the access and processing of big data. As a kind of non-relational databases, the key-value stores, with its high scalability, provide an efficient solution to the problem. This article introduces the concept and features of Key-Value stores, and followed by the comparison with the traditional relational databases, and an example is illustrated to explain its typical application and finally the existing problems of Key-Value stores are summarized.

• Periodical: Advanced Materials Research (Volumes 1049-1050)
• Pages: 1860-1863
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.1049-1050.1860
• Online since: October 2014
• Authors: Peng Zhou, Mei Li, Jing Huang, Hua Fang
• Keywords: Key-Value, Relational Database

References

[1] GiuseppeDeCandia, Deniz Hastorun，Madan Jampani：Dynamo: Amazon' s Highly Available Key-value Store.

[2] Fay Chang, Jeffrey Dean, Sanjay Ghemawa：Bigtable: ADistributed Storage System for Structured Data.

[3] Rick Cattell: High Performance Scalable Data Stores, April 27, (2010).

[4] Thomas M. Connolly, Carolyn E. Begg：Database Systems, Pearson Education, (2004).

[5] Rick Cattell: High Performance Scalable Data Stores, April 27, (2010).

[6] Codd E F. A relational model of data for large shared data banks[J]. Communications of the ACM, 1970, 13(6): 377-387.

DOI: 10.1145/362384.362685