Satisfaction-based query replication

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

Jorge Arnulfo Quiane Ruiz, Philippe Lamarre, Patrick Valduriez

Research output: Contribution to journalArticle

Abstract

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 S bQR, 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.

Original languageEnglish
Pages (from-to)1-26
Number of pages26
JournalDistributed and Parallel Databases
Volume30
Issue number1
DOIs
Publication statusPublished - 1 Feb 2012
Externally publishedYes

Fingerprint

Replication
Query
Internet
Overload
Criticality
Resources
Distributed systems
Autonomy
World Wide Web

Keywords

  • Autonomous participants
  • Fault-tolerance
  • Participants satisfaction
  • Query criticality
  • Query replication
  • Self-adaptation

ASJC Scopus subject areas

  • Information Systems
  • Software
  • Hardware and Architecture
  • Information Systems and Management

Cite this

Satisfaction-based query replication : An automatic and self-adaptable approach for replicating queries in the presence of autonomous participants. / Quiane Ruiz, Jorge Arnulfo; Lamarre, Philippe; Valduriez, Patrick.

In: Distributed and Parallel Databases, Vol. 30, No. 1, 01.02.2012, p. 1-26.

Research output: Contribution to journalArticle

@article{f612662adadd46afaab21672b7c03c2f,
title = "Satisfaction-based query replication: An automatic and self-adaptable approach for replicating queries in the presence of autonomous participants",
abstract = "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 S bQR, 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.",
keywords = "Autonomous participants, Fault-tolerance, Participants satisfaction, Query criticality, Query replication, Self-adaptation",
author = "{Quiane Ruiz}, {Jorge Arnulfo} and Philippe Lamarre and Patrick Valduriez",
year = "2012",
month = "2",
day = "1",
doi = "10.1007/s10619-011-7086-7",
language = "English",
volume = "30",
pages = "1--26",
journal = "Distributed and Parallel Databases",
issn = "0926-8782",
publisher = "Springer Netherlands",
number = "1",

}

TY - JOUR

T1 - Satisfaction-based query replication

T2 - An automatic and self-adaptable approach for replicating queries in the presence of autonomous participants

AU - Quiane Ruiz, Jorge Arnulfo

AU - Lamarre, Philippe

AU - Valduriez, Patrick

PY - 2012/2/1

Y1 - 2012/2/1

N2 - 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 S bQR, 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.

AB - 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 S bQR, 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.

KW - Autonomous participants

KW - Fault-tolerance

KW - Participants satisfaction

KW - Query criticality

KW - Query replication

KW - Self-adaptation

UR - http://www.scopus.com/inward/record.url?scp=84859971350&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84859971350&partnerID=8YFLogxK

U2 - 10.1007/s10619-011-7086-7

DO - 10.1007/s10619-011-7086-7

M3 - Article

VL - 30

SP - 1

EP - 26

JO - Distributed and Parallel Databases

JF - Distributed and Parallel Databases

SN - 0926-8782

IS - 1

ER -