Reverse k-skyband query based on reuse technology

In this paper, we introduce a new approach to finish reverse k-skyband (RkSB) query which returns all the points in given dataset P whose dynamic k-skyband contains specific query object q. The main ideas include reuse technology and early stopping. The former save the information of node accesses during R-tree search into an auxiliary heap so that dramatically decreases the I/O cost and improves the CPU efficiency. This is because RkSB needs to execute global k-skyband and window query to finish the computation and the reuse information can be used in the phase of window query. The latter improves the efficiency of RkSB computation. The experimental results conducted on real datasets and synthetic datasets show that our proposed algorithm is effective and has a better performance both I/O cost and CPU efficiency than the algorithm based on reverse BBS (Branch and Bound Skyline) method. Keywordsalgorithm; skyline query; reverse skyline; skyband