摘要
提出了一系列Graph的OLAP模型和算法,实现了以Graph数据为中心度量的OLAP操作.主要贡献包括:(1)提出了面向Graph的数据仓库概念模型——双星模型;(2)提出了Graph的数据立方概念和创建过程;(3)设计了信息维聚集算法I-OLAPing;(4)设计了拓扑维聚集算法T-OLAPing;(5)实现了Graph OLAP的原型系统Graph OLAPer1.0.实验结果表明,设计和实现的Graph OLAPing算法及原型系统Graph OLAPer1.0能够有效地进行科研合作网分析.
This paper presents a series of models and algorithms to implement OLAPing on graph data. The major contributions include (1) proposing a graph-oriented data warehouse model, called a double star model, (2) proposing the concept of graph data cube and its building algorithm, (3) designing an informational OLAPing algorithm, I-OLAPing, (4) designing topological dimensional OLAPing algorithm, T-OLAPing, and (5) building a Graph OLAPing prototype, Graph OLAPerl.0, based on the proposed approaches. Experimental results show that the Graph OLAPing algorithms designed and implemented in this paper, together with Graph OLAPing prototype, Graph OLAPerl.0 can work effectively on Co-Author Networks.
出处
《软件学报》
EI
CSCD
北大核心
2011年第2期258-268,共11页
Journal of Software
基金
国家自然科学基金(600773169)
国家科技支撑计划(2006BAI05A01)
高等学校博士学科点基金(20090181120064)