Sciweavers

119 search results - page 8 / 24
» Complex Preferences for Answer Set Optimization
Sort
View
SIGMOD
1999
ACM
101views Database» more  SIGMOD 1999»
14 years 4 days ago
Join Synopses for Approximate Query Answering
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
Swarup Acharya, Phillip B. Gibbons, Viswanath Poos...
AMAI
2006
Springer
13 years 8 months ago
Strong order equivalence
Abstract. Recently, notions of equivalence for Answer Set Programming have been studied intensively and were shown to be beneficial for modular programming and automated optimizati...
Wolfgang Faber, Kathrin Konczak
GECCO
2007
Springer
157views Optimization» more  GECCO 2007»
14 years 2 months ago
Convergence phases, variance trajectories, and runtime analysis of continuous EDAs
Considering the available body of literature on continuous EDAs, one must state that many important questions are still unanswered, e.g.: How do continuous EDAs really work, and h...
Jörn Grahl, Peter A. N. Bosman, Stefan Minner
DLOG
2008
13 years 10 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
EDBT
2002
ACM
125views Database» more  EDBT 2002»
14 years 8 months ago
Estimating Answer Sizes for XML Queries
Abstract. Estimating the sizes of query results, and intermediate results, is crucial to many aspects of query processing. In particular, it is necessary for effective query optimi...
Yuqing Wu, Jignesh M. Patel, H. V. Jagadish