2217 search results - page 67 / 444 » Rank-aware Query Optimization |
246
click to vote
ICDE
2003
IEEE
16 years 6 months ago
2003
IEEE
Query optimizers use base-table statistics to derive statistics on the sub-plans that are enumerated during optimization. In practice, traditional optimizers rely on a number of s...
236
click to vote
VLDB
2002
ACM
16 years 5 months ago
2002
ACM
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 ...
133
click to vote
EDBT
2010
ACM
15 years 11 months ago
2010
ACM
: © 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...
139
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
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...
124
click to vote
ICDT
2005
ACM
15 years 10 months ago
2005
ACM
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...