Finding aggregate nearest neighbor efficiently without indexing

Authors:
Yanmin Luo;Kazutaka Furuse;Hanxiong Chen;Nobuo Ohbo
Affiliations:
HuaQiao University, FuJian, China and University of Tsukuba, Tsukuba, Ibaraki, Japan;University of Tsukuba, Tsukuba, Ibaraki, Japan;University of Tsukuba, Tsukuba, Ibaraki, Japan;University of Tsukuba, Tsukuba, Ibaraki, Japan
Venue:
Proceedings of the 2nd international conference on Scalable information systems
Year:
2007

Citing 3
Cited 1

Aggregate Nearest Neighbor Queries in Road Networks

IEEE Transactions on Knowledge and Data Engineering
Aggregate nearest neighbor queries in spatial databases

ACM Transactions on Database Systems (TODS)
Two ellipse-based pruning methods for group nearest neighbor queries

Proceedings of the 13th annual ACM international workshop on Geographic information systems

Aggregate nearest neighbor queries in uncertain graphs

World Wide Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

Aggregate Nearest Neighbor Queries are much more complex than Nearest Neighbor queries, and pruning strategies are always utilized in ANN queries. Most of the pruning methods are based on the data index mechanisms, such as R-tree. But for the well-known curse of dimensionality, ANN search could be meaningless in high dimensional spaces. In this paper, we propose two non-index pruning strategies in ANN queries on metric space. Our methods utilize the r-NN query and projecting law, analyze the distributing of query points, find out the search region in data space, and get the result efficiently.