{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T11:55:45Z","timestamp":1784548545728,"version":"3.55.0"},"reference-count":34,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T00:00:00Z","timestamp":1698019200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"the National Natural Science Foundation of China","award":["62072136"],"award-info":[{"award-number":["62072136"]}]},{"name":"the National Natural Science Foundation of China","award":["LH2023F031"],"award-info":[{"award-number":["LH2023F031"]}]},{"name":"the National Natural Science Foundation of China","award":["2020YFB1710200"],"award-info":[{"award-number":["2020YFB1710200"]}]},{"name":"the Natural Science Foundation of Heilongjiang Province","award":["62072136"],"award-info":[{"award-number":["62072136"]}]},{"name":"the Natural Science Foundation of Heilongjiang Province","award":["LH2023F031"],"award-info":[{"award-number":["LH2023F031"]}]},{"name":"the Natural Science Foundation of Heilongjiang Province","award":["2020YFB1710200"],"award-info":[{"award-number":["2020YFB1710200"]}]},{"name":"the National Key R&amp;D Program of China","award":["62072136"],"award-info":[{"award-number":["62072136"]}]},{"name":"the National Key R&amp;D Program of China","award":["LH2023F031"],"award-info":[{"award-number":["LH2023F031"]}]},{"name":"the 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>Aiming at the problem that the existing spatial keyword group query problem did not consider the query requirements with exclusion keywords and time attributes, a time-aware group query problem with exclusion keywords (TEGSKQ) is proposed for the first time. To solve this problem effectively, this paper proposes a query method based on the EKTIR-Tree index and dominating group (EKTDG). This method first proposes the EKTIR-tree index, which incorporates Huffman coding and integrates Bloom filters to deal with excluded keywords in order to improve the hit rate of keyword queries, significantly improving the query efficiency and reducing the storage occupancy. Then, the Candidate algorithm is proposed based on the EKTIR-tree index to filter out the spatial\u2013textual objects that meet the query\u2019s keywords and time requirements, narrowing the search space for subsequent queries on a large scale. To address the problem of the low efficiency of existing algorithms based on a spatial distance query, a distance-dominating group is defined and a pruning algorithm based on a spatial distance-dominating group is proposed, which is a refining process of query results and greatly improves the search efficiency of the query. Theoretical and experimental studies show that the proposed method can better handle group queries with exclusion keywords based on time awareness.<\/jats:p>","DOI":"10.3390\/ijgi12100438","type":"journal-article","created":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T06:29:01Z","timestamp":1698128941000},"page":"438","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Research on Time-Aware Group Query Method with Exclusion Keywords"],"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":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Song","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2023,10,23]]},"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","first-page":"1287","article-title":"Query Method for Nearest Region of Spatial Line Segment Based on Hilbert Curve Grid","volume":"15","author":"Zhang","year":"2019","journal-title":"Int. J. Innov. Comput. Inf. Control"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Yang, R., and Niu, B. (2020). Continuous k Nearest Neighbor Queries over Large-Scale Spatial\u2013Textual Data Streams. ISPRS Int. J. Geo-Inf., 9.","DOI":"10.3390\/ijgi9110694"},{"key":"ref_4","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_5","doi-asserted-by":"crossref","first-page":"113841","DOI":"10.1016\/j.eswa.2020.113841","article-title":"Personalizing the Top-k Spatial Keyword Preference Query with Textual Classifiers","volume":"162","year":"2020","journal-title":"Expert Syst. Appl."},{"key":"ref_6","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_7","doi-asserted-by":"crossref","unstructured":"Zhang, D., Tan, K.-L., and Tung, A.K.H. (2013, January 18\u201322). Scalable Top-k Spatial Keyword Search. Proceedings of the 16th International Conference on Extending Database Technology\u2014EDBT\u201913, Genoa, Italy.","DOI":"10.1145\/2452376.2452419"},{"key":"ref_8","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_9","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1142\/S0218195911003603","article-title":"Reverse Nearest Neighbor Queries in Fixed Dimension","volume":"21","author":"Cheong","year":"2011","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"ref_10","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. Humaniz. Comput."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"101530","DOI":"10.1016\/j.is.2020.101530","article-title":"Efficient Processing of Reverse Nearest Neighborhood Queries in Spatial Databases","volume":"92","author":"Islam","year":"2020","journal-title":"Inf. Syst."},{"key":"ref_12","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_13","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_14","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_15","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_16","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_17","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_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","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_20","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_21","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1109\/TKDE.2015.2492549","article-title":"Nearest Keyword Set Search in Multi-Dimensional Datasets","volume":"28","author":"Singh","year":"2016","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_22","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_23","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.14778\/2350229.2350234","article-title":"Keyword-Aware Optimal Route Search","volume":"5","author":"Cao","year":"2012","journal-title":"Proc. VLDB Endow."},{"key":"ref_24","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_25","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_26","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/j.ins.2016.10.033","article-title":"Level-Aware Collective Spatial Keyword Queries","volume":"378","author":"Zhang","year":"2017","journal-title":"Inf. Sci."},{"key":"ref_27","first-page":"1324","article-title":"Cost-Aware and Distance-Constrained Collective Spatial Keyword Query","volume":"35","author":"Chan","year":"2021","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_28","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_29","doi-asserted-by":"crossref","first-page":"2601","DOI":"10.1109\/TKDE.2017.2742956","article-title":"Time-Aware Boolean Spatial Keyword Queries","volume":"29","author":"Chen","year":"2017","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1077","DOI":"10.2298\/CSIS200131034C","article-title":"Time-Aware Collective Spatial Keyword Query","volume":"18","author":"Chen","year":"2021","journal-title":"ComSIS"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Chan, H.K.-H., Liu, T., Li, H., and Lu, H. (2021, January 23). Time-Constrained Indoor Keyword-Aware Routing. Proceedings of the 17th International Symposium on Spatial and Temporal Databases, online.","DOI":"10.1145\/3469830.3470895"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"107367","DOI":"10.1016\/j.knosys.2021.107367","article-title":"Time-Aware Approximate Collective Keyword Search in Traffic Networks","volume":"229","author":"Feng","year":"2021","journal-title":"Knowl.-Based Syst."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"30234","DOI":"10.1109\/ACCESS.2020.2972632","article-title":"Classification of Shopify App User Reviews Using Novel Multi Text Features","volume":"8","author":"Rustam","year":"2020","journal-title":"IEEE Access"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Long, C., Wong, R.C.-W., Wang, K., and Fu, A.W.-C. (2013, January 22\u201327). Collective Spatial Keyword Queries: A Distance Owner-Driven Approach. Proceedings of the 2013 International Conference on Management of Data\u2014SIGMOD\u201913, New York, NY, USA.","DOI":"10.1145\/2463676.2465275"}],"container-title":["ISPRS International Journal of Geo-Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2220-9964\/12\/10\/438\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:10:33Z","timestamp":1760130633000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2220-9964\/12\/10\/438"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,23]]},"references-count":34,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2023,10]]}},"alternative-id":["ijgi12100438"],"URL":"https:\/\/doi.org\/10.3390\/ijgi12100438","relation":{},"ISSN":["2220-9964"],"issn-type":[{"value":"2220-9964","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,23]]}}}