Adali, S. and Candan, S. and Papakonstantinou, Y. and Subrahmanyan, V. (1995) Query Caching and Optimization in Mediator Systems. Technical Report. Stanford University.
BibTeX | DublinCore | EndNote | HTML |
| PDF 260Kb |
Abstract
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, high 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
Item Type: | Techreport (Technical Report) | |
---|---|---|
Subjects: | Computer Science > Query Processing | |
Projects: | Information Integration | |
Related URLs: | Project Homepage | http://infolab.stanford.edu/serf/ |
ID Code: | 86 | |
Deposited By: | Import Account | |
Deposited On: | 25 Feb 2000 16:00 | |
Last Modified: | 02 Dec 2008 15:32 |
Download statistics
Repository Staff Only: item control page