Spatial-Keyword Skyline Publish/Subscribe Query Processing Over Distributed Sliding Window Streaming Data
Ze Deng, Yue Wang, Tao Liu, Schahram Dustdar, Rajiv Ranjan, Albert Y. Zomaya, Yizhi Liu, Lizhe Wang
Abstract
Current spatial-keyword publish/subscribe systems need to handle spatial-keyword skyline queries over geo-textual streams to continuously obtain good results. The skyline queries in such systems face two main problems: (1) query problems, because the powerful query capability is required for the strict limit of the response time and the large number of items concerned by the users, and (2) scalability issue, because millions of active users are maintained simultaneously with many network-connected machines. Unfortunately, the current approach is towards static data. Thus, this paper first proposes a distributed skyline query processing framework. Then, we optimize the skyline computing by introducing MF-R <inline-formula><tex-math notation="LaTeX">$^t$</tex-math></inline-formula> -tree, which is an update-efficient and space-saving indexing structure and a fast approach for processing a continuous spatial-keyword skyline query called <inline-formula><tex-math notation="LaTeX">$eager^*$</tex-math></inline-formula> . Finally, a spatial and textual signature-based communication optimization method is proposed to support scalability. The experimental results indicate that (1) MF-R <inline-formula><tex-math notation="LaTeX">$^t$</tex-math></inline-formula> -tree can significantly reduce update costs, while maintaining a low storage cost, and a query performance comparable to IL-Quadtree, (2) <inline-formula><tex-math notation="LaTeX">$eager^*$</tex-math></inline-formula> can averagely accelerate 79.72 × faster than the method based on BNL, (3) the communication optimization method significantly reduces the communication cost, and (4) the distributed framework can efficiently support large-scale skyline queries.