Parallelizing the Data Cube Dalhousie University并行数据立方体达尔豪西大学.pptVIP

下载本文档

8
0
约1.08万字
约 26页
2017-03-08 发布于上海
举报
版权申诉

Parallelizing the Data Cube Dalhousie University并行数据立方体达尔豪西大学.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Parallelizing the Data Cube Dalhousie University并行数据立方体达尔豪西大学

Parallelizing the Data Cube PhD Oral Defence Todd Eavis July 23, 2003 Motivation for Parallel, Relational OLAP Core Algorithms and Methods Primary Systems Contributions Experimental Evaluation and Results Conclusions and Future Work Why study OLAP and the Data Cube? On-line Analytical Processing: the foundation for a range of essential business applications sales and marketing analysis, planning and budgeting 4 billion dollar industry by 2005 Data Cube: a core OLAP construct, first proposed in 1996 by Gray et al [GBLP], that supports sophisticated multi-dimensional data analysis Relevance to the Research Community? Results of Citeseer queries: OLAP: 797 papers Data Cube: 362 papers Our interest: Data Cube Generation and Querying Scale of OLAP Data Warehouses Average size of production data warehouses currently 700 GB [/Olap Report] Expected to reach 4 TB by 2004 1/3 currently = 50 GB. In two years, this number will drop to just 6% Biggest data warehouses growing by a factor of 20 [Winter Report] Biggest expected to exceed 100 TB within 2 years Our Interest: Exploiting Parallel Algorithms Fundamental Design Alternatives MOLAP (Multi-dimensional OLAP) Materialize data cube as a multi-dimensional array In theory: implicit indexing. In practice: hybrid schemes for sparse and dense regions Best for dense, low-dimensional spaces ROLAP (Relational OLAP) Store data as relational tables Requires an explicit multi-dimensional index Scales well to higher dimensions and higher cardinalities Our Interest: Highly Scalable ROLAP model Computing the Full Cube in Parallel Small number of previous projects [GC, LHL, MM, NWY] Speedup quite limited Our approach: Parallel Pipesort [DEHR2, DER3] Model 2d views as a “task graph” Create “Scan Pipelines” [AADG] as Minimum Cost Spanning Tree using O(dn(m + nlogn)) bipartite matching (n = nodes, m = edges) Partition task graph into sub-trees with O(p3d + p2d) augmented k-min-max [BSP] and distribute sub-trees to p processors Use ov