Cache and Consistency in NOSQL
In recent years a new type of database (NOSQL) has emerged in the field of persistence. June 2009, a global gathering of NOSQL Movement triggered the fuse of “database revolution, Non-relational database has now become an extremely popular new areas, NOSQL aims to solve the needs of high concurrent read-write, efficient mass data storage and access, database scalability and high availability. In these large-scale concurrent systems, cluster cache and data consistency become the focus of attention. This article proposes a fast and effective approach to estimate the solution of the data consistency. We use node split and consistent hashing techniques to reduce the servers load by analyzing the request from the client. Each server node can be divided into a set of virtual nodes, which located in a ring. The complexity caused by the size of the set is determined by the target system. Through physical node split, we can reduce the cache miss rate. In order to reduce the complexity of the algorithm of consistency hashing, we will introduce afootball game example.
persistence NOSQL clustercache consistency algorithm
Peng Xiang Ruichun Hou Zhiming Zhou
Information Engineering Center Ocean University of China Qingdao China
国际会议
成都
英文
117-120
2010-07-07（万方平台首次上网日期，不代表论文的发表时间）