MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Efficiently ordering query plans for data integration (2002) [7 citations — 2 self]

Download:
Download as a PDF | Download as a PS
by Anhai Doan, Alon Halevy
In Proc. of ICDE
http://www-faculty.cs.uiuc.edu/~anhai/papers/icde02-plan-ordering.ps
Add To MetaCart

Abstract:

The goal of a data integration system is to provide a uniform interface to a multitude of data sources. Given a user query formulated in this interface, the system translates it into a set of query plans. Each plan is a query formulated over the data sources, and specifies a way to access sources and combine data to answer the user query. In practice, when the number of sources is large, a dataintegration system must generate and execute many query plans with significantly varying utilities. Hence, it is crucial that the system finds the best plans efficiently and executes them first, to guarantee acceptable time to and the quality of the first answers. We describe efficient solutions to this problem. First, we formally define the problem of ordering query plans. Second, we identify several interesting structural properties of the problem and describe three ordering algorithms that exploit these properties. Finally, we describe experimental results that suggest guidance on which algorithms perform best under which conditions.

Citations

615 Querying heterogeneous information sources using source descriptions – Levy, Rajaraman, et al. - 1996
485 An analysis of timedependent planning – Dean, Boddy - 1988
431 The TSIMMIS project: Integration of heterogeneous information sources – Chawathe, Garcia-Molina, et al. - 1994
376 Access path selection in a relational database management system – Selinger, Astrahan, et al. - 1979
230 Optimizing queries across diverse data sources – Haas, Kossmann, et al. - 1997
172 Answering recursive queries using views – Duschka, Genesereth - 1997
151 An Adaptive Query Execution System for Data Integration – Ives - 1999
140 A scalable algorithm for answering queries using views – Pottinger - 2000
109 Modelling web sources for information integration – Knoblock, Minton, et al. - 1998
89 Query-Answering Algorithms for Information Agents – Levy, Rajarman, et al. - 1996
82 Planning under uncertainty: structural assumptions and computational leverage – Boutilier, Dean, et al. - 1995
70 Universality of serial histograms – Ioannidis - 1993
68 Quality-driven Integration of Heterogenous Information Systems – Naumann, Leser, et al. - 1999
67 Cost based query scrambling for initial delays – Urhan, Franklin, et al. - 1998
62 Using probabilistic information in data integration – Florescu, Koller, et al.
60 Query size estimation by adaptive sampling – Lipton, Naughton - 1995
60 Statistical Profile Estimation in Database Systems – Mannino, Chu, et al. - 1988
52 Optimizing recursive information gathering plans – Lambrecht, Kambhampati, et al. - 1999
50 Planning by Rewriting: Efficiently Generating High-Quality Plans – Ambite, Knoblock - 1997
41 Planning, executing, sensing, and replanning for information gathering – Knoblock - 1995
39 Efficiently executing informationgathering plans – Friedman, Weld - 1997
33 Query optimization using local completeness – Duschka - 1997
26 Flexible and scalable query planning in distributed and heterogeneous environments – Ambite, Knoblock - 1998
22 Combining Artificial Intelligence and Databases for Data Integration – Levy - 1999
21 Fusion queries over internet databases – Yerneni, Papakonstantinou, et al. - 1998
18 Continuous query optimization – Avnur, Hellerstein
9 Using loops in decision-theoretic refinement planners – Goodwin - 1996
9 Using knowledge of redundancy for query optimization in mediators – Vassalos, Papakonstantinou - 1998
7 Joint optimization of cost and coverage of information gathering plans – Nie, Kambhampati - 2001
6 Query planning with information quality bounds – Leser, Naumann - 2000
6 Maximizing coverage of mediated web queries – Yerneni, Naumann, et al. - 2000
4 Efficient decision theoretic planning: Techniques and empirical analysis – Haddawy, Doan, et al. - 1995
3 Efficiently ordering query plans – Doan, Halevy - 2001
1 Efficiently executing information gathering plan – Lambrecht, Kambhampati - 1998
1 Section 13.4: Estimating the cost of a plan – Ramakrishnan - 1998