RNSG approximates the range-aware relative neighborhood graph (RRNG) to enable high-performance range-filtered ANN queries with one compact index instead of many.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DB 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
The skd-tree partitions space into multiple slices per node along one dimension, compresses splitters, and applies a constant number of SIMD instructions per node to reduce levels and computations for multi-dimensional queries.
citing papers explorer
-
RNSG: A Range-Aware Graph Index for Efficient Range-Filtered Approximate Nearest Neighbor Search
RNSG approximates the range-aware relative neighborhood graph (RRNG) to enable high-performance range-filtered ANN queries with one compact index instead of many.
-
In-memory Multidimensional Indexing Using the skd-tree
The skd-tree partitions space into multiple slices per node along one dimension, compresses splitters, and applies a constant number of SIMD instructions per node to reduce levels and computations for multi-dimensional queries.