期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

DHT网络中的多维复杂查询处理方法研究 被引量：3

Multi-dimensional Complex Query Processing over DHT
下载PDF
导出
摘要 DHT网络中的高级查询处理是关系其应用领域拓展的重要问题,也是学术界与工业界共同关注的研究热点。基于Kademlia协议提出一种DHT网络中的多维复杂查询处理方法,其索引结构考虑了用户的查询偏好,使同类数据的存储位置具有相关性,同时巧妙地利用了Kademlia路由表的特点与更新方法,避免了索引维护过产生额外的通信开销,并且通过多点存储、沿路缓存改善了系统的容错性与负载均衡性。分析和实验表明,该方法以O(logN)的路由跳数复杂度和较低的开销实现了资源的多维复杂查询。 Advanced query processing is a critical problem for the application of DHT networks.It has attracted much attention from both academic and industrial community.This paper presented a technique for multi-dimensional complex query processing based on Kademlia.It takes user＇s preference into consideration so that homogeneous data is relevantly indexed.Furthermore,the index maintenance brings no extra communication cost by piggybacking on routing table recovery,besides the advantages in resilience and load balance.The analysis and simulation results show that it implements multi-dimensional complex query processing with O（logN） query length and low cost.
作者 徐强 孙乐昌 刘京菊 赵亭 蔡铭
机构地区 中国人民解放军电子工程学院网络工程系 中国人民解放军 中国人民解放军
出处 《计算机科学》 CSCD 北大核心 2011年第9期82-86,共5页 Computer Science
基金 国家自然科学基金(60972161) 军队国防科技项目 解放军电子工程学院博士生创新基金资助
关键词 多维查询 复杂查询 分布式哈希表 对等网络 Multi-dimensional query Complex query Distributed hash table Peer-to-peer
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献16

  • 1Doudane S, Agoulmine N. Enhancing the P2P protocols to support advanced multi-keyword queries [J].Lecture Notes in Computer Science, 2006,3976: 630-641. 被引量：1
  • 2Shen D R,Shao Y C,Nie T Z,et al. HilbertChord:a P2P framework for service resources management [J]. Lecture Notes in Computer Science, 2008,5036 : 331-342. 被引量：1
  • 3Shu Y, Ooi C B, Tan K. Supporting multi-dimensional range queries in peer-to-peer systems[C]//Proc, of the 5th IEEE International Conference on Peer-to Peer Computing. Washington, 2005 : 173-180. 被引量：1
  • 4刘德辉,周宁,尹刚,王怀民,邹鹏.QFMA：一种支持负载均衡的多属性资源定位方法[J].计算机学报,2008,31(8):1376-1382. 被引量：9
  • 5Cai M, Frank M, Chen J, et al. MAAN: a multi-attribute addressable network for grid information servies [J]. Journal of Grid Computing, 2004,2 (1) : 3-14. 被引量：1
  • 6Matteo V, Christophe D, Ernst B. A Walkable Kademlia Network for Virtual Worlds[C]//Proc. of the 28^th IEEE International Conference on Computer Communications Workshops. Piscataway, 2009. 被引量：1
  • 7Tang Y Z,Xu J L, Zhou S G, et al. m-LIGHT: Indexing Multi- dimensional Data over DHTs[C]ffProe. of the 29^th IEEE International Conference on Distributed Computing Systems. Montreal, 2009 : 191-198. 被引量：1
  • 8Schutt T, Schintke F, Reinefeld A. Range queries on structured overlay networks [J]. Computer Communications, 2008,31: 280-291. 被引量：1
  • 9张蓉,钱卫宁,周傲英.一种支持多维数据范围查询的对等计算索引框架[J].计算机研究与发展,2009,46(4):529-540. 被引量：6
  • 10Zhou M Q, Zhang R, Qian Q N, et al. Gchord: indexing for multi- attribute query in P2P system with low maintenance cost [J]. Lecture Notes in Computer Science, 2010,4443 : 55-66. 被引量：1

二级参考文献52

  • 1徐林昊,钱卫宁,周傲英.非结构化对等计算系统中多维范围搜索[J].软件学报,2007,18(6):1443-1455. 被引量：3
  • 2Ratnasamy S, Francis P, Handley M, et al. A scalable eontent-addressable network [C]//Proc of ACM Annual Conf of the Special Interest Group on Data Communication. New York: ACM, 2001:161-172 被引量：1
  • 3Bentley J L. Multidimensional binary search trees used for associative searching [J]. Communications of the ACM, 1975, 18(9): 509-517 被引量：1
  • 4Hinrichs K, Nievergelt J. The grid file: A data structure designed to support proximity queries on spatial objects [C] //Proc of the Int Workshop on Graphtheoretic Concepts in Computer Science. New York: ACM, 1983:100-113 被引量：1
  • 5Tang Chunqiang, Xu Zhichen, Dwarkadas S. Peer-to-peer information retrieval using self-organizing semantic overlay networks [C] //Proc of the ACM SIGCOMM 2003, New York: ACM, 2003:175-186 被引量：1
  • 6Andrzejak A, Xu Zhichen. Scalable, efficient range queries for grid information services [C] //Proc of IEEE P2P. Piscataway, NJ : IEEE, 2002 : 33-40 被引量：1
  • 7Sahin O D, Gupta A, Agrawal D, et al. A peer-to-peer framework for caching range queries [C] //Proc of ICDE. Piscataway, NJ: IEEE, 2004:165-176 被引量：1
  • 8Shu Yanfeng, Tan Klan-Lee, Zhou Aoying. Adapting the content native space for load balanced indexing [G] //LNCS 3367 : Proc of DBISP2P. Berlin:Springer, 2004 : 122-135 被引量：1
  • 9Lee J, Lee H, Kang S, et al. CISS: An efficient object clustering framework for DHT-based peer-to-peer applications[C] //Proc of DBISP2P. Berlin: Springer, 2004: 215-229 被引量：1
  • 10Schmidt C, Parashar M. Flexible information discovery in decentralized distributed systems [C] //Proc of HPDC-12. Piseataway, NJ: IEEE, 2003:226-235 被引量：1

共引文献20

同被引文献44

  • 1ZHAO Peng,HUANG Ting-lei, LIU Cai-xia, et al. Research of P2P architecture based on cloud computing [ C]//Proc of Intelligent Com- puting and Integrated Systems. 2010: 652-655. 被引量：1
  • 2HUANG Li-can. Semantic P2P networks : future architecture of cloud computing [ C]//Porc of the 2nd International Conference on Networ- king and Distributed Computing. 2011:336-339. 被引量：1
  • 3HIDALGO N, ROSES E, ARANTES L,et al. Optimized range que- ries for large scale networks[ C ]//Proc of the 26th IEEE International Conference on Advanced Information Networking and applications. 2012:438-445. 被引量：1
  • 4TANG Yu-zhe, XU Jian-liang, ZHOU Shui-geng, et al. A light- weight multidimensional index for complex queries over DHTs [ J ]. IEEE Trans on Parallel and Distributed Systems, 2011, 22 (12) : 2046-2054. 被引量：1
  • 5STOICA I, MORRIS R, KARGER D,et al. Chord: a scalable peer- to-peer lookup service for Internet applications [ J ]. IEEE/ACM Trans on Networking, 2003, 11 ( 1 ) : 17-32. 被引量：1
  • 6ROWSTRON A, DRUSCHEL P. Pastry: scalable distributed object location and routing for large scale peer-to-peer systems [ C ]//Proc of ACM International Conference on Distributed Systems. 2001: 329- 350. 被引量：1
  • 7RATNASAMY S,FRANCIS P,HANDLEY M,et al. A scalable con- tent-addressable network[ J ]. ACM SIGCOMM Computer Commu- nication Review,2001,31 (4) : 161-172. 被引量：1
  • 8GUPTA I, BIRMAN K, LNGA P. Kelips: building an efficient and stable P2P DHT through increased memory and background overhead [ C ]//Proc of the 2rid International Workshop on Peer-to-Peer Sys- tem. 2003 : 160-169. 被引量：1
  • 9GUPTA A, LISKOV B, RODRIGUSE R. One-hop lookups for peer-to peer overlays [ C ]//Proc of the 1 st Symposium on Networked Systems Design and Implementation. 2004 : 113-126. 被引量：1
  • 10BHARAMBE A R, AGRAWAL M, SESHAN S. Mercury:supporting scalable multi-attribute range queries [ C ]//Proc of SIGCOM. 2004 : 353-366. 被引量：1

引证文献3

二级引证文献3

计算机科学
2011年 第9期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部