Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorWang, Siboen
dc.contributor.authorXiao, Xiaokuien
dc.contributor.authorYang, Yinen
dc.contributor.authorLin, Wenqingen
dc.identifier.citationWang, S., Xiao, X., Yang, Y., & Lin, W. (2016). Effective indexing for approximate constrained shortest path queries on large road networks. Proceedings of the VLDB Endowment, 10(2), 61-72.en
dc.description.abstractIn a constrained shortest path (CSP) query, each edge in the road network is associated with both a length and a cost. Given an origin s, a destination t, and a cost constraint θ, the goal is to find the shortest path from s to t whose total cost does not exceed θ. Because exact CSP is NP-hard, previous work mostly focuses on approximate solutions. Even so, existing methods are still prohibitively expensive for large road networks. Two main reasons are (i) that they fail to utilize the special properties of road networks and (ii) that most of them process queries without indices; the few existing indices consume large amounts of memory and yet have limited effectiveness in reducing query costs. Motivated by this, we propose COLA, the first practical solution for approximate CSP processing on large road networks. COLA exploits the facts that a road network can be effectively partitioned, and that there exists a relatively small set of landmark vertices that commonly appear in CSP results. Accordingly, COLA indexes the vertices lying on partition boundaries, and applies an on-the-fly algorthm called α-Dijk for path computation within a partition, which effectively prunes paths based on landmarks. Extensive experiments demonstrate that on continent-sized road networks, COLA answers an approximate CSP query in sub-second time, whereas existing methods take hours. Interestingly, even without an index, the α-Dijk algorithm in COLA still outperforms previous solutions by more than an order of magnitude.en
dc.description.sponsorshipMOE (Min. of Education, S’pore)en
dc.format.extent12 p.en
dc.relation.ispartofseriesProceedings of the VLDB Endowmenten
dc.rightsThis work is licensed under the Creative Commons AttributionNonCommercial-NoDerivatives 4.0 International License. To view a copy of this license, visit For any use beyond those covered by this license, obtain permission by emailing
dc.subjectConstrained shortest pathen
dc.subjectLarge road networksen
dc.titleEffective indexing for approximate constrained shortest path queries on large road networksen
dc.typeConference Paperen
dc.contributor.schoolSchool of Computer Science and Engineeringen
dc.contributor.conferenceProceedings of the VLDB Endowmenten
dc.description.versionPublished versionen
item.fulltextWith Fulltext-
Appears in Collections:SCSE Conference Papers

Citations 10

Updated on May 26, 2023

Page view(s) 20

Updated on Jun 2, 2023

Download(s) 20

Updated on Jun 2, 2023

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.