中文摘要：

大数据与传统的数据仓库技术相结合产生了大数据实时分析处理需要（volume＋velocity），它要求大数据背景下的数据仓库不能过多地依赖物化、索引等高存储代价的优化技术，而要提高实时处理能力来应对大数据分析中数据量大、查询分析复杂等特点．这些查询分析操作一般表现为在事实表和维表之间连接操作的基础上对结果集上进行分组聚集等操作．因此，表连接和分组聚集操作是ROLAP（relationalOLAP）性能的两个重要决定因素．研究了新硬件平台下针对大规模数据的OLAP查询的性能，设计新的列存储OLAP查询执行引擎CDDTA-MMDB（columnar direct dimensional tuple access—main memory databasequeryexecutionengine．直接维表元组访问的内存数据库查询执行引擎）．基于三元组的物化策略，使得CDDTA．MMDB能够减少内存列存储模型上表连接操作访问基表和中间数据结构的次数．首先，CDDTA—MMDB将查询分解为作用在维表和事实表上的子查询，如果只涉及过滤操作，子查询将生成（代理键，布尔值）二元组；否则，子查询生成（代理键，关键字，值）三元组．然后，只需一趟扫描事实表，利用事实表的外键映射函数直接定位相应三元组或者二元组，完成相应的过滤、连接或聚集操作．CDDTA．MMDB充分考虑了内存列存储数据库的设计原则，尽量减少随机内存访问．实验结果表明：CDDTA．MMDB是高效的，与具代表性的列存储数据库相比，比MonetDB5．5快2．5倍，比C．store的invisibleioin快5倍；并且，CDDTA—MMDB在多核处理器上具有线性加速比．

英文摘要：

Integrating big data and traditional data warehouse （DW） techniques bring demand for real-time big data analysis. The new demand means DW can not depend too much on the optimization such as materialization and indexing which consume large space, but instead needs to enhance ability of real-time analysis to handle big data analysis which usually issues complex queries on huge data volumes. Those queries usually consist in applying group or aggregation operator on the join result between fact table and dimension table（s）. The join and group operation often are the bottle-necks for performance improvement. This paper studies the OLAP performance under the new hardware platform and big data environment, and develops a new OLAP query execution engine in columnar storage, called CDDTA-MMDB （columnar direct dimensional tuple access for main memory database query execution engine）. The optimized materialization makes CDDTA-MMDB reduce access to base table and intermediate data structure during join procedure. CDDTA- MMDB decomposes the query into sub-queries on the fact table and dimension table respectively. If the sub-query on dimension table only serves as filter, it will produce the binary tuple （surrogate,Boolean_value）; otherwise, it will produce the triplet in the form of （surrogate,key,value）. Thus, by just scanning the fact table one-pass and utilizing the mapping function of foreign keys in fact table to directly access the binary tuples or triplets, the executor can accomplish the join, filter and group operations. Consideration is fully placed on the design principle for the main-memory columnar database. Experimental results show that the system is efficient and can be 2.5 times faster than MonetDB 5.5 and 5 times faster than invisible join used by C-store. Moreover, it scales linearly on multi-core processors.