A NoSQL Framework Based on the DHT

Zheng Hong Peng; Xiao Ming Luo

doi:10.4028/www.scientific.net/AMR.366.202

Paper Titles

Experimental Research on Ultrasound Cast-Rolling Lead Alloy Strip
p.181

The Effects of the Process Parameters on Micro-Hardness for Electroless Ni-P-Nano SiC Composite Plating
p.187

The Analytical Model and Flow Parameter Influencing the Internal Pressure Distribution of Elbow Pipe
p.192

Effect of Color Shading-Nets on the Growth and Physiological Characteristics of Chieh-Qua Seedling
p.197

A NoSQL Framework Based on the DHT
p.202

Optimization Design of Cross-Section of Prestressed Steel-Concrete Composite Box Girder
p.207

Generation of Respiratory Flow Having Fractal Signal Feature
p.211

Near Infrared Quantum Cutting for Solar Cells in CeF₃:Yb³⁺ Nanophosphors
p.215

Complex Generalized Basis Reduction Assisted Successive Interference Cancellation Detection for SCBLAST Systems
p.219

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 366A NoSQL Framework Based on the DHT

A NoSQL Framework Based on the DHT

Abstract:

In light of the current development of NoSQL(Non-relational database) and DHT [1] (Distributed Hash Table )is features, this article first proposes the adoption of B + tree as a DHT data structure, which can reduce the path length when the users find the corresponding node address, make the search length maintain the tree height and support the search of the data range. This article secondly advices to use the control node to manage and monitor DHT data distribution of NoSQL, reducing the burden of DHT routing and improving the efficiency of data search. Experimental results show that such a framework can greatly improve the routing efficiency and speed up the user access speed.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 366)

Pages:

202-206

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.366.202

Citation:

Cite this paper

Online since:

October 2011

Authors:

Zheng Hong Peng, Xiao Ming Luo

Keywords:

B + Tree, Control Node, DHT, NoSQL, Search

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Karger, D., Lehman, E., Leighton, T., Panigrahy, R., Levine,M., and Lewin, D. 1997. Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the Twenty-Ninth Annual ACM Symposium on theory of Computing(1997).

DOI: 10.1145/258533.258660

Google Scholar

[2] NoSQL http: /en. wikipedia. org/wiki/NoSQL.

Google Scholar

[3] Giuseppe de Candia, Deniz Hastorun, Madan Jampani, Gunavardhan Kakulapati, Alex Pilchin, Swaminathan Sivasubramanian, Peter Vosshall, and Werner Vogels. Dynamo: amazon~Os highly available key-value store. In Proceedings of twenty-_rst ACM SIGOPS symposium on Operating systems principles(2007).

DOI: 10.1145/1294261.1294281

Google Scholar

[4] Avinash Lakshman and Prashant Malik. Cassandra - a decentralizedstructured storage system. In LADIS '09.

Google Scholar

[5] Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C. Hsieh, Deborah A. Wallach, Michael Burrows, Tushar Chandra, AndrewFikes, and Robert Gruber. Bigtable: A Distributed Storage Systemfor Structured Data. In OSDI '06, p.205–218.

DOI: 10.1145/1365815.1365816

Google Scholar

[6] Ion Stoica , Robert Morris , David Karger , M. Frans Kaashoek , Hari Balakrishnan, 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(2001).

DOI: 10.1145/383059.383071

Google Scholar