Cache-Based Aggregate Query Shipping: An Efficient Scheme of Distributed OLAP Query Processing
文献类型：期刊论文
| 作者 | Hua-Ming Liao (廖华明); Guo-Shun Pei (裴国顺) |
| 刊名 | Journal of Computer Science and Technology
 |
| 出版日期 | 2008 |
| 卷号 | 23期号:6页码:905-915 |
| 关键词 | Distributed System Query Optimization Reusability Query Shipping Hybrid View Caching |
| 英文摘要 | Our study introduces a novel distributed query plan refinement phase in an enhanced architecture of distributed query processing engine (DQPE). Query plan refinement generates potentially efficient distributed query plan by reusable aggregate query shipping (RAQS) approach. The approach improves response time at the cost of pre-processing time. If the overheads could not be compensated by query results reusage, RAQS is no more favorable. Therefore a global cost estimation model is employed to get proper operators: RR\_Agg, R\_Agg, or R\_Scan. For the purpose of reusing results of queries with aggregate function in distributed query processing, a multi-level hybrid view caching (HVC) scheme is introduced. The scheme retains the advantages of partial match and aggregate query results caching. By our solution, evaluations with distributed TPC-H queries show significant improvement on average response time. |
| 语种 | 英语 |
| 公开日期 | 2010-11-02 |
| 源URL | [http://ictir.ict.ac.cn/handle/311040/819]  |
| 专题 | 中国科学院计算技术研究所期刊论文_2008年英文 |
| 推荐引用方式 GB/T 7714 | Hua-Ming Liao ,Guo-Shun Pei . Cache-Based Aggregate Query Shipping: An Efficient Scheme of Distributed OLAP Query Processing[J]. Journal of Computer Science and Technology,2008,23(6):905-915. |
| APA | Hua-Ming Liao ,&Guo-Shun Pei .(2008).Cache-Based Aggregate Query Shipping: An Efficient Scheme of Distributed OLAP Query Processing.Journal of Computer Science and Technology,23(6),905-915. |
| MLA | Hua-Ming Liao ,et al."Cache-Based Aggregate Query Shipping: An Efficient Scheme of Distributed OLAP Query Processing".Journal of Computer Science and Technology 23.6(2008):905-915. |
入库方式： OAI收割
来源：计算技术研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。