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...
Kernel functions as similarity measures for sequential data have been extensively studied in previous research. This contribution addresses the efficient computation of distance fu...
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...
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 ...
Demetrios Zeinalipour-Yazti, Song Lin, Dimitrios G...
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...