37 search results - page 1 / 8 » On-line exact shortest distance query processing |
EDBT
2009
ACM
14 years 6 months ago
2009
ACM
ICDE
2008
IEEE
15 years 16 days ago
2008
IEEE
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...
SSDBM
1999
IEEE
14 years 3 months ago
1999
IEEE
On-Line Analytical Processing (OLAP) technologies are being used widely, but the lack of effective means of handling data imprecision, which occurs when exact values are not known...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We provide the first linear-space data structure with provable sublinear query time for exact point-topoint shortest path queries in planar graphs. We prove that for any planar gr...
SSD
2005
Springer
14 years 4 months ago
2005
Springer
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...