Sciweavers

2724 search results - page 150 / 545
» Optimizing Queries on Files
Sort
View
VLDB
2002
ACM
157views Database» more  VLDB 2002»
16 years 3 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 10 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
127
Voted
COMPGEOM
2010
ACM
15 years 8 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
113
Voted
ICDT
2005
ACM
124views Database» more  ICDT 2005»
15 years 9 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
148
Voted
CVDB
2005
ACM
15 years 5 months ago
Optimizing progressive query-by-example over pre-clustered large image databases
The typical mode for querying in an image content-based information system is query-by-example, which allows the user to provide an image as a query and to search for similar imag...
Anicet Kouomou Choupo, Laure Berti-Equille, Annie ...