Ambite, J. L., and Knoblock, C. A. 1998. Flexible and scalable query planning in distributed and heterogeneous environments. In Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....reduce the execution cost. In [9] the Garlic system finds the query execution plan with the least cost using a cost based optimizer for traditional databases. In [23] the authors discuss generating efficient execution query plans for fusion queries, a subclass of the data integration problem. In [1] the authors propose generating an initial solution plan, then iteratively rewriting the current solution in order to improve it. All these works focus on minimizing the cost to get al..l answers, rather than the cost to the first answers. Works at Query Execution Level: During execution even the ....

J. Ambite and C. Knoblock. Flexible and scalable query planning in distributed and heterogeneous environments. In Proc. of the 4th Int. Conf. on AI Planning Systems (AIPS), 1998.

....reduce the execution cost. In [9] the Garlic system finds the query execution plan with the least cost using a cost based optimizer for traditional databases. In [23] the authors discuss generating efficient execution query plans for fusion queries, a subclass of the data integration problem. In [1] the authors propose generating an initial solution plan, then iteratively rewriting the current solution in order to improve it. All these works focus on minimizing the cost to get al..l answers, rather than the cost to the first answers. Works at Query Execution Level: During execution even the ....

J. Ambite and C. Knoblock. Flexible and scalable query planning in distributed and heterogeneous environments. In Proc. of the 4th Int. Conf. on AI Planning Systems (AIPS), 1998.

....amount of information, eciency considerations become very important. For instance, it is very useful to select which information sources will be queried. In order to both integrate and select the relevant information sources di erent techniques can be used. A frequently used technique is planning [1, 3]. In that case, every step in the plan represents an action to query an information source. Figure 1 summarizes the discussion above about traditional information retrieval and the new Web information gathering techniques. information not structured) Document Set Query System Information ....

Ambite, J.L., Knoblock, C.A.: Flexible and scalable query planning in distributed and heterogeneous environments. Proceedings of the Fourth International Conference on Arti cial Intelligence Planning Systems. Pittsburgh, Pennsylvania (1998).

....form at HOB Online with the effect of an email reminder to be sent to the user one hour before the broadcast event starts. The wrappers realizing the InfoBeans 3 to 5 have been built by the user in a cooperative dialog with the system supported by the 1 From a query planning point of view (see [1]) an InfoBean network can be used to visualize the query plan s execution. 2 www.hob.com 3 www.ubl.com Figure 1: The House of Blues InfoBox. Figure 2: IO channels of the House of Blues InfoBox. technique of programming by demonstration . Later on in this paper, we will demonstrate in ....

Ambite, J.L. and Knoblock, C.A. Flexible and Scalable Query Planning in Distributed and Heterogeneous Environments, in Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems (Pittsburgh, PA, 1998).

....workflow management technology. Knoblock has carried out some of the seminar work on addressing the problem of information gathering planning in general. His early Sage system (Knoblock 1995; 1996) provided an initial approach that has been superseded by his Planning by Rewriting (PbR) framework (Ambite Knoblock 1998). PbR aims to provide a scalable approach based upon the generation of an initial query plan that is then iteratively worked on to improve its quality. Ambite Knoblock (1998) show promising experimental results that indicate that the PbR approach scales sufficiently well to address real world ....

....(Knoblock 1995; 1996) provided an initial approach that has been superseded by his Planning by Rewriting (PbR) framework (Ambite Knoblock 1998) PbR aims to provide a scalable approach based upon the generation of an initial query plan that is then iteratively worked on to improve its quality. Ambite Knoblock (1998) show promising experimental results that indicate that the PbR approach scales sufficiently well to address real world problems. Occam (Kwok Weld 1996) is an informationgathering planner designed to work with the Internet. This system builds upon the Group s work on the more general problem of ....

Ambite, J., and Knoblock, C., 1998, Flexible and Scalable Query Planning in Distributed and Heterogeneous Environments. In Proc Fourth International Conference on Artificial Intelligence Planning Systems, USA.

....where each component in the mediator is defined in terms of the schemas exported by the wrappers. The expansion can result in an exponential number of terms. Knowledge of capability, contents or coverage of the sources are not considered to simplify this mediator task. The mediators presented in [3, 10, 12, 20, 26, 43], maintain information about the query capabilities of the sources and use them to produce safe, maximal plans. However, since none of them export a single interface reflecting the capability of the mediator, they may also accept queries and generate subqueries for which there is not a safe source ....

Ambite J.L., et al ., "Flexible and Scalable Query Planning in Distributed and Heterogeneous Environments ". In Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems 1998.

No context found.

Ambite, J. L., and Knoblock, C. A. 1998. Flexible and scalable query planning in distributed and heterogeneous environments. In Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems.

....phase. The first step is executed once, when the application is first initialized. The second step is executed each time the mediator receives a query. Axiom Compilation. The reasoning done by the mediator about the domain model leverages the results of an initial domain axiom compilation step (Ambite et al. 1998) that generates rules about what source combinations can be used to solve various domain queries. Specifically, axiom compilation is based on applying a set of inference rules to construct a lattice describing how various combinations of data modeled at the domain level can be retrieved given the ....

Ambite, J.L. and Knoblock, C.A. 1998. Flexible and Scalable Query Planning in Distributed and Heterogeneous Environments. Proc of 4 th Intl Conf on Artificial Intelligence Planning Systems, Pittsburgh, PA.

....based on comparing initial and optimal plans. We report results for several planning domains showing that the learned rules are competitive with manually speci#ed ones, and in several cases the learning algorithm discovered novel rewriting rules. Introduction Planning by Rewriting #PbR# #Ambite Knoblock 1997; 1998; Ambite 1998# is a planning framework that has shown better scalability than other domainindependent approaches. In addition, PbR works with complex models of plan quality and has an anytime behavior. The basic idea of PbR is to #rst generate a possibly suboptimal initial plan, and then, ....

....and optimal plans. We report results for several planning domains showing that the learned rules are competitive with manually speci#ed ones, and in several cases the learning algorithm discovered novel rewriting rules. Introduction Planning by Rewriting #PbR# #Ambite Knoblock 1997; 1998; Ambite 1998# is a planning framework that has shown better scalability than other domainindependent approaches. In addition, PbR works with complex models of plan quality and has an anytime behavior. The basic idea of PbR is to #rst generate a possibly suboptimal initial plan, and then, iteratively rewrite ....

[Article contains additional citation context not shown here]

Ambite, J. L., and Knoblock, C. A. 1998. Flexible and scalable query planning in distributed and heterogeneous environments. In Proceedings of the Fourth International ConferenceonArti#cial Intelligence Planning Systems.

....based on comparing initial and optimal plans. We report results for several planning domains showing that the learned rules are competitive with manually specified ones, and in several cases the learning algorithm discovered novel rewriting rules. Introduction Planning by Rewriting (PbR) (Ambite Knoblock 1997; 1998; Ambite 1998) is a planning framework that has shown better scalability than other domainindependent approaches. In addition, PbR works with complex models of plan quality and has an anytime behavior. The basic idea of PbR is to first generate a possibly suboptimal initial plan, and then, ....

....and optimal plans. We report results for several planning domains showing that the learned rules are competitive with manually specified ones, and in several cases the learning algorithm discovered novel rewriting rules. Introduction Planning by Rewriting (PbR) Ambite Knoblock 1997; 1998; Ambite 1998) is a planning framework that has shown better scalability than other domainindependent approaches. In addition, PbR works with complex models of plan quality and has an anytime behavior. The basic idea of PbR is to first generate a possibly suboptimal initial plan, and then, iteratively rewrite ....

[Article contains additional citation context not shown here]

Ambite, J. L., and Knoblock, C. A. 1998. Flexible and scalable query planning in distributed and heterogeneous environments. In Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems.

....phase. The first step is executed once, when the application is first initialized. The second step is executed dynamically, on a per query basis. 3.1.2. 1 Axiom Compilation The reasoning done by the mediator about the domain model leverages the results of an initial domain axiom compilation step [Ambite et al. 1998], which generates rules about what source combinations can be used to solve various domain queries (and subqueries) Specifically, axiom compilation is based on applying a set of inference rules to construct a lattice describing how various combinations of data modeled at the domain level can be ....

Ambite, J.L. and Knoblock, C.A. 1998. Flexible and Scalable Query Planning in Distributed and Heterogeneous Environments. Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems, Pittsburgh, PA.

No context found.

C.A.Kno4x ck J.L. Ambite. Flexible and scalable query planning in distributed and ts. In Proc. of the 4th Int. Conf. on Artificial Intelligence Planning Systems. AAAI, 1998.

No context found.

J.L. Ambite and C.A. Knoblock, "Flexible and scalable query planning in distributed and heterogeneous environments," in Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems, Pitsburg, USA, June 1998.

No context found.

J. L. Ambite and C. A. Knoblock. Flexible and Scalable Query Planning in Distributed and Heterogeneous Environments. In Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems, pages 3--10, Pittsburgh, Pennsylvania, USA, June 1998.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC