Sciweavers

5221 search results - page 276 / 1045
» An On-line Problem Database
Sort
View
SIGMOD
2011
ACM
267views Database» more  SIGMOD 2011»
14 years 9 months ago
A latency and fault-tolerance optimizer for online parallel query plans
We address the problem of making online, parallel query plans fault-tolerant: i.e., provide intra-query fault-tolerance without blocking. We develop an approach that not only achi...
Prasang Upadhyaya, YongChul Kwon, Magdalena Balazi...
ICDE
2009
IEEE
149views Database» more  ICDE 2009»
16 years 8 months ago
Online Tuning of Aggregation Tables for OLAP
Materializing results from complex aggregation queries helps to significantly improve response times in OLAP servers. This problem is known as the view selection problem: choosing ...
Katja Hose, Daniel Klan, Kai-Uwe Sattler
ICDE
2007
IEEE
163views Database» more  ICDE 2007»
16 years 8 months ago
Adding Context to Preferences
To handle the overwhelming amount of information currently available, personalization systems allow users to specify the information that interests them through preferences. Most ...
Kostas Stefanidis, Evaggelia Pitoura, Panos Vassil...
ICML
2000
IEEE
16 years 7 months ago
Meta-Learning by Landmarking Various Learning Algorithms
Landmarking is a novel approach to describing tasks in meta-learning. Previous approaches to meta-learning mostly considered only statistics-inspired measures of the data as a sou...
Bernhard Pfahringer, Hilan Bensusan, Christophe G....
SIGMOD
2005
ACM
87views Database» more  SIGMOD 2005»
16 years 6 months ago
When Can We Trust Progress Estimators for SQL Queries?
The problem of estimating progress for long-running queries has recently been introduced. We analyze the characteristics of the progress estimation problem, from the perspective o...
Surajit Chaudhuri, Raghav Kaushik, Ravishankar Ram...