Query Processing Using Distance Oracles for Spatial Networks

13 years 5 months ago
Query Processing Using Distance Oracles for Spatial Networks
—The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding shortest paths and finding nearest neighbors. The challenge here is that the efficient execution of spatial operations usually involves the computation of distance along a spatial network instead of “as the crow flies,” which is not simple. Techniques are described that enable the determination of the network distance between any pair of points (i.e., vertices) with as little as OðnÞ space rather than having to store the n2 distances between all pairs. This is done by being willing to expend a bit more time to achieve this goal such as Oðlog nÞ instead of Oð1Þ, as well as by accepting an error " in the accuracy of the distance that is provided. The strategy that is adopted reduces the space requirements and is based on the ability to identify groups of source and destination vertices for whic...
Jagan Sankaranarayanan, Hanan Samet
Added 31 Jan 2011
Updated 31 Jan 2011
Type Journal
Year 2010
Where TKDE
Authors Jagan Sankaranarayanan, Hanan Samet
Comments (0)