메뉴 건너뛰기




Volumn , Issue , 2012, Pages 482-487

Non-structure data storage technology-An discussion

Author keywords

Key value; Non structure; NoSQL

Indexed keywords

COMPLEX QUERIES; DATA STORAGE; DISTRIBUTION MECHANISM; KEY/VALUE; NON-STRUCTURE; NOSQL; PROGRAMMING MODELS; STRUCTURED DATA;

EID: 84864058924     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIS.2012.76     Document Type: Conference Paper
Times cited : (14)

References (15)
  • 1
    • 84864049647 scopus 로고    scopus 로고
    • Guopeng, (in Chinese). Mechanical Industry Press
    • Guopeng, Cassandra Practice (in Chinese). Mechanical Industry Press, 2011, pp. 2-3.
    • (2011) Cassandra Practice , pp. 2-3
  • 2
    • 74049113467 scopus 로고    scopus 로고
    • (in Chinese). Tsinghua University Press
    • Tom White, Hadoop: The Definitive Guide (in Chinese). Tsinghua University Press, 2010., pp.13-14.
    • (2010) Hadoop: The Definitive Guide , pp. 13-14
    • White, T.1
  • 3
    • 84864026443 scopus 로고    scopus 로고
    • http://www.mongodb.org.
  • 4
    • 84864052023 scopus 로고    scopus 로고
    • http://www.searchtb.com/2011/01/understanding-hbase.html.
  • 5
    • 84864052024 scopus 로고    scopus 로고
    • http://www.tech126.com/category/mongodb-2/.
  • 8
    • 84055170086 scopus 로고    scopus 로고
    • (in Chinese), Electronics Industry Press
    • Liu Peng. Cloud Computing (in Chinese), Electronics Industry Press, 2010, pp: 72-73.
    • (2010) Cloud Computing , pp. 72-73
    • Peng, L.1
  • 10
    • 84864049423 scopus 로고    scopus 로고
    • Brewer's conjecture and the feasibility of consistent, avaliable
    • June, ACM New York, NY, USA
    • Seth Gibert. Nancy Lynch. Brewer's Conjecture and the Feasibility of Consistent, Avaliable, Partition-Tolearant Web Services. ACM SIGACT News. Volume 33 Issue 2, June 2002. ACM New York, NY, USA.
    • (2002) Partition-Tolearant Web Services. ACM SIGACT News , vol.33 , Issue.2
    • Lynch, S.Gibert.N.1
  • 12
    • 84864049649 scopus 로고    scopus 로고
    • http://hadoop.apache.org/common/docs/cur-rent/hdfs/-design.html.
  • 15
    • 37549003336 scopus 로고    scopus 로고
    • Map reduce: Simple data processing on large clusters
    • January
    • Jeffrey Dean and Sanjay Ghemawat. MapReduce: Simple Data Processing on Large Clusters. Communications of the ACM. Volume 51 Issue 1, January 2008.
    • (2008) Communications of the ACM , vol.51 , Issue.1
    • Dean, J.1    Ghemawat, S.2


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