Affiliation:
1. School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China
Abstract
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–textual objects that meet the query’s 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.
Funder
the National Natural Science Foundation of China
the Natural Science Foundation of Heilongjiang Province
the National Key R&D Program of China
Subject
Earth and Planetary Sciences (miscellaneous),Computers in Earth Sciences,Geography, Planning and Development
Reference34 articles.
1. A Method for k Nearest Neighbor Query of Line Segment in Obstructed Spaces;Zhang;J. Inf. Process. Syst.,2020
2. Query Method for Nearest Region of Spatial Line Segment Based on Hilbert Curve Grid;Zhang;Int. J. Innov. Comput. Inf. Control,2019
3. Yang, R., and Niu, B. (2020). Continuous k Nearest Neighbor Queries over Large-Scale Spatial–Textual Data Streams. ISPRS Int. J. Geo-Inf., 9.
4. Approximate k-Nearest Neighbor Query of High Dimensional Data Based on Dimension Grouping and Reducing;Li;J. Comput. Res. Dev.,2021
5. Personalizing the Top-k Spatial Keyword Preference Query with Textual Classifiers;Expert Syst. Appl.,2020
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献