全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用：99美元
投递稿件

查看量下载量

相关文章

映秀-北川断裂的地表破裂与变形特征

四川汶川Ms8.0级地震北川-映秀地表破裂的复杂现象

尿蛋白膜保存法与直接冻存法的成本效益分析

映秀—北川断裂带沿线崩滑体分布规律浅析

宜昌台观测资料质量与映震效果对比研究

一种小型站鱼类一一白缘映的染色体核型研究

“5.12汶川地震”映秀极震区地震滑坡编目分析

一种简单的无尾两栖类早期胚胎细胞染色体的制备法1)

无 氧 条 件 下ＴｉＯ２ 薄 膜 界 面 光 催 化 反 应 的ＸＰＳ 研 究

汶川MS8.0地震断层映秀—南坝段的活动方式、形变特征及其形成机制

汶川MS8.0地震断层映秀—南坝段的活动方式、形变特征及其形成机制

更多...

基于数据映射算法的近邻存储方法研究
Research on the Method of Neighbour Storage Based on Data Mapping Algorithm

DOI: 10.12677/HJDM.2016.64016, PP. 139-147

Keywords: P2P，分布式存储，近邻存储，相关性查询
P2P, Distributed-Memory, Neighbor Data Storage, Relevant Query

Full-Text   Cite this paper   Add to My Lib

Abstract:

随着互联网的高速发展，如何有效地存储海量数据以提供高效的查询效率是一项亟待解决的关键问题。然而，采用现有的例如Chord和P2P等分布式存储方案，面对高维、海量的存储数据时，数据存储规模和开销不断增加，造成存储效率以及数据查询效率不断降低。本文提出了基于数据映射算法的近邻存储方法。实验表明当进行相关性查询时，提高了查询准确率，同时显著降低了网络带宽。
With the high-speed development of the Internet, processing of high-dimensional and massive amounts of data for querying is a key challenge. However, for the traditional distributed storage scheme, such as the P2P network and Chord, the data storage capacity and the switch overheads from the nodes are increasing, thus decreasing the storage efficiency and data query efficiency continuously. In this article, a neighbor data storage approach based on data mapping algorithm is proposed. The experiment results show that the proposed method can improve the query accuracy rate and reduce network bandwidth through relevant query.

References

[1]  Svendsen, H.B. and Erickson, M. (2016) System and Method for Identifying Music Content in a P2P Real Time Rec-ommendation Network. http://xueshu.baidu.com/s?wd=paperuri%3A%2879696d30bc0034769b511c43747ca6ab%29&filter=sc_long_sign&tn=SE_xueshusource_2kduw22v&sc_vurl=http%3A%2F%2Fwww.freepatentsonline.com%2F8422490.html&ie=utf-8&sc_us=3331819690017585512
[2]  Li, P., Wang, M., Cheng, J., et al. (2013) Spectral Hashing with Semantically Consistent Graph for Image Indexing. IEEE Transactions on Multimedia, 15, 141-152.
http://dx.doi.org/10.1109/TMM.2012.2199970
[3]  彭良睿, 李学明. 一种基于树型结构的P2P系统高维数据检索方法[J]. 计算机应用研究, 2015, 32(3): 842-845.
[4]  Yao, C., Bu, J.J., Wu, C.X., Chen, G.C., et al. (2013) Semi-Supervised Spectral Hashing for Fast Similarity Search. Neurocomputing, 101, 52-58.
http://dx.doi.org/10.1016/j.neucom.2012.06.035
[5]  Washbourne, L. (2015) A Survey of P2P Network Security. arXiv:1504.01358
[6]  Shao, J., Wu, F., Ouyang, C., et al. (2012) Sparse Spectral Hashing. Pattern Recognition Letters, 33, 271-277.
http://dx.doi.org/10.1016/j.patrec.2011.10.018
[7]  Zou, F., Liu, C., Ling, H., et al. (2013) Least Square Regu-larized Spectral Hashing for Similarity Search. Signal Processing, 93, 2265-2273.
http://dx.doi.org/10.1016/j.sigpro.2012.05.033
[8]  Stoica, I., Morris, R., Karger, D., et al. (2001) Chord: A Sclable Peer-to-Peer Lookup Service for Internet Applications. Proceedings of the 2001 SIGCOMM, 31, 149-160.
http://dx.doi.org/10.1145/383059.383071

Full-Text

comments powered by Disqus