TY - JOUR
T1 - Query Caching and Optimization in Distributed Mediator Systems
AU - Adali, S.
AU - Candan, K. S.
AU - Papakonstantinou, Y.
AU - Subrahmanian, V. S.
PY - 1996/6
Y1 - 1996/6
N2 - Query processing and optimization in mediator systems that access distributed non-proprietary sources pose many novel problems. Cost-based query optimization is hard because the mediator does not have access to source statistics information and furthermore it may not be easy to model the source's performance. At the same time, querying remote sources may be very expensive because of high connection overhead, long computation time, financial charges, and temporary unavailability. We propose a cost-based optimization technique that caches statistics of actual calls to the sources and consequently estimates the cost of the possible execution plans based on the statistics cache. We investigate issues pertaining to the design of the statistics cache and experimentally analyze various tradeoffs. We also present a query result caching mechanism that allows us to effectively use results of prior queries when the source is not readily available. We employ the novel invariants mechanism, which shows how semantic information about data sources may be used to discover cached query results of interest.
AB - Query processing and optimization in mediator systems that access distributed non-proprietary sources pose many novel problems. Cost-based query optimization is hard because the mediator does not have access to source statistics information and furthermore it may not be easy to model the source's performance. At the same time, querying remote sources may be very expensive because of high connection overhead, long computation time, financial charges, and temporary unavailability. We propose a cost-based optimization technique that caches statistics of actual calls to the sources and consequently estimates the cost of the possible execution plans based on the statistics cache. We investigate issues pertaining to the design of the statistics cache and experimentally analyze various tradeoffs. We also present a query result caching mechanism that allows us to effectively use results of prior queries when the source is not readily available. We employ the novel invariants mechanism, which shows how semantic information about data sources may be used to discover cached query results of interest.
UR - http://www.scopus.com/inward/record.url?scp=0030156987&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0030156987&partnerID=8YFLogxK
U2 - 10.1145/235968.233327
DO - 10.1145/235968.233327
M3 - Article
AN - SCOPUS:0030156987
SN - 0163-5808
VL - 25
SP - 137
EP - 148
JO - SIGMOD Record (ACM Special Interest Group on Management of Data)
JF - SIGMOD Record (ACM Special Interest Group on Management of Data)
IS - 2
ER -