CubeGraph uses hierarchical spatial grids and on-the-fly stitching of per-cell vector graphs to enable single-pass nearest-neighbor search for hybrid vector-spatial queries.
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
-
CubeGraph: Efficient Retrieval-Augmented Generation for Spatial and Temporal Data
CubeGraph uses hierarchical spatial grids and on-the-fly stitching of per-cell vector graphs to enable single-pass nearest-neighbor search for hybrid vector-spatial queries.
-
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.