3341 search results - page 297 / 669 » On Bounded Queries and Approximation |
178
click to vote
VLDB
2005
ACM
16 years 6 days ago
2005
ACM
This paper addresses the efficient processing of top-k queries in wide-area distributed data repositories where the index lists for the attribute values (or text terms) of a query...
159
Voted
SSD
1993
Springer
15 years 10 months ago
1993
Springer
: Due to the high complexity of objects and queries and also due to extremely large data volumes, geographic database systems impose stringent requirements on their storage and acc...
176
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
The cost of a query plan depends on many parameters, such as predicate selectivities and available memory, whose values may not be known at optimization time. Parametric query opt...
143
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
323
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
The ability to store and query uncertain information is of great benefit to databases that infer values from a set of observations, including databases of moving objects, sensor r...