P2P环境下数据管理系统上的Top-k查询  

Top-k Query over Data Management System in P2P Network

作　　者：何盈捷[1] 文继军[1] 冯月利[1] 王珊[1] 

机构地区：[1]中国人民大学信息学院,北京100872

出　　处：《计算机科学》2005年第10期89-94,共6页Computer Science

基　　金：国家自然科学基金(60473069);国家自然科学基金(60496325);北京市科技计划重点项目(H0301300600ll);863专项(2003AA4Z3030)的支持

摘　　要：目前大多数P2P系统只提供文件的共享,缺乏数据管理能力。基于关系数据库上的关键搜索,本文提出了一种在P2P环境下共享数据库的新框架,其中每个节点上的数据库被看成是一个文档集,用户不用考虑数据库的模式结构信念,简化了不同节点数据库模式间的映射过程,能更好地适应P2P的分散和动态特性。将基于直方图的分层Top-k查询算法扩展到P2P环境下的数据库管理系统上,文档集和数据库的查询被统一起来,一致对待。在查询处理期间,直方图可以自动更新,同时根据查询结果,邻居节点可以自调整,具有自适应性。实验结果表明,基于关键词的数据库共享突破了传统的数据库共享模式,简化了数据访问方式,而基于直方图的Top-k查询算法提高了查询效率。Most of existing peer-to-peer （P2P）systems only provide coarsely granular file-level sharing and lack of data management ability. A new framework of database sharing in P2P network is presented, which is based on keyword search over relational databases. In the framework, database on each peer can be seen as a text collection, users needn＇t care about the schema information of the database, which greatly simplifies the schema mapping between different peers, and is more suitable for the decentralization and dynamicity of P2P network. Hierarchical top-k query processing algorithm based on histogram is applied in the data management system in P2P network to do （op-k query, which unifies the query over text collections and relational databases. During the query processing, histogram can be updated automatically by using the returned top-k results, and the neighborhood of the peer can be self reconfigured to let the nodes containing the real top-k results to be its neighbors. Experiment results show that database sharing based on the keyword searching breaks through the traditional database sharing schema and simplifies the data accessing method, and top-k query based on histogram improves the search efficiency.

关 键 词：P2P 数据库共享 关键词查询 TOP-K查询 直方图 邻居节点自调整 P2P系统 查询算法 数据管理系统 环境 关系数据库 数据库管理系统 共享数据库 数据库共享 模式结构 

分 类 号：TP393.4[自动化与计算机技术—计算机应用技术] TP311.1[自动化与计算机技术—计算机科学与技术]