Join Methods and Query Optimization

Joins between data sources are an essential ingredient of multi-domain queries, as they exploit connection patterns defined between service marts or between service interfaces. This chapter moves from the definition of a query language over service interfaces, sketching how queries can be directly expressed over service marts and how these can be translated over service interfaces. The fundamental operation discussed in this chapter is the binary join between two sources, which is influenced by the type (search vs. exact) of services and by the management (parallel vs. sequential) of service calls. Then, this chapter presents an optimization framework for queries over several service interfaces, which considers several cost metrics for mapping queries into query plans, consisting of specific operations over services, and includes a branch and bound approach to the exploration of the combinatorial search space of all possible query plans.

[1]  Donovan A. Schneider,et al.  The Gamma Database Machine Project , 1990, IEEE Trans. Knowl. Data Eng..

[2]  Jennifer Widom,et al.  Query optimization over web services , 2006, VLDB.

[3]  Alessandro Campi,et al.  Joining the results of heterogeneous search engines , 2008, Inf. Syst..

[4]  Enrico Motta,et al.  Orchestration of semantic web services in IRS-III , 2004 .

[5]  Patrick Valduriez,et al.  Principles of Distributed Database Systems , 1990 .

[6]  Todd D. Millstein,et al.  Query containment for data integration systems , 2003, J. Comput. Syst. Sci..

[7]  Jeffrey D. Ullman,et al.  Answering queries using templates with binding patterns (extended abstract) , 1995, PODS '95.

[8]  Jos de Bruijn,et al.  Web Service Modeling Ontology , 2005, Appl. Ontology.

[9]  Paul Brown,et al.  DAMIA - A Data Mashup Fabric for Intranet Applications , 2007, VLDB.

[10]  Edward Y. Chang,et al.  Answering queries with useful bindings , 2001, TODS.

[11]  Yufei Tao,et al.  Branch-and-bound processing of ranked queries , 2007, Inf. Syst..

[12]  Hamid Pirahesh,et al.  Cost-based optimization for magic: algebra and implementation , 1996, SIGMOD '96.

[13]  Daniele Braga,et al.  Optimization of multi-domain queries on the web , 2008, Proc. VLDB Endow..

[14]  Jun'ichi Tatemura,et al.  Mashup Feeds: continuous queries over web services , 2007, SIGMOD '07.

[15]  Ioana Manolescu,et al.  Query optimization in the presence of limited access patterns , 1999, SIGMOD '99.

[16]  Barbara Pernici,et al.  Insights into Web Service Orchestration and Choreography , 2006, Int. J. E Bus. Res..

[17]  Yannis E. Ioannidis,et al.  Randomized algorithms for optimizing large join queries , 1990, SIGMOD '90.

[18]  Donald Kossmann,et al.  Iterative dynamic programming: a new class of query optimization algorithms , 2000, TODS.

[19]  Patricia G. Selinger,et al.  Support for repetitive transactions and ad hoc queries in System R , 1981, TODS.

[20]  Andrea Calì,et al.  Querying Data under Access Limitations , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[21]  Alon Y. Halevy,et al.  Adapting to source properties in processing data integration queries , 2004, SIGMOD '04.

[22]  Valeria De Antonellis,et al.  Ontology-based methodology for e-service discovery , 2006, Inf. Syst..

[23]  Guy M. Lman.  Grammar-like Functional Rules for Representing Query Optimization Alternatives , 1998 .

[24]  Francisco Curbera,et al.  Web Services Business Process Execution Language Version 2.0 , 2007 .

[25]  Anand Rajaraman,et al.  Answering queries using templates with binding patterns (extended abstract) , 1995, PODS.

[26]  Clement T. Yu,et al.  Priniples of Database Query Processing for Advanced Applications , 1997 .

[27]  Michael Kifer,et al.  Efficiently ordering subgoals with access constraints , 2006, PODS '06.

[28]  Alin Deutsch,et al.  Rewriting queries using views with access patterns under integrity constraints , 2005, Theor. Comput. Sci..

[29]  Daniele Braga,et al.  Mashing Up Search Services , 2008, IEEE Internet Computing.