Sciweavers

10 search results - page 1 / 2
» Indexing Fast Moving Objects for kNN Queries Based on Neares...
Sort
View
GEOINFORMATICA
2006
133views more  GEOINFORMATICA 2006»
13 years 4 months ago
Indexing Fast Moving Objects for kNN Queries Based on Nearest Landmarks
With the rapid advancements in positioning technologies such as the Global Positioning System (GPS) and wireless communications, the tracking of continuously moving objects has bec...
Dan Lin, Rui Zhang 0003, Aoying Zhou
EDBT
2010
ACM
185views Database» more  EDBT 2010»
13 years 6 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
ICDE
2007
IEEE
206views Database» more  ICDE 2007»
14 years 6 months ago
Efficiently Processing Continuous k-NN Queries on Data Streams
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
Beng Chin Ooi, Christian Böhm, Claudia Plant,...
ICDE
2007
IEEE
192views Database» more  ICDE 2007»
14 years 6 months ago
APLA: Indexing Arbitrary Probability Distributions
The ability to store and query uncertain information is of great benefit to databases that infer values from a set of observations, including databases of moving objects, sensor r...
Vebjorn Ljosa, Ambuj K. Singh
EDBT
2006
ACM
159views Database» more  EDBT 2006»
14 years 5 months ago
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
Haibo Hu, Dik Lun Lee, Jianliang Xu