Efficient multiple bichromatic mutual nearest neighbor query processing
作者：
Highlights：
• We define and motivate multiple mutual bichromatic weighted nearest neighbor queries.
• We solve 2d multiple mutual nearest neighbor queries sequentially and parallelly.
• We theoretically analyze and compare the time and space complexity of both algorithms.
• We experimentally show the algorithms to be effective, robust and scalable.
摘要
Highlights•We define and motivate multiple mutual bichromatic weighted nearest neighbor queries.•We solve 2d multiple mutual nearest neighbor queries sequentially and parallelly.•We theoretically analyze and compare the time and space complexity of both algorithms.•We experimentally show the algorithms to be effective, robust and scalable.
论文关键词：Computer science,Decision-making support system,Bichromatic mutual nearest neighbor query,Graphics Processing Unit (GPU)
论文评审过程：Received 25 February 2016, Revised 30 June 2016, Accepted 7 July 2016, Available online 16 July 2016, Version of Record 29 July 2016.
论文官网地址：https://doi.org/10.1016/j.is.2016.07.003
