BibSonomy :: publication ::

tag user group author concept BibTeX key search:all search:jmora

The blue social bookmark and publication sharing system.

entry of jmora and 1 other user:

(0)

This publication has not been reviewed yet.

rating distribution

average user rating

The average rating is computed over all reviews. However, some of them may be invisible to you due to the visibility setting chosen by the reviewers.

(0.0 of 5.0 based on 0 reviews)

Flexible and scalable cost-based query planning in mediators: A transformational approach

by: José Luis Ambite, and Craig A. Knoblock

In: Artificial Intelligence, Vol. 118, Nr. 1-2 (2000) , p. 115 - 161.

Resources (URL, PDF, PS...)

URL:	http://www.sciencedirect.com/science/article/B6TYF-43FX0XK-4/2/0a523a45762d97ec64207a60bb702fe9
DOI:	10.1016/S0004-3702(00)00003-5

The Internet provides access to a wealth of information. For any given topic or application domain there are a variety of available information sources. However, current systems, such as search engines or topic directories in the World Wide Web, offer only very limited capabilities for locating, combining, and organizing information. Mediators, systems that provide integrated access and database-like query capabilities to information distributed over heterogeneous sources, are critical to realize the full potential of meaningful access to networked information. Query planning, the task of generating a cost-efficient plan that computes a user query from the relevant information sources, is central to mediator systems. However, query planning is a computationally hard problem due to the large number of possible sources and possible orderings on the operations to process the data. Moreover, the choice of sources, data processing operations, and their ordering, strongly affects the plan cost. In this paper, we present an approach to query planning in mediators based on a general planning paradigm called Planning by Rewriting PbR Ambite and Knoblock, 1997. Our work yields several contributions. First, our PbR-based query planner combines both the selection of the sources and the ordering of the operations into a single search space in which to optimize the plan quality. Second, by using local search techniques our planner explores the combined search space efficiently and produces high-quality plans. Third, because our query planner is an instantiation of a domain-independent framework it is very flexible and can be extended in a principled way. Fourth, our planner has an anytime behavior. Finally, we provide empirical results showing that our PbR-based query planner compares favorably on scalability and plan quality over previous approaches, which include both classical AI planning and dynamic-programming query optimization techniques.

Description

ScienceDirect - Artificial Intelligence : Flexible and scalable cost-based query planning in mediators: A transformational approach

BibTeX record

@article{Ambite2000115,
  abstract = {The Internet provides access to a wealth of information. For any given topic or application domain there are a variety of available information sources. However, current systems, such as search engines or topic directories in the World Wide Web, offer only very limited capabilities for locating, combining, and organizing information. Mediators, systems that provide integrated access and database-like query capabilities to information distributed over heterogeneous sources, are critical to realize the full potential of meaningful access to networked information.
Query planning, the task of generating a cost-efficient plan that computes a user query from the relevant information sources, is central to mediator systems. However, query planning is a computationally hard problem due to the large number of possible sources and possible orderings on the operations to process the data. Moreover, the choice of sources, data processing operations, and their ordering, strongly affects the plan cost.
In this paper, we present an approach to query planning in mediators based on a general planning paradigm called Planning by Rewriting (PbR) (Ambite and Knoblock, 1997). Our work yields several contributions. First, our PbR-based query planner combines both the selection of the sources and the ordering of the operations into a single search space in which to optimize the plan quality. Second, by using local search techniques our planner explores the combined search space efficiently and produces high-quality plans. Third, because our query planner is an instantiation of a domain-independent framework it is very flexible and can be extended in a principled way. Fourth, our planner has an anytime behavior. Finally, we provide empirical results showing that our PbR-based query planner compares favorably on scalability and plan quality over previous approaches, which include both classical AI planning and dynamic-programming query optimization techniques.},
  added-at = {2009-07-03T19:55:22.000+0200},
  author = {Ambite, José Luis and Knoblock, Craig A.},
  biburl = {http://www.bibsonomy.org/bibtex/27732458dc2a559f1fbcabd6ddb6b14b0/jmora},
  description = {ScienceDirect - Artificial Intelligence : Flexible and scalable cost-based query planning in mediators: A transformational approach},
  doi = {DOI: 10.1016/S0004-3702(00)00003-5},
  interhash = {1fcc6542461503af66ccea44426b762f},
  intrahash = {7732458dc2a559f1fbcabd6ddb6b14b0},
  issn = {0004-3702},
  journal = {Artificial Intelligence},
  keywords = {integration planning},
  number = {1-2},
  pages = {115 - 161},
  timestamp = {2009-07-03T19:55:22.000+0200},
  title = {Flexible and scalable cost-based query planning in mediators: A transformational approach},
  url = {http://www.sciencedirect.com/science/article/B6TYF-43FX0XK-4/2/0a523a45762d97ec64207a60bb702fe9},
  volume = 118,
  year = 2000
}

Endnote record

%0 Journal Article
%1 Ambite2000115
%A Ambite, José Luis
%A Knoblock, Craig A.
%D 2000
%J Artificial Intelligence
%K 
%N 1-2
%P 115 - 161
%T Flexible and scalable cost-based query planning in mediators: A transformational approach
%R DOI: 10.1016/S0004-3702(00)00003-5
%U http://www.sciencedirect.com/science/article/B6TYF-43FX0XK-4/2/0a523a45762d97ec64207a60bb702fe9
%V 118
%X The Internet provides access to a wealth of information. For any given topic or application domain there are a variety of available information sources. However, current systems, such as search engines or topic directories in the World Wide Web, offer only very limited capabilities for locating, combining, and organizing information. Mediators, systems that provide integrated access and database-like query capabilities to information distributed over heterogeneous sources, are critical to realize the full potential of meaningful access to networked information.
Query planning, the task of generating a cost-efficient plan that computes a user query from the relevant information sources, is central to mediator systems. However, query planning is a computationally hard problem due to the large number of possible sources and possible orderings on the operations to process the data. Moreover, the choice of sources, data processing operations, and their ordering, strongly affects the plan cost.
In this paper, we present an approach to query planning in mediators based on a general planning paradigm called Planning by Rewriting (PbR) (Ambite and Knoblock, 1997). Our work yields several contributions. First, our PbR-based query planner combines both the selection of the sources and the ordering of the operations into a single search space in which to optimize the plan quality. Second, by using local search techniques our planner explores the combined search space efficiently and produces high-quality plans. Third, because our query planner is an instantiation of a domain-independent framework it is very flexible and can be extended in a principled way. Fourth, our planner has an anytime behavior. Finally, we provide empirical results showing that our PbR-based query planner compares favorably on scalability and plan quality over previous approaches, which include both classical AI planning and dynamic-programming query optimization techniques.