On multi-type reverse nearest neighbor search

  • Authors:
  • Xiaobin Ma;Chengyang Zhang;Shashi Shekhar;Yan Huang;Hui Xiong

  • Affiliations:
  • 1 Oracle Drive, Nashua, NH 03062, USA;Department of Computer Science and Engineering, University of North Texas, TX, 76207, USA;Department of Computer Science and Engineering, University of Minnesota, 200 Union Steet SE, Minneapolis, MN 55455, USA;Department of Computer Science and Engineering, University of North Texas, TX, 76207, USA;Management Science and Information Systems Department, Rutgers University, NJ, 07102, USA

  • Venue:
  • Data & Knowledge Engineering
  • Year:
  • 2011

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper presents a study of the Multi-Type Reverse Nearest Neighbor (MTRNN) query problem. Traditionally, a reverse nearest neighbor (RNN) query finds all the objects that have the query point as their nearest neighbor. In contrast, an MTRNN query finds all the objects that have the query point in their multi-type nearest neighbors. Existing RNN queries find an influence set by considering only one feature type. However, the influence from multiple feature types is often critical for strategic decision making in many business scenarios, such as site selection for a new shopping center. To that end, we first formalize the notion of the MTRNN query by considering the influence of multiple feature types. We also propose R-tree based algorithms to find the influence set for a given query point and multiple feature types. Finally, experimental results are provided to show the strength of the proposed algorithms as well as design decisions related to performance tuning.