Abstract
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.
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
Altinel, M., Brown, P., Cline, S., Kartha, R., Louie, E., Markl, V., Mau, L., Ng, Y.-H., Simmen, D., Singh, A.: Damia - A Data Mashup Fabric for Intranet Applications. In: VLDB 2007, pp. 1370–1373 (2007)
Bianchini, D., De Antonellis, V., Pernici, B., Plebani, P.: Ontology-based Methodology for e-Service Discovery. Inf. Syst. 31(4-5), 361–380 (2006)
Braga, D., Campi, A., Ceri, S., Raffio, A.: Joining the Results of Heterogeneous Search Engines. Inf. Syst. 33(7-8), 658–680 (2008)
Braga, D., Ceri, S., Daniel, F., Martinenghi, D.: Optimization of Multi-Domain Queries on the Web. PVLDB 1(1), 562–573 (2008)
Braga, D., Ceri, S., Daniel, F., Martinenghi, D.: Mashing Up Search Services. Internet Computing 12(5), 16–23 (2008)
Calì, A., Martinenghi, D.: Querying Data under Access Limitations. In: ICDE 2008, Cancún, Mexico, pp. 50–59 (2008)
Chamberlin, D.D., Astrahan, M.M., King, W.F., Lorie, R.A., Mehl, J.W., Price, T.G., Schkolnick, M., Selinger, P.G., Slutz, D.R., Wade, B.W., Yost, R.A.: Support for Repetitive Transactions and Ad Hoc Queries in System R. ACM-TODS 6(1), 70–94 (1981)
Confalonieri, R., Domingue, J., Motta, E.: Orchestration of Semantic Web Services in IRS-III. In: AKT-SWS 2004. The Open University, Milton Keynes (2004)
Daniel, F., Pernici, B.: Insights into Web Service Orchestration and Choreography. International Journal of E-Business Research 2(1), 58–77 (2006)
Deutsch, A., Ludäscher, B., Nash, A.: Rewriting Queries using Views with Access Patterns under Integrity Constraints. Theoretical Computer Science 371(3), 200–226 (2007)
DeWitt, D.J., Ghandeharizadeh, S., Schneider, D.A., Bricker, A., Hsiao, H.-I., Rasmussen, R.: The Gamma Database Machine Project. IEEE Trans. on Knowledge and Data Engineering 2(1), 44–62 (1990)
Florescu, D., Levy, A.Y., Manolescu, I., Suciu, D.: Query Optimization in the presence of Limited Access Patterns. In: SIGMOD 1999, Philadelphia, Pennsylvania, USA, pp. 311–322 (1999)
Ioannidis, Y.E., Kang, Y.: Randomized Algorithms for Optimizing Large Join Queries. SIGMOD Rec. 19(2), 312–321 (1990)
Ives, Z.G., Halevy, A.Y., Weld, D.S.: Adapting to Source Properties in Processing Data Integration Queries. In: SIGMOD 2004, Paris, France, pp. 395–406 (2004)
Kossmann, D., Stocker, K.: Iterative Dynamic Programming: a New Class of Query Optimization Algorithms. ACM-TODS 25(1), 43–82 (2000)
Li, C., Chang, E.: Answering Queries with Useful Bindings. ACM-TODS 26(3), 313–343 (2001)
Lohman, G.M.: Grammar-like Functional Rules for Representing Query Optimization Alternatives. In: SIGMOD 1988, Chicago, Illinois, USA, pp. 18–27 (1988)
Millstein, T.D., Levy, A.Y., Friedman, M.: Query Containment for Data Integration Systems. In: PODS 2000, Dallas, Texas, USA, pp. 67–75 (2000)
OASIS: Web Services Business Process Execution Language. Technical report (2007), http://www.oasis-open.org/committees/wsbpel/
Rajaraman, A., Sagiv, Y., Ullman, J.D.: Answering Queries using Templates with Binding Patterns. In: PODS 1995, San José, California, USA, pp. 105–112 (1995)
Seshadri, P., Hellerstein, J.M., Pirahesh, H., Cliff Leung, T.Y., Ramakrishnan, R., Srivastava, D., Stuckey, P.J., Sudarshan, S.: Cost-based Optimization for Magic: Algebra and Implementation. SIGMOD Rec. 25(2), 435–446 (1996)
Srivastava, U., Munagala, K., Widom, J., Motwani, R.: Query Optimization over Web Services. In: VLDB 2006, Seoul, Korea, pp. 355–366 (2006)
Özsu, M.T., Valduriez, P.: Principles of Distributed Database Systems. Prentice-Hall, Inc., Upper Saddle River (1991)
Tao, Y., Hristidis, V., Papadias, D., Papakonstantinou, Y.: Branch-and-Bound Processing of Ranked Queries. Inf. Syst. 32(3), 424–445 (2007)
Tatemura, J., Sawires, A., Po, O., Chen, S., Candan, K.S., Agrawal, D., Goveas, M.: Mashup Feeds: Continuous Queries over Web Services. In: SIGMOD 2007, New York, NY, USA, pp. 1128–1130 (2007)
W3C: Web Services Choreography Description Language, Version 1.0. W3C Candidate Recommendation (2005), http://www.w3.org/TR/ws-cdl-10/
W3C: Web Service Choreography Interface (WSCI), Version 1.0. W3C Note (2002), http://www.w3.org/TR/wsci/
WSMO: Web Service Modeling Ontology, http://www.wsmo.org
Yang, G., Kifer, M., Chaudhri, V.K.: Efficiently Ordering Subgoals with Access Constraints. In: PODS 2006, Chicago, Illinois, USA, pp. 183–192 (2006)
Yu, C.T., Meng, W.: Principles of Database Query Processing for Advanced Applications. Morgan Kaufmann, San Francisco (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Braga, D., Ceri, S., Grossniklaus, M. (2010). Chapter 10: Join Methods and Query Optimization. In: Ceri, S., Brambilla, M. (eds) Search Computing. Lecture Notes in Computer Science, vol 5950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12310-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-12310-8_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12309-2
Online ISBN: 978-3-642-12310-8
eBook Packages: Computer ScienceComputer Science (R0)