Abstract | ||
---|---|---|
This paper introduces HLDB, the first practical system that can answer exact spatial queries on continental road networks entirely within a database. HLDB is based on hub labels (HL), the fastest point-to-point algorithm for road networks, and its queries are implemented (quite naturally) in standard SQL. Within the database, HLDB answers exact distance queries and retrieves full shortest-path descriptions in real time, even on networks with tens of millions of vertices. The basic algorithm can be extended in a natural way (still in SQL) to answer much more sophisticated queries, such as finding the ten closest fast-food restaurants. We also introduce efficient new HL-based algorithms for even harder problems, such as best via point, ride sharing, and point of interest prediction. The HLDB framework makes it easy to implement these algorithms in SQL, enabling interactive applications on continental road networks. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1145/2424321.2424365 | SIGSPATIAL/GIS |
Keywords | Field | DocType |
fastest point-to-point algorithm,basic algorithm,exact distance query,location-based service,road network,exact spatial query,standard sql,continental road network,hldb framework,efficient new hl-based algorithm,closest fast-food restaurant,real time,point to point,shortest path,location based service,location services,sql,databases,point of interest | SQL,Data mining,Road networks,Vertex (geometry),Computer science,Location-based service,Point of interest,Database | Conference |
Citations | PageRank | References |
26 | 0.77 | 34 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ittai Abraham | 1 | 1483 | 89.62 |
Daniel Delling | 2 | 2049 | 108.90 |
Amos Fiat | 3 | 3977 | 685.20 |
Andrew V. Goldberg | 4 | 5883 | 676.30 |
Renato F. Werneck | 5 | 1743 | 84.33 |