Monochromatic and bichromatic reverse top-k group nearest neighbor queries
作者：
Highlights：
• We formalize and solve the monochromatic and bichromatic RkGNN problem.
• We propose an algorithm to efficiently compute RkGNN queries.
• Some effective pruning methods are proposed to reduce the overhead of RkGNN processing.
• Our algorithm is several orders of magnitude faster than linear scan algorithm.
摘要
•We formalize and solve the monochromatic and bichromatic RkGNN problem.•We propose an algorithm to efficiently compute RkGNN queries.•Some effective pruning methods are proposed to reduce the overhead of RkGNN processing.•Our algorithm is several orders of magnitude faster than linear scan algorithm.
论文关键词：Query processing,Group nearest neighbor,Top-k query,Spatial database
论文评审过程：Received 5 August 2015, Revised 9 January 2016, Accepted 10 January 2016, Available online 18 January 2016, Version of Record 8 February 2016.
论文官网地址：https://doi.org/10.1016/j.eswa.2016.01.012
