Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/117660
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Computing | - |
| dc.creator | Li, J | - |
| dc.creator | An, Q | - |
| dc.creator | Song, Y | - |
| dc.creator | Xiong, X | - |
| dc.creator | Li, L | - |
| dc.creator | Jin, F | - |
| dc.creator | Zhou, X | - |
| dc.date.accessioned | 2026-02-26T03:47:51Z | - |
| dc.date.available | 2026-02-26T03:47:51Z | - |
| dc.identifier.issn | 1066-8888 | - |
| dc.identifier.uri | http://hdl.handle.net/10397/117660 | - |
| dc.language.iso | en | en_US |
| dc.publisher | Association for Computing Machinery | en_US |
| dc.rights | © The Author(s) 2025 | en_US |
| dc.rights | Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. | en_US |
| dc.rights | The following publication Li, J., An, Q., Song, Y. et al. Route optimization with collective spatial keywords: A skyline-based approach. The VLDB Journal 34, 61 (2025) is available at https://doi.org/10.1007/s00778-025-00940-w. | en_US |
| dc.subject | Optimization Strategies | en_US |
| dc.subject | Shortest Path | en_US |
| dc.subject | Skyline | en_US |
| dc.subject | Spatial Keyword | en_US |
| dc.title | Route optimization with collective spatial keywords : a skyline-based approach | en_US |
| dc.type | Journal/Magazine Article | en_US |
| dc.identifier.volume | 34 | - |
| dc.identifier.issue | 5 | - |
| dc.identifier.doi | 10.1007/s00778-025-00940-w | - |
| dcterms.abstract | With the development of location-based services, smart cities, and intelligent transportation, route planning has evolved beyond shortest path finding to satisfy user’s flexible travel purposes through the Optimal Routes with Collective Spatial Keywords (ORCSK) routing. Because different Points of Interest (POIs) contain different sets of keywords, the user usually needs to visit multiple POIs to fulfill all needs. Moreover, the POIs’ stop hardness (time and cost) also influences user experience, but it was ignored by the existing solutions. Therefore, this work proposes to extend the ORCSK problem into Skyline Optimal Routes with Collective Spatial Keyword (Sky-ORCSK) by considering both distance and stop hardness. Specifically, we first propose the IG-Sky algorithm from the spatial keyword search perspective by extending the IG-Tree. Then we propose the DA-Sky algorithm from the path enumeration perspective by extending our previous DA-CSK. Furthermore, five optimization strategies are proposed to improve efficiency by pruning the search space. Extensive experimental evaluations on real-world datasets demonstrate the algorithms’ efficacy and reliability, marking a significant step forward in refined route planning for modern urban environments. | - |
| dcterms.accessRights | open access | en_US |
| dcterms.bibliographicCitation | VLDB journal, Sept 2025, v. 34, no. 5, 61 | - |
| dcterms.isPartOf | VLDB journal | - |
| dcterms.issued | 2025-09 | - |
| dc.identifier.scopus | 2-s2.0-105014605691 | - |
| dc.identifier.eissn | 0949-877X | - |
| dc.identifier.artn | 61 | - |
| dc.description.validate | 202602 bcch | - |
| dc.description.oa | Version of Record | en_US |
| dc.identifier.FolderNumber | OA_Scopus/WOS | en_US |
| dc.description.fundingSource | RGC | en_US |
| dc.description.fundingSource | Others | en_US |
| dc.description.fundingText | The research work was partially supported by the Key Research and Development Program of Liaoning Province under Grant No.2023JH26/10300022, the Shenyang Young and Middle-aged Scientific and Technological Innovation Talent Support Plan under Grant No.RC220504, Natural Science Foundation of China #62202116, Guangzhou?HKUST(GZ) Joint Funding Scheme #2023A03J0135, Guangzhou Basic and Applied Basic Research Scheme #2024A04J4455, Guangdong-Hong Kong Technology Innovation Joint Funding #2024A0505040012, Hong Kong Research Grants Council grant# 16202722, and partially conducted in the JC STEM Lab of Data Science Foundations funded by The Hong Kong Jockey Club Charities Trust. | en_US |
| dc.description.pubStatus | Published | en_US |
| dc.description.oaCategory | CC | en_US |
| Appears in Collections: | Journal/Magazine Article | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| s00778-025-00940-w.pdf | 1.78 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.



