137 search results - page 19 / 28 » Efficient Processing of Top-k Spatial Preference Queries |
ADC
2007
Springer
13 years 10 months ago
2007
Springer
With the explosion of video data, video processing technologies have advanced quickly and been applied into many fields, such as advertisements, medical etc.. To fast search these...
DKE
2006
13 years 6 months ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
SSDBM
1998
IEEE
13 years 11 months ago
1998
IEEE
: A new issue that arises in modern applications involves the efficient manipulation of (static or moving) spatial objects, and the relationships among them. As a result, modern da...
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
In this demonstration we present MAPLE, a scalable peer-to-peer Nearest Neighbor (NN) query system for mobile environments. MAPLE is designed for the efficient sharing of query re...
SIGMOD
2006
ACM
14 years 6 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...