期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种P2P网络环境下的OLAP模式匹配方案 被引量：3

OLAP patten matching method in P2P network
下载PDF
导出
摘要 P2P网络环境下,每个OLAP服务器上都有一套完整的数据解决方案。当OLAP服务器之间进行协同工作时,如何将Da-taCube中的模式进行匹配以完成联合OLAP查询成为一个关键问题。在对DataCube中的维及维层次链进行了定义后,提出了一种维层次链的匹配规则,能较好地优化P2P网络环境下执行联合OLAP查询。 A peer-to-peer（P2P） OLAP network system consists of OLAP servers which maintaining full autonomy over its own data resources.When data exchange between OLAP servers occurs,how to mapping the pattern of different of data cube in order to execute union OLAP query, is become a key issue.This article provides a mapping rule based on Dimension Hierarchical Chain（DHC） which has been defined before.This rule can produce a global optimum execute plan about union OLAP query.
作者 杨科华 魏莉
机构地区 湖南大学计算机与通信学院
出处 《计算机工程与应用》 CSCD 北大核心 2008年第9期162-164,共3页 Computer Engineering and Applications
基金 广东省产学研项目(No.2007A090302079)
关键词 联机分析处理 数据立方体 点对点网络 维层次链 OLAP data cube P2P network Dimension Hierarchical Chain
分类号 TP311 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献2

二级参考文献5

  • 1Ho C, Agrawal R, Megiddo N, et al. Range queriesin OLAP data cubes[A]. Proceedings of International Conference on Management of Data[C]. Tucson,USA,1997.73 - 88.
  • 2Geffner S, Agrawal D, Abbadi A El, et al. Relative prefix sums: An efficient approach for querying dynamic OLAP data cubes[A]. Proceedings of International Conference on Data Engineering[C]. Sydney,.Australia, 1999. 328 - 335.
  • 3Geffner S, Agrawal D, Abbadi A El. The dynamicdata cubes[A]. Proceedings of International Conference on Extending Database Technology[C]. Konstanz, Germany, 2000. 237 - 253.
  • 4Liang W, Hui W, Orlowska M E. Range queries in dynamic OLAP data cubes [J]. Data & Knowledge Engineering, 2000,34 : 21 - 38.
  • 5Beckmann N, Kriegel H, Schneider R, et al. The R -tree: An efficient and robust access method for points and rectangles[A]. Proceedings of ACM SIG-MOD Int'l Conference on Management of Data[C].New Jersey, USA, 1990. 322 -331.

同被引文献13

  • 1谭义红,陈治平,林亚平.基于兴趣挖掘的非结构化P2P搜索机制研究与实现[J].计算机应用,2006,26(5):1164-1166. 被引量：11
  • 2Tatarinov I,Halevy A.Efficient query reformulation in peer-data management systems[C]//Proceedings of the ACM SIGMOD In- ternational Conference, Paris, France, 2004: 539-550.
  • 3Luan Hao, Tsang D H K.A simulation study of block manage- ment in BitTorrent[C]//Proceeding of the 1st International Con- ference on Scalable Information Systems.Hong Kong, China: [s.n.], 2006.
  • 4Guo Lei,Chen Songqing,Xiao Zhen,et al.A performance study of BitTorrent like peer-to-peer systems[J].IEEE Journal on Selected Areas in Communications, 2007,25( 1 ) : 155-169.
  • 5Espil M M, Vaisman A A.Aggregate queries in peer-to-peer OLAP[C]//DOLAP' 04, November 12-13, Washington DC, USA, 2004:102-111.
  • 6Kalnis P,Ng W S,Ooi B C, et aLAn adaptive peer-to-peer net- work for distributed caching of OLAP results[C]//Proceedings of the ACM SIGMOD International Conference, USA, 2002: 25-36.
  • 7Luan H, Tsang D H K.A simulation study of block manage- ment in BitTorrent[C]//Proceeding of the 1st International Con- ference on Scalable Information Systems.Hong Kong,China: [s.n.], 2006.
  • 8Espil M M, Vaisman A A.Aggregate queries in peer-to-peer L ' " O AP[C]//DOLAP 04, Washington, DC, USA, 2004: 102-111.
  • 9Kalnis P,Ng W S, Ooi B C, et al.An adaptive peer-to-peer net-work for distributed caching of OLAP results[C]//Proceedings of the ACM SIGMOD International Conference, USA, 2002: 25-36.
  • 10Cuzzocrea A, Furfaro F.Enabling OLAP' in mobile environments via intelligent data cube compression techniques[J].Joumal of In- telligent Information Systems,2009,33(2):95-143.

引证文献3

二级引证文献3

计算机工程与应用
2008年 第9期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部