Scaling Up Query Allocation in the Presence of Autonomous Participants - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Scaling Up Query Allocation in the Presence of Autonomous Participants

(1) , (2) , (2) , (3)
1
2
3

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.

Dates and versions

hal-00640387 , version 1 (11-11-2011)

Identifiers

Cite

Quiané-Ruiz Arnulfo Jorge, Philippe Lamarre, Sylvie Cazalens, Patrick Valduriez. Scaling Up Query Allocation in the Presence of Autonomous Participants. DASFAA'11: International Conference on Database Systems for Advanced Applications, 2011, Hong Kong, China. pp.210-224, ⟨10.1007/978-3-642-20152-3_16⟩. ⟨hal-00640387⟩
237 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More