Scaling up query allocation in the presence of autonomous participants

Jorge Arnulfo Quiane Ruiz, Philippe Lamarre, Sylvie Cazalens, Patrick Valduriez

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In large-scale, heterogeneous information systems, mediators are widely used for query processing and the good operation of a system strongly depends on the way the mediator allocates queries. On the other hand, it is well known that a single mediator is a potential scalability and performance bottleneck as well as a single point of failure. Thus, multiple mediators should perform the query allocation process. This task is challenging in large-scale systems because participants typically have special interests that are not performance-related. Mediators should satisfy participants interests as if there was a single mediator in the system - i.e., with no, or almost no, additional network traffic. In this paper, we propose a virtual money-based query allocation method, called VM b QA, to perform query allocation in the presence of multiple mediators and autonomous participants. A key feature of VM b QA is that it allows a system to scale up to several mediators with no additional network cost. The results show that VM b QA significantly outperforms baseline methods from both satisfaction and performance points of view.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages210-224
Number of pages15
Volume6588 LNCS
EditionPART 2
DOIs
Publication statusPublished - 28 Apr 2011
Externally publishedYes
Event16th International Conference on Database Systems for Advanced Applications, DASFAA 2011 - Hong Kong, China
Duration: 22 Apr 201125 Apr 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume6588 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other16th International Conference on Database Systems for Advanced Applications, DASFAA 2011
CountryChina
CityHong Kong
Period22/4/1125/4/11

Fingerprint

Mediator
Query processing
Scalability
Large scale systems
Information systems
Scaling
Query
Costs
Scale-up
Heterogeneous Systems
Query Processing
Network Traffic
Large-scale Systems
Information Systems
Baseline

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Quiane Ruiz, J. A., Lamarre, P., Cazalens, S., & Valduriez, P. (2011). Scaling up query allocation in the presence of autonomous participants. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (PART 2 ed., Vol. 6588 LNCS, pp. 210-224). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6588 LNCS, No. PART 2). https://doi.org/10.1007/978-3-642-20152-3_16

Scaling up query allocation in the presence of autonomous participants. / Quiane Ruiz, Jorge Arnulfo; Lamarre, Philippe; Cazalens, Sylvie; Valduriez, Patrick.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6588 LNCS PART 2. ed. 2011. p. 210-224 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6588 LNCS, No. PART 2).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Quiane Ruiz, JA, Lamarre, P, Cazalens, S & Valduriez, P 2011, Scaling up query allocation in the presence of autonomous participants. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 2 edn, vol. 6588 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 6588 LNCS, pp. 210-224, 16th International Conference on Database Systems for Advanced Applications, DASFAA 2011, Hong Kong, China, 22/4/11. https://doi.org/10.1007/978-3-642-20152-3_16
Quiane Ruiz JA, Lamarre P, Cazalens S, Valduriez P. Scaling up query allocation in the presence of autonomous participants. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 2 ed. Vol. 6588 LNCS. 2011. p. 210-224. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2). https://doi.org/10.1007/978-3-642-20152-3_16
Quiane Ruiz, Jorge Arnulfo ; Lamarre, Philippe ; Cazalens, Sylvie ; Valduriez, Patrick. / Scaling up query allocation in the presence of autonomous participants. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6588 LNCS PART 2. ed. 2011. pp. 210-224 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).
@inproceedings{cd9882b28b364b998ec0cb775228ccb6,
title = "Scaling up query allocation in the presence of autonomous participants",
abstract = "In large-scale, heterogeneous information systems, mediators are widely used for query processing and the good operation of a system strongly depends on the way the mediator allocates queries. On the other hand, it is well known that a single mediator is a potential scalability and performance bottleneck as well as a single point of failure. Thus, multiple mediators should perform the query allocation process. This task is challenging in large-scale systems because participants typically have special interests that are not performance-related. Mediators should satisfy participants interests as if there was a single mediator in the system - i.e., with no, or almost no, additional network traffic. In this paper, we propose a virtual money-based query allocation method, called VM b QA, to perform query allocation in the presence of multiple mediators and autonomous participants. A key feature of VM b QA is that it allows a system to scale up to several mediators with no additional network cost. The results show that VM b QA significantly outperforms baseline methods from both satisfaction and performance points of view.",
author = "{Quiane Ruiz}, {Jorge Arnulfo} and Philippe Lamarre and Sylvie Cazalens and Patrick Valduriez",
year = "2011",
month = "4",
day = "28",
doi = "10.1007/978-3-642-20152-3_16",
language = "English",
isbn = "9783642201516",
volume = "6588 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 2",
pages = "210--224",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
edition = "PART 2",

}

TY - GEN

T1 - Scaling up query allocation in the presence of autonomous participants

AU - Quiane Ruiz, Jorge Arnulfo

AU - Lamarre, Philippe

AU - Cazalens, Sylvie

AU - Valduriez, Patrick

PY - 2011/4/28

Y1 - 2011/4/28

N2 - In large-scale, heterogeneous information systems, mediators are widely used for query processing and the good operation of a system strongly depends on the way the mediator allocates queries. On the other hand, it is well known that a single mediator is a potential scalability and performance bottleneck as well as a single point of failure. Thus, multiple mediators should perform the query allocation process. This task is challenging in large-scale systems because participants typically have special interests that are not performance-related. Mediators should satisfy participants interests as if there was a single mediator in the system - i.e., with no, or almost no, additional network traffic. In this paper, we propose a virtual money-based query allocation method, called VM b QA, to perform query allocation in the presence of multiple mediators and autonomous participants. A key feature of VM b QA is that it allows a system to scale up to several mediators with no additional network cost. The results show that VM b QA significantly outperforms baseline methods from both satisfaction and performance points of view.

AB - In large-scale, heterogeneous information systems, mediators are widely used for query processing and the good operation of a system strongly depends on the way the mediator allocates queries. On the other hand, it is well known that a single mediator is a potential scalability and performance bottleneck as well as a single point of failure. Thus, multiple mediators should perform the query allocation process. This task is challenging in large-scale systems because participants typically have special interests that are not performance-related. Mediators should satisfy participants interests as if there was a single mediator in the system - i.e., with no, or almost no, additional network traffic. In this paper, we propose a virtual money-based query allocation method, called VM b QA, to perform query allocation in the presence of multiple mediators and autonomous participants. A key feature of VM b QA is that it allows a system to scale up to several mediators with no additional network cost. The results show that VM b QA significantly outperforms baseline methods from both satisfaction and performance points of view.

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

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

U2 - 10.1007/978-3-642-20152-3_16

DO - 10.1007/978-3-642-20152-3_16

M3 - Conference contribution

SN - 9783642201516

VL - 6588 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 210

EP - 224

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -