3652 search results - page 289 / 731 » A study of query length |
142
click to vote
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...
253
Voted
SIGIR
2011
ACM
14 years 6 months ago
2011
ACM
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
156
Voted
CIKM
2011
Springer
14 years 3 months ago
2011
Springer
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...
187
Voted
ICDE
2012
IEEE
14 years 2 months ago
2012
IEEE
Top-k pairs queries have received significant attention by the research community. k-closest pairs queries, k-furthest pairs queries and their variants are among the most well stu...
153
Voted
ISCI
2007
15 years 3 months ago
2007
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...