Incremental Neighborhood Graphs Construction for Multidimensional Databases Indexing

Download PDF
Open Webpage

Hakim Hacid, Tetsuya Yoshida

Published: 2007, Last Modified: 15 Jan 2026Canadian AI 2007EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: The point location (neighborhood search) is a significant problem in several fields like databases and data mining. Neighborhood graphs are interesting representations of this problem in a multidimensional space. However, several problems related to neighborhood graphs are under research and require detailed work to solve them. These problems are mainly related to their high construction costs and to their updating difficulties. In this article, we deal with the point location problem by considering neighborhood graphs optimization. We propose and compare two strategies able to quickly build and update these structures.