东北大学学报(自然科学版) ›› 2005, Vol. 26 ›› Issue (10): 960-963.DOI: -

• 论著 • 上一篇    下一篇

基于场地约束的PDMS查询优化技术

王斌;杨晓春;王国仁;张恩德   

  1. 东北大学信息科学与工程学院;东北大学信息科学与工程学院;东北大学信息科学与工程学院;东北大学信息科学与工程学院 辽宁沈阳110004
  • 收稿日期:2013-06-24 修回日期:2013-06-24 出版日期:2005-10-15 发布日期:2013-06-24
  • 通讯作者: Wang, B.
  • 作者简介:-
  • 基金资助:
    国家自然科学基金资助项目(60473074);;

Query optimization based on site constraints in PDMS

Wang, Bin (1); Yang, Xiao-Chun (1); Wang, Guo-Ren (1); Zhang, En-De (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-24 Revised:2013-06-24 Online:2005-10-15 Published:2013-06-24
  • Contact: Wang, B.
  • About author:-
  • Supported by:
    -

摘要: 基于视图的查询求解是解决PDMS(Peer Data Management Systems)中数据共享的一个重要手段.基于成熟的Datalog技术,设计了基于场地约束的Datalog扩展技术用于解决PDMS环境下的查询优化问题.研究在数据密集型和逻辑上紧耦合的PDMS中存在的查询优化问题,提出了PDMS视图定义语言PView,局部约束和分布式约束的定义、及基于视图与约束的查询重写的优化方案,并给出性能分析.测试结果证明,基于约束的查询重写优化算法AffixC可以显著地提高查询处理效率,适用于逻辑上具有紧耦合关系的信息集成处理.

关键词: PDMS, 场地约束, 视图, 查询重写, Datalog

Abstract: Query rewriting technique based on views is an important solution to sharing data in PDMS (peer data management system). An extended Datalog technique based on peer constraints is proposed to optimize query processing in PDMS. In particular, the query optimization problem in data-intension and logical tight-coupled PDMS environment is studied. The definition language for PDMS views, PView and the definitions of local and global peer constraints are proposed, as well as the query rewriting optimization algorithms. A cost model is given to evaluate-the queries in PDMS. Experimental results show that the proposed approach outperforms other view-based query rewriting approaches.

中图分类号: