709 search results - page 3 / 142 » Efficient Evaluation of All-Nearest-Neighbor Queries |
ADBIS
2004
Springer
13 years 11 months ago
2004
Springer
In this paper we consider concurrent execution of multiple data mining queries in the context of discovery of frequent itemsets. If such data mining queries operate on similar part...
SIGMOD
2006
ACM
14 years 6 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
ICDE
2007
IEEE
14 years 7 months ago
2007
IEEE
In location-based services, it is common for a user to issue a query based on his/her current position. One such example is "find the available cabs within two miles of my cu...
PVLDB
2008
13 years 4 months ago
2008
A Reverse k-Nearest-Neighbor (RkNN) query finds the objects that take the query object as one of their k nearest neighbors. In this paper we propose new solutions for evaluating R...
PVLDB
2010
13 years 1 months ago
2010
Experience with relational systems has shown that distribution is an effective way of improving the scalability of query evaluation. In this paper, we show how distributed query e...