Grammar-like functional rules for representing query optimization alternatives
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Principles of distributed database systems
Principles of distributed database systems
Randomized algorithms for optimizing large join queries
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Answering queries using templates with binding patterns (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Cost-based optimization for magic: algebra and implementation
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Principles of database query processing for advanced applications
Principles of database query processing for advanced applications
Query optimization in the presence of limited access patterns
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Support for repetitive transactions and ad hoc queries in System R
ACM Transactions on Database Systems (TODS)
Query containment for data integration systems
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Iterative dynamic programming: a new class of query optimization algorithms
ACM Transactions on Database Systems (TODS)
Answering queries with useful bindings
ACM Transactions on Database Systems (TODS)
The Gamma Database Machine Project
IEEE Transactions on Knowledge and Data Engineering
Adapting to source properties in processing data integration queries
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Efficiently ordering subgoals with access constraints
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query optimization over web services
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Branch-and-bound processing of ranked queries
Information Systems
Rewriting queries using views with access patterns under integrity constraints
Theoretical Computer Science
Mashup Feeds: continuous queries over web services
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Damia: a data mashup fabric for intranet applications
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Joining the results of heterogeneous search engines
Information Systems
IEEE Internet Computing
Optimization of multi-domain queries on the web
Proceedings of the VLDB Endowment
Querying Data under Access Limitations
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Ontology-based methodology for e-service discovery
Information Systems
Efficient computation of search computing queries
Search computing
| Hi-index | 0.00 |
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.