Cache共享架构下的多属性范围查询  

Cache Sharing Framework for Multi-Attribute Range Query

作　　者：海沫[1] 王秀利[1] 

机构地区：[1]中央财经大学信息学院,北京100081

出　　处：《小型微型计算机系统》2010年第5期840-844,共5页Journal of Chinese Computer Systems

基　　金：中央财经大学"211"工程三期建设项目资助;中央财经大学学科建设基金资助;国家自然科学基金项目(70672050;60673162)资助

摘　　要：结构化对等网络的多属性范围查询研究有两类:一类通过空间填充曲线或在每个属性维上复制信息以降维;另一类通过构建分布式索引树以实现多属性查询.这两类解析每个查询的跳数和消息数依赖于范围大小和节点个数.前者属性值改变时产生大量的消息;后者导致高的维护开销.提出cache共享架构下的多属性范围查询.仿真实验显示和SWORD相比,跳数和消息数均减少;属性值改变时,所需消息数减少;查询准确率下降不到5%.维护开销低.Current research about multi-attribute range queries on structured P2P networks can be divided into two categories：One is to descend dimensions by space filling curve or replicating information at each attribute dimension; the other is to implement multi-attribute query by constructing distributed index tree. Both the number of hops and the number of messages to resolve each query of these two categories depend on the size of range as well as the number of peers. The former generates many messages when attributes change; the latter brings about a high maintenance cost of distributed index tree. We propose a cache sharing architecture for multiple-attribute range query. Simulations show compared with SWORD,both the average number of hops and the average number of messages decrease; when attributes change,the number of messages needed is reduced; the query precision decreases by not larger than 5%. The maintenance cost is low.

关 键 词：多属性范围查询 结构化对等网络 查询准确率 维护开销 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]