{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T01:27:31Z","timestamp":1769304451865,"version":"3.49.0"},"reference-count":30,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T00:00:00Z","timestamp":1700956800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072136"],"award-info":[{"award-number":["62072136"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2022ZX01A34"],"award-info":[{"award-number":["2022ZX01A34"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2020YFB1710200"],"award-info":[{"award-number":["2020YFB1710200"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key R&amp;D Plan Project of Heilongjiang Province","award":["62072136"],"award-info":[{"award-number":["62072136"]}]},{"name":"Key R&amp;D Plan Project of Heilongjiang Province","award":["2022ZX01A34"],"award-info":[{"award-number":["2022ZX01A34"]}]},{"name":"Key R&amp;D Plan Project of Heilongjiang Province","award":["2020YFB1710200"],"award-info":[{"award-number":["2020YFB1710200"]}]},{"name":"National Key R&amp;D Program of China","award":["62072136"],"award-info":[{"award-number":["62072136"]}]},{"name":"National Key R&amp;D Program of China","award":["2022ZX01A34"],"award-info":[{"award-number":["2022ZX01A34"]}]},{"name":"National Key R&amp;D Program of China","award":["2020YFB1710200"],"award-info":[{"award-number":["2020YFB1710200"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJGI"],"abstract":"<jats:p>A new spatial keyword group query method is proposed in this paper to address the existing issue of user privacy leakage and exclusion of preferences in road networks. The proposed query method is based on the IGgram-tree index and minimum hash set. To deal with this problem effectively, this paper proposes a query method based on the IGgram-tree index and minimum hash set. The IGgram-tree index is proposed for the first time to deal with the approximate keyword query problem in the road network. This index significantly improves the efficiency of calculating the road network distance and querying approximate keywords. Considering that spatial keyword group queries are caused by NP-hard problems with high time complexity, this paper proposes a data structure that uses the minimum hash set, which can efficiently search for the result set. To address the problem that the traditional spatial keyword group query does not consider user privacy leakage and the limitations of existing privacy protection techniques, this method proposes a differential privacy-based allocation method to better protect the privacy of data. The theoretical study and experimental analysis show that the proposed method can better handle the approximate spatial keyword group query problem based on its use of differential privacy and exclusion preferences in road networks.<\/jats:p>","DOI":"10.3390\/ijgi12120480","type":"journal-article","created":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T03:35:06Z","timestamp":1701056106000},"page":"480","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Research on Approximate Spatial Keyword Group Queries Based on Differential Privacy and Exclusion Preferences in Road Networks"],"prefix":"10.3390","volume":"12","author":[{"given":"Liping","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Song","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,11,26]]},"reference":[{"key":"ref_1","first-page":"406","article-title":"A Method for k Nearest Neighbor Query of Line Segment in Obstructed Spaces","volume":"16","author":"Zhang","year":"2020","journal-title":"J. Inf. Process. Syst."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Yang, R., and Niu, B. (2020). Continuous k Nearest Neighbor Queries over Large-Scale Spatial\u2013Textual Data Streams. Int. J. Geo-Inf., 9.","DOI":"10.3390\/ijgi9110694"},{"key":"ref_3","first-page":"609","article-title":"Approximate k-Nearest Neighbor Query of High Dimensional Data Based on Dimension Grouping and Reducing","volume":"58","author":"Li","year":"2021","journal-title":"J. Comput. Res. Dev."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"9280","DOI":"10.1109\/JIOT.2021.3114155","article-title":"Top-k Socially Constrained Spatial Keyword Search in Large SIoT Networks","volume":"9","author":"Wang","year":"2022","journal-title":"IEEE Internet Things J."},{"key":"ref_5","first-page":"3197","article-title":"Efficient algorithm of top-k spatial keyword search with OR semantics","volume":"31","author":"Pan","year":"2020","journal-title":"J. Softw."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"4335","DOI":"10.1007\/s12652-018-1103-x","article-title":"Density-Based Reverse Nearest Neighbourhood Search in Spatial Databases","volume":"12","author":"Allheeib","year":"2021","journal-title":"J. Ambient Intell. Hum. Comput."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"986","DOI":"10.1109\/TSC.2020.2968309","article-title":"Reverse Nearest Neighbor Search in Semantic Trajectories for Location-Based Services","volume":"15","author":"Pan","year":"2022","journal-title":"IEEE Trans. Serv. Comput."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Cao, X., Cong, G., Jensen, C.S., and Ooi, B.C. (2011, January 12\u201316). Collective Spatial Keyword Querying. Proceedings of the 2011 International Conference on Management of Data\u2014SIGMOD\u201911, Athens, Greece.","DOI":"10.1145\/1989323.1989363"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1712","DOI":"10.1109\/TKDE.2018.2800746","article-title":"On Generalizing Collective Spatial Keyword Queries","volume":"30","author":"Chan","year":"2018","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1007\/s00778-019-00583-8","article-title":"Efficient Processing of Moving Collective Spatial Keyword Queries","volume":"29","author":"Xu","year":"2020","journal-title":"VLDB J."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Zhang, L., Li, J., and Li, S. (2023). Research on Time-Aware Group Query Method with Exclusion Keywords. Int. J. Geo-Inf., 12.","DOI":"10.3390\/ijgi12100438"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Zhang, D., Chee, Y.M., Mondal, A., Tung, A.K.H., and Kitsuregawa, M. (April, January 29). Keyword Search in Spatial Databases: Towards Searching by Document. Proceedings of the 2009 IEEE 25th International Conference on Data Engineering, Shanghai, China.","DOI":"10.1109\/ICDE.2009.77"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Choi, D.-W., Pei, J., and Lin, X. (2016, January 16\u201320). Finding the Minimum Spatial Keyword Cover. Proceedings of the 2016 IEEE 32nd International Conference on Data Engineering (ICDE), Helsinki, Finland.","DOI":"10.1109\/ICDE.2016.7498281"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Guo, T., Cao, X., and Cong, G. (June, January 31). Efficient Algorithms for Answering the M-Closest Keywords Query. Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Australia.","DOI":"10.1145\/2723372.2723723"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TITS.2015.2477837","article-title":"Efficient Collective Spatial Keyword Query Processing on Road Networks","volume":"17","author":"Gao","year":"2016","journal-title":"IEEE Trans. Intell. Transport. Syst."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2175","DOI":"10.1109\/TKDE.2015.2399306","article-title":"G-Tree: An Efficient and Scalable Index for Spatial Search on Road Networks","volume":"27","author":"Zhong","year":"2015","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.eswa.2016.03.028","article-title":"Classification of Sentiment Reviews Using N-Gram Machine Learning Approach","volume":"57","author":"Tripathy","year":"2016","journal-title":"Expert Syst. Appl."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/TKDE.2014.2324897","article-title":"Best Keyword Cover Search","volume":"27","author":"Deng","year":"2015","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"305","DOI":"10.3233\/IDA-195071","article-title":"A Parametric Approximation Algorithm for Spatial Group Keyword Queries","volume":"25","author":"Li","year":"2021","journal-title":"IDA"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/s10707-017-0299-9","article-title":"Popularity-Aware Collective Keyword Queries in Road Networks","volume":"21","author":"Zhao","year":"2017","journal-title":"Geoinformatica"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.ipl.2016.10.008","article-title":"Group-Based Collective Keyword Querying in Road Networks","volume":"118","author":"Su","year":"2017","journal-title":"Inf. Process. Lett."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"2237","DOI":"10.3724\/SP.J.1016.2012.02237","article-title":"Top-k Fuzzy Spatial Keyword Search","volume":"35","author":"Hu","year":"2012","journal-title":"Chin. J. Comput."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Zhang, S., Yang, R., and Zhao, Y. (2018, January 25\u201327). Research on Multi-Spatial Keyword Fuzzy Query Algorithm in Spatial Data. Proceedings of the 2018 International Conference on Big Data Engineering and Technology, Chengdu, China.","DOI":"10.1145\/3297730.3297739"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.jpdc.2019.07.013","article-title":"Privacy-Preserving k Nearest Neighbor Query with Authentication on Road Networks","volume":"134","author":"Yang","year":"2019","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1561\/0400000042","article-title":"The Algorithmic Foundations of Differential Privacy","volume":"9","author":"Dwork","year":"2013","journal-title":"FNT Theor. Comput. Sci."},{"key":"ref_26","first-page":"430","article-title":"A Perturbation Mechanism for Classified Transformation Satisfying Local Differential Privacy","volume":"59","author":"Zhu","year":"2022","journal-title":"J. Comput. Res. Dev."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"2805","DOI":"10.1109\/TIFS.2019.2908070","article-title":"Differentially Private Double Spectrum Auction With Approximate Social Welfare Maximization","volume":"14","author":"Chen","year":"2019","journal-title":"IEEE Trans. Inform. Forensic Secur."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Fan, Z., and Xu, X. (2019, January 10\u201312). APDPk-Means: A New Differential Privacy Clustering Algorithm Based on Arithmetic Progression Privacy Budget Allocation. Proceedings of the 2019 IEEE 21st International Conference on High Performance Computing and Communications, Zhangjiajie, China.","DOI":"10.1109\/HPCC\/SmartCity\/DSS.2019.00238"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10707-019-00358-x","article-title":"Collective Spatial Keyword Search on Activity Trajectories","volume":"24","author":"Song","year":"2020","journal-title":"Geoinformatica"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1546","DOI":"10.1109\/TKDE.2016.2520473","article-title":"Practical Approximate k Nearest Neighbor Queries with Location and Query Privacy","volume":"28","author":"Yi","year":"2016","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["ISPRS International Journal of Geo-Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2220-9964\/12\/12\/480\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:30:43Z","timestamp":1760131843000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2220-9964\/12\/12\/480"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,26]]},"references-count":30,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["ijgi12120480"],"URL":"https:\/\/doi.org\/10.3390\/ijgi12120480","relation":{},"ISSN":["2220-9964"],"issn-type":[{"value":"2220-9964","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,26]]}}}