返回
Multiple query scheduling for distributed semantic caches
DOI:10.1016/j.jpdc.2010.02.002.png)
摘要
En 中文
In distributed query processing systems, load balancing plays an important role in maximizing system throughput. When queries can leverage cached intermediate results, improving the cache hit ratio becomes as important as load balancing in query scheduling, especially when dealing with computationally expensive queries. The scheduling policies must be designed to take into consideration the dynamic contents of the distributed caching infrastructure. In this paper, we propose and discuss several distributed query scheduling policies that directly consider the available cache contents by employing distributed multidimensional indexing structures and an exponential moving average approach to predicting cache contents. These approaches are shown to produce better query plans and faster query response times than traditional scheduling policies that do not predict dynamic contents in distributed caches. We experimentally demonstrate the utility of the scheduling policies using MQO, which is a distributed, Grid-enabled, multiple query processing middleware system we developed to optimize query processing for data analysis and visualization applications. (C) 2010 Elsevier Inc. All rights reserved.
Keyword:
Multiple query optimization
Distributed query scheduling
Data intensive computing
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
Threats, Assurances, and the Last Chance for Peace: The Lessons of Mao's Korean War Telegrams威胁、保证与和平的最后一次机会:毛泽东朝鲜战争电报的启示
Enhancement of group III atom interdiffusion by nondopant oxygen implants in In0.53Ga0.47As-In0.52Al0.48As multiquantum wells通过非掺杂氧注入增强In₀.₅₃Ga₀.₄₇As-In₀.₅₂Al₀.₄₈As多量子阱中III族原子的互扩散

