55 search results - page 1 / 11 » Processing Distance Join Queries with Constraints |
89
Voted
CJ
2006
15 years 1 months ago
2006
216
Voted
GIS
2006
ACM
16 years 2 months ago
2006
ACM
The result of a distance join operation on two sets of objects R, S on a spatial network G is a set P of object pairs <p, q>, p R, q S such that the distance of an object ...
113
Voted
ADBIS
2003
Springer
15 years 6 months ago
2003
Springer
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
116
Voted
DKE
2006
15 years 1 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....
130
Voted
CIKM
2006
Springer
15 years 4 months ago
2006
Springer
In an uncertain database, each data item is modeled as a range associated with a probability density function. Previous works for this kind of data have focussed on simple queries...