Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Avnur and J. Hellerstein. Eddies: Continuously adaptive query processing. IN PROC. OF ACM SIGMOD CONF., 2000.
P. Bernstein and D W. Chiu. Using semi-joins to solve relational queries. Journal of the ACM, 1981.
L. Bouganim, F. Fabret, F. Porto, and P. Valduriez. Processing queries with expensive functions and large objects in distributed mediator systems. ICDE2001.
R. Braumandl, M. Keidl, A. Kemper, and D. Kossmann et al. ObjectGlobe: Ubiquitous query processing on the internet. In Workshop on Technologies for E-Services, 2000.
S. Chaudhuri and K. Shim. Query optimization in the presence of foreign functions. In Proc. of the VLDB Conf., 1993.
S. Chaudhuri and K. Shim. Optimization of queries with user-defined predicates. ACM Transaction on database system (TODS), 2(24), 1999.
The Ecobase Team. The Ecobase project: Database and web technologies for environmental information systems. SIGMOD Record, 30(3), 2001.
D. Florescu, A. Levy, I. Manolescu, and D. Suciu Query optimization in the presence of limited access patterns. In Proc. of ACM SIGMOD Conf., 1999.
S. Ganguly, W. Hassan, and R. Krishnamurthy. Query optimization for parallel execution. In Proc. of ACM SIGMOD Conf., 1992.
R. Goldman and J. Widom. WSQ/DSQ: A practical approach for combined querying of databases and the web. In Proc. of ACM SIGMOD Conf., 2000.
G. Graefe. Query evaluation techniques for large databases. ACM Computing Surveys, 25(2), June 1993.
P. Haas and J. Hellerstein. Ripple joins for online aggregation. SIGMOD Conf., 1999.
J. Hellerstein and J. Naughton. Query execution techniques for caching expensive methods. In Proc. of ACM SIGMOD Conf., 1996.
J. Hellerstein and M. Stonebraker. Predicate migration: Optimizing queries with expensive predicates. In Proc. of ACM SIGMOD Conf., 1993.
Z. Ives, D. Florescu, M. Friedman, D. Weld, and A. Levy. An adaptive query execution system for data integration. In Proc. of ACM SIGMOD Conf., 1999.
D. Kossmann. The state of the art in distributed query processing. ACM Computing Surveys, 2000.
I. Manolescu, L. Bouganim, F. Fabret, and E. Simon. Efficient data and program integration using binding patterns. Tech. Report no. 4239, INRIA. Extended version available at: http://www-rocq.inria.fr/~manolesc/BJ-extended.ps
T. Mayr and P. Seshadri. Client-site query extensions. In Proc. of ACM SIGMOD., 1999.
A. Rajaraman, Y. Sagiv, and J. Ullman. Answering queries using templates with binding patterns. In Proc. of the ACM PODS, San Jose, CA, 1995.
A. Raman, B. Raman, and J. Hellerstein. Online dynamic reordering for interactive data processing. In Proc. of the VLDB Conf., 1999.
M. Rodriguez-Martinez and N. Roussopoulos. MOCHA: A self-extensible database middleware system for distributed data sources. In Proc. of ACM SIGMOD Conf, 2000.
W. Scheufele and G. Moerkotte. Efficient dynamic programming algorithms for ordering expensive joins and selections. In Proc. of the EDBT Conf., 1998.
T. Urhan and M. Franklin. XJoin: a reactively scheduled pipelined join operator. In IEEE Data Engineering Bulletin, 2000.
A.N. Wilschut and P.M.G. Apers. Dataflow query execution in a parallel main-memory environment. In Proc. of the PDIS Conf., 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manolescu, I., Bouganim, L., Fabret, F., Simon, E. (2002). Efficient Querying of Distributed Resources in Mediator Systems. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems 2002: CoopIS, DOA, and ODBASE. OTM 2002. Lecture Notes in Computer Science, vol 2519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36124-3_27
Download citation
DOI: https://doi.org/10.1007/3-540-36124-3_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00106-5
Online ISBN: 978-3-540-36124-4
eBook Packages: Springer Book Archive