Multidimensional Data Querying on Tree-Structured Overlay

作     者：XU Lizhen WANG Shiyuan XU Lizhen, WANG Shiyuan School of Computer Science and Engineering, Southeast University, Nanjing 210096, Jiangsu, China

作者机构：School of Computer Science and Engineering SoutheastUniversity Nanjing 210096 Jiangsu China 

出 版 物：《Wuhan University Journal of Natural Sciences》 (武汉大学学报（自然科学英文版）)

年 卷 期：2006年第11卷第5期

页      面：1367-1372页

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 

基　　金：Supported by the Natural Science Foundation ofJiangsu Province(BG2004034) 

主　　题：range query skyline query P2P indexing multi-dimensional data partition 

摘      要：Multidimensional data query has been gaining much interest in database research communities in recent years, yet many of the existing studies focus mainly on ten tralized systems. A solution to querying in Peer-to-Peer（P2P） environment was proposed to achieve both low processing cost in terms of the number of peers accessed and search messages and balanced query loads among peers. The system is based on a balanced tree structured P2P network. By partitioning the query space intelligently, the amount of query forwarding is effectively controlled, and the number of peers involved and search messages are also limited. Dynamic load balancing can be achieved during space partitioning and query resolving. Extensive experiments confirm the effectiveness and scalability of our algorithms on P2P networks.