153 search results - page 4 / 31 » Efficient top-k processing over query-dependent functions |
PODS
2008
ACM
14 years 8 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
DAGM
2006
Springer
14 years 7 days ago
2006
Springer
Kernel functions as similarity measures for sequential data have been extensively studied in previous research. This contribution addresses the efficient computation of distance fu...
DMSN
2005
ACM
13 years 10 months ago
2005
ACM
In this paper we present the Threshold Join Algorithm (TJA), which is an efficient TOP-k query processing algorithm for distributed sensor networks. The objective of a top-k query...
CIKM
2006
Springer
14 years 9 days ago
2006
Springer
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...
ICDCS
2007
IEEE
14 years 13 days ago
2007
IEEE
On-line decision making often involves query processing over time-varying data which arrives in the form of data streams from distributed locations. In such environments typically...