6004 search results - page 195 / 1201 » Parallelizing query optimization |
238
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 12 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...
141
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...
171
Voted
FOCS
1998
IEEE
15 years 9 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
162
click to vote
CVDB
2005
ACM
15 years 7 months ago
2005
ACM
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...