Work

Efficient Nearest Neighbor Queries on Non-point Data

Year: 2023

Type: conference-paper

Abstract: Nearest neighbor (NN) queries are ubiquitous in spatial databases, but have been studied mainly for point data. Inspired by recent work on indexing non-point objects for range queries, we propose a secondary partitioning scheme for space-partitioning indices, tailored to NN search. Our scheme classifies the contents of each primary partition into 16 secondary partitions, considering the begin and end of objects with respect to the spatial extent of the primary partition. Based on this, we design algorithms for both incremental NN and k-NN search that avoid duplicate results and skip unnecessary computations. We compare our scheme to the state-of-the-art indexing and find that it has a significant performance advantage.

Source: ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL GIS)

DOI: 10.1145/3589132.3625609

Authors: Achilleas Michalopoulos, Dimitrios Tsitsigkos, Panagiotis Bouros, Nikos Mamoulis, Manolis Terrovitis

Institutions: University of Ioannina, Johannes Gutenberg University Mainz, Athena Research and Innovation Center In Information Communication & Knowledge Technologies

Language: English

Topic: Data Management and Algorithms

Subfield: Information Systems

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Funder: Hellenic Foundation for Research and Innovation

OpenAlex ID: W4390100383

FWCI: 0.757

Cites: 12

Cited by: 4

Related to: 10