Research on Approximate Spatial Keyword Group Queries Based on Differential Privacy and Exclusion Preferences in Road Networks

Abstract

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.