메뉴 건너뛰기




Volumn , Issue , 2011, Pages 541-547

Security issues in NoSQL databases

Author keywords

Cassandra; MongoDB; NoSQL; Security

Indexed keywords

CASSANDRA; DISTRIBUTED DATABASE; HIGH AVAILABILITY; MONGODB; NOSQL; RELATIONAL DATABASE; SECURITY; SECURITY FEATURES; SECURITY ISSUES; SENSITIVE DATAS;

EID: 84856163132     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TrustCom.2011.70     Document Type: Conference Paper
Times cited : (124)

References (11)
  • 2
    • 1542640153 scopus 로고    scopus 로고
    • Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
    • June [Online]. Available
    • S. Gilbert and N. Lynch, "Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services," SIGACT News, vol. 33, pp. 51-59, June 2002. [Online]. Available: http://doi.acm.org/10.1145/ 564585.564601
    • (2002) SIGACT News , vol.33 , pp. 51-59
    • Gilbert, S.1    Lynch, N.2
  • 5
    • 77955933052 scopus 로고    scopus 로고
    • Cassandra: A decentralized structured storage system
    • April [Online]. Available
    • A. Lakshman and P. Malik, "Cassandra: a decentralized structured storage system," SIGOPS Oper. Syst. Rev., vol. 44, pp. 35-40, April 2010. [Online]. Available: http://doi.acm.org/10.1145/1773912.1773922
    • (2010) SIGOPS Oper. Syst. Rev. , vol.44 , pp. 35-40
    • Lakshman, A.1    Malik, P.2
  • 6
    • 84856135460 scopus 로고    scopus 로고
    • Facebook. [Online]. Available
    • Facebook. Facebook. [Online]. Available: http://www.facebook.com/
  • 7
    • 84856144901 scopus 로고    scopus 로고
    • Mongodb. [Online]. Available
    • MongoDB. Mongodb. [Online]. Available: http://www.mongodb.org/
  • 8
    • 0030704545 scopus 로고    scopus 로고
    • Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web
    • ser. STOC '97. New York, NY, USA: ACM, [Online]. Available
    • D. Karger, E. Lehman, T. Leighton, R. Panigrahy, M. Levine, and D. Lewin, "Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the world wide web," in Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, ser. STOC '97. New York, NY, USA: ACM, 1997, pp. 654-663. [Online]. Available: http://doi.acm.org/ 10.1145/258533.258660
    • (1997) Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing , pp. 654-663
    • Karger, D.1    Lehman, E.2    Leighton, T.3    Panigrahy, R.4    Levine, M.5    Lewin, D.6
  • 11
    • 0003602325 scopus 로고
    • MIT Laboratory for Computer Science and RSA Data Security, Inc, Tech. Rep., April [Online]. Available
    • R. Rivest, "The md5 message-digest algorithm. RFC 1321," MIT Laboratory for Computer Science and RSA Data Security, Inc, Tech. Rep., April 1992. [Online]. Available: https://tools.ietf.org/html/rfc1321
    • (1992) The Md5 Message-digest Algorithm. RFC 1321
    • Rivest, R.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.