A large scale key-value store based on range-key skip graph and its applications

Authors:
Susumu Takeuchi;Jun Shinomiya;Toru Shiraki;Yoshimasa Ishi;Yuuichi Teranishi;Mikio Yoshida;Shinji Shimojo
Affiliations:
National Institute of Information and Communications Technology, Japan;School of Engineering, Osaka University, Japan;Graduate School of Information Science and Technology, Osaka University, Japan;Graduate School of Information Science and Technology, Osaka University, Japan;National Institute of Information and Communications Technology, Japan;BBR Inc., Japan;National Institute of Information and Communications Technology, Japan
Venue:
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Year:
2010

Citing 4
Cited 0

Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Skip Lists: A Probabilistic Alternative to Balanced Trees

WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Skip graphs

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

An overlay network called Range-key Skip Graph (RKSG) has been proposed that can perform range-to-range search on peer-to-peer network. In this paper, we propose a large scale key-value store realized on RKSG, which is possible to scale-out a database with range query. Moreover, applications that utilize the store are implemented and will be demonstrated through private PlanetLab on JGN2plus.