Sciweavers

Share
SIGMOD
2004
ACM
150views Database» more  SIGMOD 2004»
10 years 5 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
AAIM
2009
Springer
119views Algorithms» more  AAIM 2009»
10 years 6 months ago
Link Distance and Shortest Path Problems in the Plane
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the FrĀ“echet distance in the plane with polygonal obstacles. Distances between points are measured eithe...
Atlas F. Cook, Carola Wenk
GIS
2007
ACM
11 years 22 days ago
Proximity queries in large traffic networks
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
11 years 1 months ago
Efficient Query Processing in Large Traffic Networks
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
books