首页> 外文期刊>Distributed and Parallel Databases >Satisfaction-based query replication An automatic and self-adaptable approach for replicating queries in the presence of autonomous participants
【24h】

Satisfaction-based query replication An automatic and self-adaptable approach for replicating queries in the presence of autonomous participants

机译:基于满意度的查询复制一种自动且自适应的方法,用于在存在自动参与者的情况下复制查询

获取原文
获取原文并翻译 | 示例

摘要

In large-scale Internet-based distributed systems, participants (consumers and providers) are typically autonomous, i.e. they may have special interests towards queries and other participants. In this context, a way to avoid a participant to voluntarily leave the system is satisfying its interests when allocating queries. However, participants satisfaction may also be negatively affected by the failures of other participants. Query replication is a solution to deal with providers failures, but, it is challenging because of autonomy: it cannot only quickly overload the system, but also it can dissatisfy participants with uninteresting queries. Thus, a natural question arises: should queries be replicated! If so, which ones! and how many times! In this paper, we answer these questions by revisiting query replication from a satisfaction and probabilistic point of view. We propose a new algorithm, called ShQR, that decides on-the-fly whether a query should be replicated and at which rate. As replicating a large number of queries might overload the system, we propose a variant of our algorithm, called S_BQR+. The idea is to voluntarily fail to allocate as many replicas as required by consumers for low critical queries so as to keep resources for high critical queries during query-intensive periods. Our experimental results demonstrate that our algorithms significantly outperform the baseline algorithms from both the performance and satisfaction points of view. We also show that our algorithms automatically adapt to the criticality of queries and different rates of participant failures.
机译:在大规模的基于Internet的分布式系统中,参与者(消费者和提供者)通常是自主的,即,他们可能对查询和其他参与者具有特殊的兴趣。在这种情况下,避免参与者自愿离开系统的一种方法是在分配查询时满足其兴趣。但是,其他参与者的失败也可能对参与者的满意度造成负面影响。查询复制是一种解决提供程序故障的解决方案,但是由于具有自治性,因此具有挑战性:它不仅会快速使系统超载,还会使不感兴趣的查询使参与者不满意。因此,出现了一个自然的问题:是否应该复制查询!如果是这样,哪个!还有多少次!在本文中,我们通过从满意度和概率的角度重新审视查询复制来回答这些问题。我们提出了一种称为ShQR的新算法,该算法可即时确定是否应复制查询以及以何种速率复制查询。由于复制大量查询可能会使系统过载,因此我们提出了算法的一种变体,称为S_BQR +。这样做的想法是自愿未能为低关键性查询分配用户所需数量的副本,以便在查询密集型期间为高关键性查询保留资源。我们的实验结果表明,从性能和满意度的角度来看,我们的算法明显优于基线算法。我们还表明,我们的算法可以自动适应查询的关键性和不同的参与者失败率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号