90 search results - page 16 / 18 » Continuous obstructed nearest neighbor queries in spatial da... |
ICDE
2009
IEEE
14 years 7 months ago
2009
IEEE
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...
VLDB
2006
ACM
15 years 5 months ago
2006
ACM
This paper tackles a major privacy concern in current location-based services where users have to continuously report their locations to the database server in order to obtain the ...
DKE
2006
13 years 5 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....
VLDB
2004
ACM
13 years 11 months ago
2004
ACM
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
DEBU
2010
13 years 5 months ago
2010
The popularity of location-based services and the need to perform real-time processing on them has led to an interest in queries on road networks, such as finding shortest paths a...