Correctness of the routing algorithm for distributed key-value store based on order preserving linear hashing and skip graph
| Title | Correctness of the routing algorithm for distributed key-value store based on order preserving linear hashing and skip graph |
| Publication Type | Conference Paper |
| Year of Publication | 2017 |
| Authors | Higuchi, K., Yoshida, M., Tsuji, T., Miyamoto, N. |
| Conference Name | 2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) |
| ISBN Number | 978-1-5090-5504-3 |
| Keywords | Arrays, compositionality, Distributed databases, distributed key-value store, graph theory, hash algorithms, hop reduction, Limiting, linear hashing, order preserving linear hashing, overlay network, overlay networks, Partitioning algorithms, Peer-to-peer computing, pubcrawl, query forwarding, Resiliency, Routing, routing algorithm, skip graph, telecommunication network routing, uniform routing table |
| Abstract | In this paper, the correctness of the routing algorithm for the distributed key-value store based on order preserving linear hashing and Skip Graph is proved. 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 forwarding. By using these detours, the number of hops for the query forwarding is reduced. |
| URL | http://ieeexplore.ieee.org/document/8022762/ |
| DOI | 10.1109/SNPD.2017.8022762 |
| Citation Key | higuchi_correctness_2017 |
- overlay networks
- uniform routing table
- telecommunication network routing
- skip graph
- routing algorithm
- Routing
- Resiliency
- query forwarding
- pubcrawl
- Peer-to-peer computing
- Partitioning algorithms
- arrays
- overlay network
- order preserving linear hashing
- linear hashing
- Limiting
- hop reduction
- hash algorithms
- graph theory
- distributed key-value store
- Distributed databases
- Compositionality