%0 Journal Article %1 Calì:jucs_15_1:dynamic_query_optimization_under %A Calì, A. %A Calvanese, D. %A Martinenghi, D. %D 2009 %J #j-jucs# %K %N 1 %P 33--62 %T Dynamic Query Optimization under Access Limitations and Dependencies %V 15 %X Unlike relational tables in a database, data sources on the Web typically can only be accessed in limited ways. In particular, some of the source fields may be required as input and thus need to be mandatorily filled in order to access the source. Answering queries over sources with access limitations is a complex task that requires a possibly recursive evaluation even when the query is non-recursive. After reviewing the main techniques for query answering in this context, in this article we consider the impact of functional and inclusion dependencies on dynamic query optimization under access limitations. In particular, we address the implication problem for functional dependencies and simple full-width inclusion dependencies, and prove that it can be decided in polynomial time. Then we provide necessary and sufficient conditions, baseon the dependencies together with the data retrieved at a certain step of the query answering process, that allow avoiding unnecessary accesses to the sources.

@article{Calì:jucs_15_1:dynamic_query_optimization_under, abstract = {Unlike relational tables in a database, data sources on the Web typically can only be accessed in limited ways. In particular, some of the source fields may be required as input and thus need to be mandatorily filled in order to access the source. Answering queries over sources with access limitations is a complex task that requires a possibly recursive evaluation even when the query is non-recursive. After reviewing the main techniques for query answering in this context, in this article we consider the impact of functional and inclusion dependencies on dynamic query optimization under access limitations. In particular, we address the implication problem for functional dependencies and simple full-width inclusion dependencies, and prove that it can be decided in polynomial time. Then we provide necessary and sufficient conditions, baseon the dependencies together with the data retrieved at a certain step of the query answering process, that allow avoiding unnecessary accesses to the sources.}, added-at = {2011-04-20T14:27:14.000+0200}, author = {Calì, A. and Calvanese, D. and Martinenghi, D.}, biburl = {https://www.bibsonomy.org/bibtex/2b2230b333e1f72e1008ed80ac1aca3a3/szagorac}, interhash = {9f4f8f736736712634ac115807191669}, intrahash = {b2230b333e1f72e1008ed80ac1aca3a3}, journal = {#j-jucs#}, keywords = {}, note = {\url|http://www.jucs.org/jucs_15_1/dynamic_query_optimization_under|}, number = 1, pages = {33--62}, timestamp = {2011-04-20T14:27:14.000+0200}, title = {Dynamic Query Optimization under Access Limitations and Dependencies}, volume = 15, year = 2009 }