On efficient reverse k-skyband query processing

  • Authors:
  • Qing Liu;Yunjun Gao;Gang Chen;Qing Li;Tao Jiang

  • Affiliations:
  • College of Computer Science, Zhejiang University, China;College of Computer Science, Zhejiang University, China;College of Computer Science, Zhejiang University, China;Department of Computer Science, City University of Hong Kong, Hong Kong;College of Mathematics Physics and Information Engineering, Jiaxing University, China

  • Venue:
  • DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper, for the first time, addresses the problem of efficient reverse k-skyband (RkSB) query processing. Given a set P of multi-dimensional points and a query point q, an RkSB query returns all the points in P whose dynamic k-skyband contains q. We formalize the RkSB query, and then propose three algorithms for computing the RkSB of an arbitrary query point efficiently. Our methods utilize a conventional data-partitioning index (e.g., R-tree) on the dataset, as well as employ pre-computation and pruning techniques to improve the query performance. Extensive experiments using both real and synthetic datasets demonstrate the effectiveness of our proposed pruning heuristics and the performance of our proposed algorithms.