Abstract
In this paper, a routing algorithm for the distributed key-value store based on order preserving linear hashing and Skip Graph is proposed. In this system, data are divided by linear hashing and Skip Graph is used for overlay network. The routing table of this system is very uniform. Then, short detours can exist in the route of message forwarding. The proposed algorithm detects such detours and changes the route. By using the proposed algorithm, reduction of the number of hops are expected. From experimental results, it proved that the proposed algorithm is effective.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aspnes, J., Shah, G.: Skip graphs. ACM Trans. Algorithms 3(4):37:1–37:25 (2007)
DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshal, P., Vogels, W.: Dynamo : Amazon’s highly available key-value store. ACM SIGOPS Oper. Syst. Rev. 41(6), 205–220 (2007)
Higuchi, K., Tsuji, T.: A distributed linear hashing enabling efficient retrieval for range queries. Proc. IEEE SMC 2010, 838–842 (2010)
Ishi, Y., Teranishi, Y., Yoshida, M., Takeuchi, S., Shimojo, S., Nishio, S.: Range-key extensions of the skip graph. In: Proceedings of IEEE 2010 Global Communications Conference (IEEE GLOBECOM 2010), pp. 1–6 (2010)
Ishi, Y., Teranishi, Y., Yoshida, M., Takeuchi, S.: An implementation of large scale distributed key-value store with range search feature based on range-key skip graph. J. IPSJ 53(7), 1850–1862 (2012)
Karger, D.R., Lehman, E., Leighton, F.T., Panigrahy, R., Levine, M.S., Lewin, D.: Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web. In: ACM Symposium on Theory of Computing, pp. 654–663 (1997)
Konishi, Y., Yoshida, M., Takeuchi, S., Teranishi, Y., Harumoto, K., Shimojo, S.: An extension of skip graph to store multiple keys on single node. J. IPSJ 49(9), 3223–3233 (2008)
Lakshman, A., Malik, P.: Cassandra—a decentralized structured storage system. ACM SIGOPS Oper. Syst. Rev. 42(2), 35–40 (2010)
Litwin, W.: Linear hashing: new tool for file and table addressing. In: Proceedings of 6th Conference on Very Large DataBases, pp. 212–223 (1980)
Maymounkov, P., Mazieres, D.: Kademlia: a peer-to-peer information system based on the XOR metric. In: 1st International Workshop on Peer Systems (IPTPS’02), pp. 53–65 (2002)
Robinson, J.T.: Order preserving linear hashing using dynamic key statics. In: Proceedings of the 5th ACM SIGACT-SIGMOD symposium on principles of database systems, pp. 91–99 (1985)
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM 31(4), 149–160 (2001)
Yoshida, M., Higuchi, K., Tsuji, T.: An implementation and evaluation of distributed key-value store based on order preserving linear hashing and skip graph. J. IEICE J98-D(5), 742–750
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Higuchi, K., Yoshida, M., Miyamoto, N., Tsuji, T. (2016). A Routing Algorithm for Distributed Key-Value Store Based on Order Preserving Linear Hashing and Skip Graph. In: Lee, R. (eds) Applied Computing & Information Technology. Studies in Computational Intelligence, vol 619. Springer, Cham. https://doi.org/10.1007/978-3-319-26396-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-26396-0_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26394-6
Online ISBN: 978-3-319-26396-0
eBook Packages: EngineeringEngineering (R0)