301 search results - page 22 / 61 » Efficient Sketches for the Set Query Problem |
185
click to vote
SIGMOD
2006
ACM
15 years 11 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
120
click to vote
VLDB
2002
ACM
14 years 10 months ago
2002
ACM
In spite of the many decades of progress in database research, surprisingly scientists in the life sciences community still struggle with inefficient and awkward tools for queryin...
TKDE
2008
14 years 11 months ago
2008
The computational grid is rapidly evolving into a service-oriented computing infrastructure that facilitates resource sharing and large-scale problem solving over the Internet. Ser...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We present a decomposition-based approach to managing probabilistic information. We introduce world-set decompositions (WSDs), a space-efficient and complete representation system ...
IIS
2004
15 years 12 days ago
2004
Estimating the result size of a join is an important query optimization problem as it determines the choice of a good query evaluation strategy. Yet, there are few efficient techni...