2987 search results - page 419 / 598 » Multiobjective Query Optimization |
179
click to vote
CORR
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
121
Voted
VLDB
1998
ACM
15 years 6 months ago
1998
ACM
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
120
Voted
EDBT
2004
ACM
16 years 1 months ago
2004
ACM
Due to the large difference between seek time and transfer time in current disk technology, it is advantageous to perform large I/O using a single sequential access rather than mu...
103
click to vote
TPDS
2008
15 years 1 months ago
2008
The efficiency of Peer-to-Peer (P2P) systems is largely dependent on the overlay constructions. Due to the random selection of logical neighbors, there often exists serious topolog...
118
Voted
EDBT
2008
ACM
16 years 1 months ago
2008
ACM
Modern enterprise data warehouses have complex workloads that are notoriously difficult to manage. An important problem in workload management is to run these complex workloads `o...