137 search results - page 10 / 28 » Efficient Processing of Top-k Spatial Preference Queries |
ICDE
2011
IEEE
12 years 10 months ago
2011
IEEE
—In this demonstration paper, we present a powerful distributed framework for finding similar trajectories in a smartphone network, without disclosing the traces of participatin...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— In contrast to the traditional wireless sensor network (WSN) applications that perform only data collection and aggregation, new generation of information processing applicatio...
DASFAA
2004
IEEE
13 years 10 months ago
2004
IEEE
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
PODS
2008
ACM
14 years 6 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...
EDBT
2004
ACM
14 years 6 months ago
2004
ACM
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are dire...