Sciweavers

360 search results - page 1 / 72
» Dynamic Sample Selection for Approximate Query Processing
Sort
View
SIGMOD
2003
ACM
172views Database» more  SIGMOD 2003»
14 years 4 months ago
Dynamic Sample Selection for Approximate Query Processing
In decision support applications, the ability to provide fast approximate answers to aggregation queries is desirable. One commonly-used technique for approximate query answering ...
Brian Babcock, Surajit Chaudhuri, Gautam Das
ADC
2007
Springer
145views Database» more  ADC 2007»
13 years 10 months ago
Selectivity Estimation by Batch-Query based Histogram and Parametric Method
Histograms are used extensively for selectivity estimation and approximate query processing. Workloadaware dynamic histograms can self-tune itself based on query feedback without ...
Jizhou Luo, Xiaofang Zhou, Yu Zhang, Heng Tao Shen...
ICML
2010
IEEE
13 years 5 months ago
Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zi...
EDBT
2009
ACM
160views Database» more  EDBT 2009»
13 years 9 months ago
Estimating aggregates in time-constrained approximate queries in Oracle
The concept of time-constrained SQL queries was introduced to address the problem of long-running SQL queries. A key approach adopted for supporting time-constrained SQL queries i...
Ying Hu, Seema Sundara, Jagannathan Srinivasan
SIGMOD
2004
ACM
150views Database» more  SIGMOD 2004»
14 years 4 months ago
When one Sample is not Enough: Improving Text Database Selection Using Shrinkage
Database selection is an important step when searching over large numbers of distributed text databases. The database selection task relies on statistical summaries of the databas...
Panagiotis G. Ipeirotis, Luis Gravano