Sciweavers

50 search results - page 1 / 10
» Distance join queries on spatial networks
Sort
View
GIS
2006
ACM
14 years 5 months ago
Distance join queries on spatial networks
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 ...
Jagan Sankaranarayanan, Houman Alborzi, Hanan Same...
ADBIS
2003
Springer
95views Database» more  ADBIS 2003»
13 years 10 months ago
Distance Join Queries of Multiple Inputs in Spatial Databases
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...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
ICDE
2009
IEEE
219views Database» more  ICDE 2009»
14 years 6 months ago
Distance Oracles for Spatial Networks
The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding s...
Jagan Sankaranarayanan, Hanan Samet
PODS
2004
ACM
96views Database» more  PODS 2004»
14 years 5 months ago
Roads, Codes and Spatiotemporal Queries
We present a novel coding-based technique for answering spatial and spatiotemporal queries on objects moving along a system of curves on the plane such as many road networks. We h...
Sandeep Gupta, Swastik Kopparty, Chinya V. Ravisha...
DKE
2006
123views more  DKE 2006»
13 years 4 months ago
Cost models for distance joins queries using R-trees
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....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...