Sciweavers

2987 search results - page 233 / 598
» Multiobjective Query Optimization
Sort
View
EOR
2010
104views more  EOR 2010»
14 years 11 months ago
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
Fatih Safa Erenay, Ihsan Sabuncuoglu, Aysegül...
VLDB
2002
ACM
157views Database» more  VLDB 2002»
16 years 2 months ago
A formal perspective on the view selection problem
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
Rada Chirkova, Alon Y. Halevy, Dan Suciu
EDBT
2010
ACM
122views Database» more  EDBT 2010»
15 years 9 months ago
Self-selecting, self-tuning, incrementally optimized indexes
: © Self-selecting, self-tuning, incrementally optimized indexes Goetz Graefe, Harumi Kuno HP Laboratories HPL-2010-24 database index, adaptive, autonomic, query execution In a re...
Goetz Graefe, Harumi A. Kuno
COMPGEOM
2010
ACM
15 years 7 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
ICDT
2005
ACM
124views Database» more  ICDT 2005»
15 years 7 months ago
Optimal Distributed Declustering Using Replication
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
Keith B. Frikken