TY - GEN
T1 - Efficient querying of distributed resources in mediator systems
AU - Manolescu, Ioana
AU - Bouganim, Luc
AU - Fabret, Françoise
AU - Simon, Eric
PY - 2002/1/1
Y1 - 2002/1/1
N2 - This work investigates the integration of heterogeneous resources, such as data and programs, in a fully distributed peer-to-peer mediation architecture. The challenge in making such a system succeed at a large scale is twofold. First, we need a simple concept for modeling resources. Second, we need efficient operators for distributed query execution, capable of handling well costly computations and large data transfers. To model heterogeneous resources, we use the model of table with binding patterns. To exploit a resource with restricted binding patterns, we propose an efficient BindJoin operator, optimized for minimizing large data transfers and costly computations. Furthermore, the proposed BindJoin operator delivers most of its output in the early stages of the execution, which is an important asset in a system meant for human interaction. Our experimental evaluation validates the proposed BindJoin algorithm on queries involving expensive programs.
AB - This work investigates the integration of heterogeneous resources, such as data and programs, in a fully distributed peer-to-peer mediation architecture. The challenge in making such a system succeed at a large scale is twofold. First, we need a simple concept for modeling resources. Second, we need efficient operators for distributed query execution, capable of handling well costly computations and large data transfers. To model heterogeneous resources, we use the model of table with binding patterns. To exploit a resource with restricted binding patterns, we propose an efficient BindJoin operator, optimized for minimizing large data transfers and costly computations. Furthermore, the proposed BindJoin operator delivers most of its output in the early stages of the execution, which is an important asset in a system meant for human interaction. Our experimental evaluation validates the proposed BindJoin algorithm on queries involving expensive programs.
U2 - 10.1007/3-540-36124-3_27
DO - 10.1007/3-540-36124-3_27
M3 - Conference contribution
AN - SCOPUS:84867317331
SN - 3540001069
SN - 9783540001065
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 468
EP - 485
BT - On the Move to Meaningful Internet Systems 2002
A2 - Meersman, Robert
A2 - Tari, Zahir
PB - Springer Verlag
T2 - 10th Int. Conference on Cooperative Information Systems, CoopIS 2002, Jointly with the 4th Int. Symp. on, DOA 2002 and the 1st Int. Conf. on Ontologies, Databases, and Applications of Semantics for Large-Scale Information Systems, ODBASE 2002
Y2 - 30 October 2002 through 1 November 2002
ER -