Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

10-2013

Abstract

Aggregate nearest neighbor query, which returns a common interesting point that minimizes the aggregate distance for a given query point set, is one of the most important operations in spatial databases and their application domains. This paper addresses the problem of finding the aggregate nearest neighbor for a merged set that consists of the given query point set and multiple points needed to be selected from a candidate set, which we name as merged aggregate nearest neighbor(MANN) query. This paper proposes an effective algorithm to process MANN query in road networks based on our pruning strategies. Extensive experiments are conducted to examine the behaviors of the solutions and the overall experiments show that our strategies to minimize the response time are effective and achieve several orders of magnitude speedup compared with the baseline methods.

Keywords

Query Processing, Nearest Neighbor, Road Networks

Discipline

Databases and Information Systems | Numerical Analysis and Scientific Computing | Transportation

Publication

CIKM '13: Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 27 October - 1 November 2013, San Francisco

First Page

2243

Last Page

2248

ISBN

9781450322638

Identifier

10.1145/2505515.2505738

Publisher

ACM

City or Country

New York

Additional URL

http://dx.doi.org/10.1145/2505515.2505738

Download

Share

COinS