SDEC2011 nStore : a new approach for data distribution and scalability

  • 1,617 views
Uploaded on

As Personalized Web Environment (PWE) and SNS is growing, NHN has developed a social networking service called NAVER.me which pulls user's data, including event alarms, messages from emails, comments …

As Personalized Web Environment (PWE) and SNS is growing, NHN has developed a social networking service called NAVER.me which pulls user's data, including event alarms, messages from emails, comments made on any blog or at any social service linked to naver.com, and displays everything at one place in a user friendly way. This personalized service operates enormous data, thus requires scalability and high-availability. At the same time it is necessary to keep support for legacy codes in linked applications, and provide the compatible interface for backend processing system which uses RDBMS. For this purpose, NHN has developed a new distributed storage system called nStore, which takes advantage of both RDBMS and NoSQL. As a result, nStore has the following characteristics:
During the load balancing process, the data is distributed by a unit called the Container group.
Faster than a traditional RDBMS, but slower than pure memory caching systems like Arcus.
Provides unlimited capacity to serve as a permanent storage space.
As nStore uses RDBMS as a base storage engine, it supports SQL like query language (nSQL).

http://sdec.kr/

More in: Technology
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
  • +_+!!
    Are you sure you want to
    Your message goes here
No Downloads

Views

Total Views
1,617
On Slideshare
0
From Embeds
0
Number of Embeds
0

Actions

Shares
Downloads
176
Comments
1
Likes
4

Embeds 0

No embeds

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
    No notes for slide

Transcript

  • 1.                ⓒ  
  • 2.      SNS/CLOUD 
  • 3.                                                                          
  • 4.       §   •         §    •          §   •               
  • 5.    §        §     §       §    §    
  • 6.                                                          
  • 7.                      
  • 8.   à  à à à                                             
  • 9.     □  □   □     □  □     §      §     §       §        □   
  • 10.   □     §       §       §     §    §    §                                                       
  • 11.                                                 
  • 12.                    □     §         §       •          •      §          
  • 13.   □                             □   nsql = (dml | ddl) [“;”] ; ddl = create | alter | drop ; dml = insert | delete | update | select ; §                   •           
  • 14.                          
  • 15.      §    §  ­–           §  ­–        §     •     §         §         §      §        §     §    §   •   •   •    •    §     
  • 16.    
  • 17.                                                      nStore    
  • 18.     Insert 25000   20000   15000   10000   5000   nStore 0   
  • 19.     Read 9000   8000   7000   6000   5000   4000   3000   2000   1000   nStore 0   
  • 20.     Read/Update 6000   5000   4000   3000   2000   1000   nStore 0   
  • 21.     Read/Insert 6000   5000   4000   3000   2000   1000   nStore 0   
  • 22.                        
  • 23.