期刊文献+

一种支持多维数据范围查询的对等计算索引框架 被引量:6

A P2P Framework for Supporting Multi-Dimensional Range Query
下载PDF
导出
摘要 如何有效地支持多维数据范围查询是传统数据管理领域的研究热点之一.但是,在大规模分布式系统中,这仍然是一个具有挑战性的研究工作.VBI-tree是一个对等计算环境下基于平衡树的索引架构,在该架构上可以实现集中式环境下的多种支持多维数据索引的层次化树结构,例如R-tree,X-tree和M-tree等.VBI-tree设计的查询算法保证查询可以从树的任意位置开始,而不是像集中式环境下层次化树结构那样采用从树的根节点开始查询的方法,从而成功地避免了根节点引起的系统性能瓶颈问题.对于有N个节点的网络,索引方法可以保证查询效率是O(log N).VBI-tree提出了基于AVL-tree旋转的网络重构负载均衡策略可以有效地均衡负载.另外,在数据操作频繁的情况下,为了提高索引的性能,在VBI-tree上建立特殊的祖先-子孙链接形成VBI*-tree的结构.通过使用祖先-子孙链接,可保证对于相关查询区域的探索尽量发生在同层节点之间,而不是一直往根节点方向发送,从而减轻上层节点的查询负担,并且显著地降低了更新代价.模拟实验验证了提出的方法的有效性. How to efficiently support multi-dimensional range search is one of the research hotspots in the traditional data management area. The design and implementation of multi-dimensional range query processing in large-scale distributed systems, however, remains to be a great challenge. VBI tree is a peer-to-peer indexing framework based on a balanced tree structure overlay and it can support any kind of multi-dimensional hierarchical tree structures such as R-tree, X-tree, and M-tree to be implemented in peer-to-peer computing environment. VBI-tree designs the search algorithms which can start from any position or any node instead of the root node used in the centralized hierarchical tree structures, thus successfully avoiding the performance bottleneck problem introduced by the root node. Specifically, in a network with N nodes, it guarantees that queries can be answered within O(logN) hops. It takes network restructuring based on AVL-tree rotation method as the load balancing strategy, which can balance work load efficiently. Additionally, a succinct structure of VBI^*-tree is provided by setting up special ancestor-descendant links when facing a large number of data operations, which can improve the indexing performance. By using such new links, it is ensured that the related area checking to the queries will happen among the nodes of the same level to the greatest extent instead of sending checking requests directly to high level nodes, thereby reducing the load of high level nodes and also system updating cost. Experimental results validate the efficiency and effectiveness of the proposed approach.
出处 《计算机研究与发展》 EI CSCD 北大核心 2009年第4期529-540,共12页 Journal of Computer Research and Development
基金 国家自然科学基金项目(60496325 60673137 60673134) 国家"八六三"高技术研究发展计划基金项目(2006AA01Z103)~~
关键词 多维数据 范围查询 对等计算 架构 分布式系统 multi-dimensional data range query peer-to-peer computing framework distributed system
  • 相关文献

参考文献18

  • 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

二级参考文献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. 被引量:1
  • 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. 被引量:1
  • 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. 被引量:1
  • 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. 被引量:1
  • 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. 被引量:1
  • 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. 被引量:1
  • 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. 被引量:1
  • 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. 被引量:1
  • 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. 被引量:1
  • 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. 被引量:1

共引文献2

同被引文献116

引证文献6

二级引证文献29

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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