关键词: 数据密集计算, MapReduce, Dwarf, 数据立方

Abstract: In the data-intensive computing, this paper proposes an efficient parallel Dwarf data cube construction algorithm using MapReduce framework. The algorithm divides the traditional Dwarf cube into several independent sub-Dwarf cubes, and then achieves parallel building, querying and updating of Dwarf cube by using MapReduce framework. Finally, experiments show that the parallel Dwarf algorithm not only combines the parallelism and scalability of MapReduce framework, but also combines the high compression and the self-indexing of the data of Dwarf cube structure. The parallel Dwarf algorithm not only achieves the high compression ratio for data storage and provides the rapid construction and incremental update operation, but also overcomes the disadvantage that there is no index in MapReduce mechanisms, to achieve the fast query on the data cube.

Key words: data-intensive computing, MapReduce, Dwarf, data cube