Abstract
We propose an influential set based moving k keyword query processing model, which avoids the shortcoming of safe region-based approaches that the update cost and update frequency cannot be optimized simultaneously. Based on the model, we design a parallel query processing method and a parallel validation method for multicore processing platforms. The time complexity of the algorithms is O((log|D|+p.k)/p.k) and O(log p.k), respectively, which are all O(1/k) times the time complexity of the state-of-the-art method. The experiment result confirms the superiority of our algorithms over the state-of-the-art method.
Highlights
In recent years, smart mobile devices represented by smartphones have been explosively developed in terms of quantity and have greatly improved their processing capabilities and available network bandwidth
According to the above theorem, this chapter proposes an algorithm based on the influence set of Parallel Moving top-k Spatial Keyword (PMkSK)
Algorithm 1 uses parity-ordered networks combined with Batcher merging and sorting methods to complete sorting in time log m [10] (m indicates the number of sort objects, which is proportional to p.k and key distribution density), The required time is 1/m of the commonly used quick sorting algorithm(Its time complexity is
Summary
Smart mobile devices represented by smartphones have been explosively developed in terms of quantity and have greatly improved their processing capabilities and available network bandwidth. The existing MkSK processing methods are based on sequential calculation model, and it is difficult to effectively use the advantages of multi-core parallelism in large-scale servers. To solve these problems, this paper proposes an MkSK query processing model based on impact set [4] and designs two query processing algorithms for server and client computer. As far as we know, the method proposed in this paper is the first time that uses the impact set, and it is the first time that concurrent mode is used to perform spatial moving k nearest keyword query processing.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
