Sciweavers

168 search results - page 15 / 34
» Incremental Distance Join Algorithms for Spatial Databases
Sort
View
GIS
2009
ACM
14 years 9 months ago
Map-Matching for Low-Sampling-Rate GPS Trajectories
Map-matching is the process of aligning a sequence of observed user positions with the road network on a digital map. It is a fundamental pre-processing step for many applications...
Yin Lou, Chengyang Zhang, Yu Zheng, Xing Xie, Wei ...
JOIN
2007
91views more  JOIN 2007»
13 years 7 months ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest
SSD
2005
Springer
98views Database» more  SSD 2005»
14 years 1 months ago
Medoid Queries in Large Spatial Databases
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the closest branch is minimized. This is an instance of the ...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
SIGMOD
2010
ACM
228views Database» more  SIGMOD 2010»
14 years 21 days ago
Probabilistic string similarity joins
Edit distance based string similarity join is a fundamental operator in string databases. Increasingly, many applications in data cleaning, data integration, and scientific compu...
Jeffrey Jestes, Feifei Li, Zhepeng Yan, Ke Yi
SIGMOD
2004
ACM
150views Database» more  SIGMOD 2004»
14 years 1 months ago
Clustering Objects on a Spatial Network
Clustering is one of the most important analysis tasks in spatial databases. We study the problem of clustering objects, which lie on edges of a large weighted spatial network. Th...
Man Lung Yiu, Nikos Mamoulis