[1] GAO Y J, QIN X, ZHENG B H, et al.Efficient reverse top-k Boolean spatial keyword queries on road networks[J].IEEE Transactions on Knowledge and Data Engineering, 2015, 27(5):1205-1218. [2] CHOUDHURY F M, CULPEPPER J S, SELLIS T, et al.Maximizing bichromatic reverse spatial and textual k nearest neighbor queries[J].Proceedings of the VLDB Endowment, 2016, 9(6):456-467. [3] CAO X, CHEN L S, CONG G, et al.Keyword-aware optimal route search[J].Proceedings of the VLDB Endowment, 2012, 5(11):1136-1147. [4] CAO X, CHEN L S, CONG G, et al.KORS:keyword-aware optimal route search system[C]//Proceedings of the 29th IEEE International Conference on Data Engineering.Washington D.C., USA:IEEE Press, 2013:1340-1343. [5] 金鹏飞.基于关键词的最优路径查询高效处理方法的研究[D].太原:太原理工大学, 2017. JIN P F. Research on efficient processing method of optimal path query based on keywords[J].Taiyuan:Taiyuan University of Technology, 2017.(in Chinese) [6] 郝晋瑶, 牛保宁, 康家兴.大规模路网图下关键词覆盖最优路径查询优化[J].软件学报, 2020, 31(8):2543-2556. HAO J Y, NIU B N, KANG J X.Optimization of keyword-aware optimal route query on large-scale road networks[J].Journal of Software, 2020, 31(8):2543-2556.(in Chinese) [7] LI Y J, YANG W D, DAN W, et al.Keyword-aware dominant route search for various user preferences[C]//Proceedings of International Conference on Database Systems for Advanced Applications.Washington D.C., USA:IEEE Press, 2015:207-222. [8] 金鹏飞.基于关键词的最优路径查询高效处理方法的研究[D].太原:太原理工大学, 2017. JIN P F.Research on efficient keyword-aware optimal route query processing method[D].Taiyuan:Taiyuan University of Technology, 2017.(in Chinese) [9] YANG Z B, ZENG Y F, DU J Y, et al.Efficient index-independent approaches for the collective spatial keyword queries[J].Neurocomputing, 2021, 439:96-105. [10] ZHANG P F, LIN H Z, GAO Y J, et al.Aggregate keyword nearest neighbor queries on road networks[J].GeoInformatica, 2018, 22(2):237-268. [11] CHAN H K H, LONG C, WONG R C W.On generalizing collective spatial keyword queries[J].IEEE Transactions on Knowledge and Data Engineering, 2018, 30(9):1712-1726. [12] CAO X, CONG G, GUO T, et al.Efficient processing of spatial group keyword queries[J].ACM Transactions on Database Systems, 2015, 40(2):1-48. [13] XU H F, GU Y, SUN Y, et al.Efficient processing of moving collective spatial keyword queries[J].The VLDB Journal, 2020, 29(4):841-865. [14] LI J C, XU M.A parametric approximation algorithm for spatial group keyword queries[J].Intelligent Data Analysis, 2021, 25(2):305-319. [15] FENG Z J, LIU T T, LI H, et al.Indoor top-k keyword-aware routing query[C]//Proceedings of the 36th IEEE International Conference on Data Engineering.Washington D.C., USA:IEEE Press, 2020:1213-1224. [16] SALGADO C.Keyword-aware skyline routes search in indoor venues[C]//Proceedings of the 9th ACM SIGSPATIAL International Workshop on Indoor Spatial Awareness.New York, USA:ACM Press, 2018:25-31. [17] ZHAO S, ZHAO L, SU S, et al.Group-based keyword-aware route querying in road networks[J].Information Sciences, 2018, 450:343-360. [18] ZHAO S, XIONG L.Group nearest compact POI set queries in road networks[C]//Proceedings of the 20th IEEE International Conference on Mobile Data Management.Washington D.C., USA:IEEE Press, 2019:106-111. [19] FLOYD R W.Algorithm 97:shortest path[J].Communications of the ACM, 1962, 5(6):345. [20] SCHUTZE H, MANNING C D, RAGHAVAN P.Introduction to information retrieval[M].Cambridge, USA:Cambridge University Press, 2008. [21] 张晗, 钱育蓉, 王跃飞, 等.CUDA下单源最短路径算法并行优化[J].计算机工程与设计, 2019, 40(8):2181-2189. ZHANG H, QIAN Y R, WANG Y F, et al.Parallel optimization of single source shortest path algorithm under CUDA[J].Computer Engineering and Design, 2019, 40(8):2181-2189.(in Chinese) [22] 张钟.大规模图上的最短路径问题研究[D].合肥:中国科学技术大学, 2014. ZHANG Z.Study of shortest path problem on large-scale graph[D].Hefei:University of Science and Technology of China, 2014.(in Chinese) [23] YUAN Y, LIAN X, WANG G R, et al.Constrained shortest path query in a large time-dependent graph[J].Proceedings of the VLDB Endowment, 2019, 12(10):1058-1070. [24] DJIDJEV H, CHAPUIS G, ANDONOV R, et al.All-pairs shortest path algorithms for planar graph for GPU-accelerated clusters[J].Journal of Parallel and Distributed Computing, 2015, 85:91-103. [25] KATZ G J, KIDER J T.All-pairs shortest-paths for large graphs on the GPU[EB/OL].[2021-04-20]. http://www.doc88.com/p-3798461984676.html. [26] ABDELGHANY K, HASHEMI H, ALNAWAISEH A.Parallel all-pairs shortest path algorithm:network decomposition approach[J].Transportation Research Record, 2016, 2567(1):95-104. |