HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Efficient Data and Program Integration Using Binding Patterns

Abstract : In this work, we investigate data and program integration in a fully distribut- ed peer-to-peer mediation architecture. The challenge in making such a system succeed at a large scale is twofold. First, sharing a resource should be easy; therefore, we need a simple concept for modeling resources. Second, we need an efficient architecture for distributed query execution, capable of handling well costly computations and large data transfers. To model heterogeneous resources, we propose using the unified abstraction of table with binding patterns, simple yet powerful enough to capture data and programs. To exploit a resource with restricted binding patterns, we propose an efficient BindJoin operator, following the classical iterator model, in which we build optimization techniques for minimizing large data transfers and costly computations, and maximizing parallelism. Furthermor- e, our BindJoin operator can be tuned to deliver most of its output in the early stages of the execution, which is an important asset in a system meant for human interaction. Our preliminary experimental evaluation validates the proposed BindJoin algorithms, and shows they can provide good performance in queries involving distributed data and expensive programs.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 8:29:06 PM
Last modification on : Thursday, February 3, 2022 - 11:18:44 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:04:54 PM


  • HAL Id : inria-00072348, version 1



Ioana Manolescu, Luc Bouganim, Françoise Fabret, Eric Simon. Efficient Data and Program Integration Using Binding Patterns. [Research Report] RR-4239, INRIA. 2001. ⟨inria-00072348⟩



Record views


Files downloads