首页> 外文会议> >Combining hierarchy encoding and pre-grouping: intelligent grouping in star join processing
【24h】

Combining hierarchy encoding and pre-grouping: intelligent grouping in star join processing

机译:组合层次编码和预分组:星型加入处理中的智能分组

获取原文

摘要

Efficient star query processing is crucial for a performant data warehouse (DW) implementation and much work is available on physical optimization (e.g., indexing and schema design) and logical optimization (e.g., pre-aggregated materialized views with query rewriting). One important step in the query processing phase is, however, still a bottleneck: the residual join of results from the fact table with the dimension tables in combination with grouping and aggregation. This phase typically consumes between 50% and 80% of the overall processing time. In typical DW scenarios pre-grouping methods only have a limited effect as the grouping is usually specified on the hierarchy levels of the dimension tables and not on the fact table itself. We suggest a combination of hierarchical clustering and pre-grouping as we have implemented in the relational DBMS Transbase. Exploiting hierarchy semantics for the pre-grouping of fact table result tuples is several times faster than conventional query processing. The reason for this is that hierarchical pre-grouping reduces the number of join operations significantly. With this method even queries covering a large part of the fact table can be executed within a time span acceptable for interactive query processing.
机译:高效的星形查询处理对于高性能数据仓库(DW)的实现至关重要,并且在物理优化(例如索引和模式设计)和逻辑优化(例如具有查询重写的预聚合的物化视图)方面有大量工作可用。但是,查询处理阶段中的一个重要步骤仍然是瓶颈:将事实表的结果与维度表的残留连接结合在一起,进行分组和聚合。此阶段通常消耗整个处理时间的50%至80%。在典型的DW方案中,预分组方法的效果有限,因为分组通常是在维表的层次结构级别而不是事实表本身上指定的。我们建议将分层聚类和预分组结合起来,就像我们在关系DBMS Transbase中实现的那样。为事实表结果元组进行预分组利用层​​次结构语义比常规查询处理快几倍。这样做的原因是,分层预分组大大减少了连接操作的数量。使用这种方法,甚至可以覆盖事实表的大部分查询,也可以在交互式查询处理可接受的时间范围内执行。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号