Sciweavers

282 search results - page 9 / 57
» Robust Query Processing through Progressive Optimization
Sort
View

Publication
151views
12 years 8 months ago
Robust Bayesian reinforcement learning through tight lower bounds
In the Bayesian approach to sequential decision making, exact calculation of the (subjective) utility is intractable. This extends to most special cases of interest, such as reinfo...
Christos Dimitrakakis
VLDB
1995
ACM
96views Database» more  VLDB 1995»
14 years 1 months ago
The Fittest Survives: An Adaptive Approach to Query Optimization
Traditionally, optimizers are “programmed” to optimize queries following a set of buildin procedures. However, optimizers should be robust to its changing environment to gener...
Hongjun Lu, Kian-Lee Tan, Son Dao
VLDB
2001
ACM
94views Database» more  VLDB 2001»
14 years 2 months ago
FeedbackBypass: A New Approach to Interactive Similarity Query Processing
In recent years, several methods have been proposed for implementing interactive similarity queries on multimedia databases. Common to all these methods is the idea to exploit use...
Ilaria Bartolini, Paolo Ciaccia, Florian Waas
WEBDB
2009
Springer
112views Database» more  WEBDB 2009»
14 years 4 months ago
Querying DAG-shaped Execution Traces Through Views
The question whether a given set of views, defined by queries, can be used to answer another query, arises in several contexts such as query optimization, data integration and se...
Maya Ben-Ari, Tova Milo, Elad Verbin
SIGMOD
2002
ACM
137views Database» more  SIGMOD 2002»
13 years 9 months ago
Partial results for online query processing
Traditional query processors generate full, accurate query results, either in batch or in pipelined fashion. We argue that this strict model is too rigid for exploratory queries o...
Vijayshankar Raman, Joseph M. Hellerstein