Please use this identifier to cite or link to this item:
|Title:||A SAT approach to query optimization in mediator systems||Authors:||Prestwich, S.
|Issue Date:||2005||Citation:||Prestwich, S.,Bressan, S. (2005). A SAT approach to query optimization in mediator systems. Annals of Mathematics and Artificial Intelligence 43 (1-4) : 195-210. ScholarBank@NUS Repository. https://doi.org/10.1007/s10472-004-9429-9||Abstract:||Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their effective use requires the solution of hard query optimization problems. This is usually done in two phases: the selection of a set of data sources is similar to a set covering problem, and their ordering into a feasible and efficient query is a capability restricted join order problem. However, a two-phase approach is unlikely to find optimum queries. We describe a new single-phase approach that, under a simple cost model, can be encoded and solved as a SAT problem. Results on artificial benchmarks indicate that this is an interesting problem from the encoding and search viewpoints, and we use them to address three of the ten SAT challenges posed by Selman, Kautz and McAllester in 1997.||Source Title:||Annals of Mathematics and Artificial Intelligence||URI:||http://scholarbank.nus.edu.sg/handle/10635/42323||ISSN:||10122443||DOI:||10.1007/s10472-004-9429-9|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 14, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.