Sciweavers

314 search results - page 10 / 63
» Querying Imprecise Data in Moving Object Environments
Sort
View
EDBT
2010
ACM
185views Database» more  EDBT 2010»
13 years 9 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 1 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
CDB
2004
Springer
127views Database» more  CDB 2004»
14 years 27 days ago
Moving Objects and Their Equations of Motion
Moving objects are currently represented in databases by means of an explicit representation of their trajectory. However from a physical point of view, or more specifically accor...
Floris Geerts
GIS
2008
ACM
13 years 8 months ago
Snapshot location-based query processing on moving objects in road networks
Location-based services are increasingly popular and it is a key challenge to efficiently support query processing. We present a novel design to process large numbers of location...
Haojun Wang, Roger Zimmermann
ICDE
2005
IEEE
172views Database» more  ICDE 2005»
14 years 1 months ago
Monitoring K-Nearest Neighbor Queries Over Moving Objects
Many location-based applications require constant monitoring of k-nearest neighbor (k-NN) queries over moving objects within a geographic area. Existing approaches to this problem...
Xiaohui Yu, Ken Q. Pu, Nick Koudas