Using a distributed quadtree index in peer-to-peer networks

作     者：Tanin, Egemen Harwood, Aaron Samet, Hanan 

作者机构：Univ Melbourne Dept Comp Sci & Software Engn NICTA Victoria Lab Melbourne Vic 3010 Australia Univ Maryland Inst Adv Comp Studies Ctr Automat Res Dept Comp Sci College Pk MD 20742 USA 

出 版 物：《VLDB JOURNAL》 (国际大型数据库杂志)

年 卷 期：2007年第16卷第2期

页      面：165-178页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：quadtrees spatial data structures distributed data structures peer-to-peer networks 

摘      要：Peer-to-peer (P2P) networks have become a powerful means for online data exchange. Currently, users are primarily utilizing these networks to perform exact-match queries and retrieve complete files. However, future more data intensive applications, such as P2P auction networks, P2P job-search networks, P2P multiplayer games, will require the capability to respond to more complex queries such as range queries involving numerous data types including those that have a spatial component. In this paper, a distributed quadtree index that adapts the MX-CIF quadtree is described that enables more powerful accesses to data in P2P networks. This index has been implemented for various prototype P2P applications and results of experiments are presented. Our index is easy to use, scalable, and exhibits good load-balancing properties. Similar indices can be constructed for various multidimensional data types with both spatial and non-spatial components.