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

非结构化对等计算系统中多维范围搜索 被引量：3

Multi-Dimensional Range Search in Unstructured Peer-to-Peer Systems
在线阅读 下载PDF
导出
摘要 对等计算数据管理中的一个重要问题是如何有效地支持多维数据空间上的相似性搜索.现有的非结构化对等计算数据共享系统仅支持简单的查询处理方法,即匹配查询处理.将近似技术和路由索引结合在一起,设计了一种简单、有效的索引结构EVARI(扩展近似向量路由索引).利用EVARI,每个节点不仅可以在本地共享的数据集上处理范围查询,而且还可以将查询转发给最有希望获得查询结果的邻居节点.为了建立EVARI,每个节点使用空间划分技术概括本地的共享内容,并与邻居节点交换概要信息.而且,每个节点都可以重新配置自己的邻居节点,使得相关节点位置相互邻近,优化了系统资源配置,提升了系统性能.仿真实验证明了该方法的良好性能. It is an important problem to efficiently support similarity search for multi-dimensional data spaces in peer-to-peer （P2P） data management environment. Current unstructured P2P data sharing systems provide only a very rudimentary facility in query processing, i.e., matching-based query processing. This paper therefore presents a simple, yet effective index structure called EVARI （extended vector approximation routing index） to address the problem of multi-dimensional range search in unstructured P2P systems, by means of both data approximation and routing index techniques. With the aid of the EVARI, each peer can not only process range queries with its local dataset, but also route queries to promising peers with the desired data objects. In the proposed scheme, each peer summarizes its local content using space-partitioning technique, and exchanges the summarized information with neighboring peers to construct the EVARI. Furthermore, each peer can reconfigure its neighboring peers to keep the relevant peers nearby so as to optimize system resource configuration and improve system performance. Extensive experiments show the good performance of the proposed approach.
作者 徐林昊 钱卫宁 周傲英
机构地区 复旦大学计算机科学与工程系
出处 《软件学报》 EI CSCD 北大核心 2007年第6期1443-1455,共13页 Journal of Software
基金 国家自然科学基金Nos.60496325 60496327 国家教育部博士点基金No.20030246023 上海市科委重大项目No.03DZ15028 新加坡资讯通信发展管理局基金~~
关键词 对等计算 范围搜索 近似向量 路由索引 查询路由 wpeer-to-peer computing range search vector approximation routing index query routing
分类号 TP311 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献23

  • 1Gribble SD,Halevy AY,Ives ZG,Rodrig M,Suciu D.What can database do for peer-to-peer? In:Mecca G,Siméon J,eds.Proc.of the Int'l Workshop on the Web and Databases.ACM Press,2001.31-36.
  • 2Bernstein P,Giunchiglia F,Kementsietsidis A,Mylopoulos J,Serafini L,Zaihrayeu I.Data management for peer-to-peer computing:A vision.In:Fernandez MF,Papakonstantinou Y,eds.Proc.of the Int'l Workshop on the Web and Databases.Wisconsin:ACM Press,2002.89-94.
  • 3Chawathe Y,Ratnasamy S,Breslau L,Lanham N,Shenker S.Making Gnutella-like p2p systems scalable.In:Feldmann A,Zitterbart M,Crowcroft J,Wetherall D,eds.Proc.of the ACM SIGCOMM Conf.on Applications,Technologies,Architectures,and Protocols for Computer Communication.Karlsruhe:ACM Press,2003.407-418.
  • 4Lü Q,Cao P,Cohen E,Li K,Shenker S.Search and replication in unstructured peer-to-peer networks.In:Proc.Of the Int'l Conf.On Measurements and Modeling of Computer Systems.ACM Press,2002.84-95.
  • 5Crespo A,Garcia-Molina H.Routing indices for peer-to-peer systems.In:Sivilotti P,ed.Proc.of the Int'l Conf.on Distributed Computing Systems.Arizona:IEEE Computer Society,2002.23-34.
  • 6Yang B,Garcia-Molina H.Improving search in peer-to-peer networks.In:Sivilotti P,ed.Proc.of the Int'l Conf.on Distributed Computing Systems.Arizona:IEEE Computer Society,2002.5-14.
  • 7Halevy AY,Ives ZG,Suciu D,Tatarinov I.Schema mediation in peer data management systems.In:Dayal U,Ramamritham K,Vijayaraman TM,eds.Proc.of the Int'l Conf.on Data Engineering.Bangalore:IEEE Computer Society,2003.505-516.
  • 8Kementsietsidis A,Arenas M,Miller RJ.Mapping data in peer-to-peer systems:Semantics and algorithmic issues.In:Halevy AY,Ives ZG,Doan AH,eds.Proc.of the ACM SIGMOD Int'l Conf.on Management of Data.ACM Press,2003.325-336.
  • 9Huebsch R,Hellerstein JM,Lanham N,Loo BT,Shenker S.Querying the Internet with PIER.In:Freytag JC,Lockemann PC,Abiteboul S,Carey MJ,Selinger PG,Heuer A,eds.Proc.of the Int'l Conf.on Very Large Data Bases.Berlin:Morgan Kaufmann Publishers,2003.321-332.
  • 10Sahin OD,Gupta A,Agrawal D,Abbadi AE.A peer-to-peer framework for caching ranges queries.In:Proc.of the Int'l Conf.on Data Engineering.Boston:IEEE Computer Society,2004.165-176.

同被引文献54

  • 1朱承,张维明,刘忠,徐振宁.一种基于资源类型的网格资源发现方法[J].计算机研究与发展,2004,41(12):2156-2163. 被引量：15
  • 2夏启志,谢高岗,闵应骅,李忠诚.IS-P2P:一种基于索引的结构化P2P网络模型[J].计算机学报,2006,29(4):602-610. 被引量：39
  • 3徐林昊,周傲英.结构化对等计算系统中的高维相似搜索[J].计算机学报,2006,29(11):1982-1994. 被引量：6
  • 4Ratnasamy 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
  • 5Bentley J L. Multidimensional binary search trees used for associative searching [J]. Communications of the ACM, 1975, 18(9): 509-517
  • 6Hinrichs 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
  • 7Tang 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
  • 8Andrzejak A, Xu Zhichen. Scalable, efficient range queries for grid information services [C] //Proc of IEEE P2P. Piscataway, NJ : IEEE, 2002 : 33-40
  • 9Sahin 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
  • 10Shu 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

引证文献3

二级引证文献9

软件学报
2007年 第6期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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