Work

Finding Aggregate Nearest Neighbor Efficiently without Indexing

Year: 2007

Type: conference-paper

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 m

Source: Scalable Information Systems

DOI: 10.4108/infoscale.2007.900

Authors: Yanmin Luo, Kazutaka Furuse, Hanxiong Chen, Nobuo Ohbo

Institutions: Huaqiao University, University of Tsukuba

Language: English

Topic: Data Management and Algorithms

Subfield: Information Systems

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W4249857784

FWCI:

Cites: 3

Cited by: 3

Related to: 10