Distance join queries on spatial networks

The result of a distance join operation on two sets of objects R, S on a spatial network G is a set P of object pairs <p, q>, p R, q S such that the distance of an object pair <p, q> is the shortest distance from p to q in G. Several variations to the distance join operation such as UnOrdered, Incremental, Top-k, Semi-Join impose additional constraints on the distance between the object pairs in P, the ordering of object pairs in P, and on the cardinality of P. A distance join algorithm on spatial networks is proposed that works in conjunction with the SILC framework, which is a new approach to query processing on spatial networks. Experimental results demonstrate up to an order of magnitude speed up when compared with a prominent existing technique. Categories and Subject Descriptors H.2.8 [Database Management]: Database Applications-Spatial Databases and GIS; E.1 [Data Structures]: Graphs and Networks; H.2.4 [Database Management]: Systems-Query Processing General Terms...

• Type: Conference
• Year: 2006
• Where: GIS
• Authors: Jagan Sankaranarayanan, Houman Alborzi, Hanan Samet
• Keywords: Database, Distance Join Algorithm, Distance Join Operation, GIS 2006, Spatial Networks