DOI QR코드

DOI QR Code

Improving Database System Performance by Applying NoSQL

  • Received : 2013.08.29
  • Accepted : 2014.03.20
  • Published : 2014.09.30

Abstract

Internet accessibility has been growing due to the diffusion of smartphones in today's society. Therefore, people can generate data anywhere and are confronted with the challenge that they should process a large amount of data. Since the appearance of relational database management system (RDBMS), most of the recent information systems are built by utilizing it. RDBMS uses foreign-keys to avoid data duplication. The transactions in the database use attributes, such as atomicity, consistency, isolation, durability (ACID), which ensures that data integrity and processing results are stably managed. The characteristic of RDBMS is that there is high data reliability. However, this results in performance degradation. Meanwhile, from among these information systems, some systems only require high-performance rather than high reliability. In this case, if we only consider performance, the use of NoSQL provides many advantages. It is possible to reduce the maintenance cost of the information system that continues to increase in the use of open source software based NoSQL. And has a huge advantage that is easy to use NoSQL. Therefore, in this study, we prove that the leverage of NoSQL will ensure high performance than RDBMS by applying NoSQL to database systems that implement RDBMS.

Keywords

References

  1. E. F. Codd, "A relational model of data for large shared data banks," Communications of the ACM, vol. 13, no. 6, pp. 377-387, Jun. 1970. https://doi.org/10.1145/362384.362685
  2. E. Hewitt, Cassandra: The Definitive Guide. Beijing: O'Reilly, 2011.
  3. J. Gantz and D. Reinsel (2011, June). "Extracting value from chaos," IDC iView [Online]. Available: http://www.emc.com/collateral/analyst-reports/idc-extracting-value-from-chaos-ar.pdf.
  4. C. J. Date, An Introduction to Database Systems, 8th ed. Boston, MA: Pearson/Addison Wesley, 2004, pp. 466-499.
  5. F. Chang, J. Dean, S. Ghemawat, W. C. Hsieh, D. A. Wallach, M. Burrows, T. Chandra, A. Fikes, and R. E. Gruber, "Bigtable: a distributed storage system for structured data," in Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation, Seattle, WA, November 6-8, 2006, p. 15.
  6. G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels, "Dynamo: Amazon's highly available key-value store," in Proceedings of 21st ACM SIGOPS Symposium on Operating Systems Principles, Stevenson, WA, October 14-17, 2007, pp. 205-220.
  7. A. Lakshman and P. Malik, "Cassandra: a decentralized structured storage system," ACM SIGOPS Operating Systems Review, vol. 44, no. 2, pp. 35-40, Apr. 2010.
  8. S. Gilbert and N. Lynch, "Brewer's conjecture and the feasibility of consistent, available, partitiontolerant web services," SIGACT News, vol. 33, no. 2, pp. 51-59, Jun. 2002. https://doi.org/10.1145/564585.564601

Cited by

  1. xStore : Federated temporal query processing for large scale RDF triples on a cloud environment vol.256, 2017, https://doi.org/10.1016/j.neucom.2016.03.116