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.
High-dimensional approximate nearest neighbor search: with reliable and efficient distance comparison operations
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
NasZip delivers up to 8.4x speedup over CPU baselines and 1.69x over prior NDP accelerators for ANNS by combining near-data processing with statistics-based PCA early exiting, dynamic-float encoding, and data-aware neighbor mapping.
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.
-
NasZip: Software and Hardware Co-Design to Accelerate Approximate Nearest Neighbor Search with DIMM-Based Near-Data Processing
NasZip delivers up to 8.4x speedup over CPU baselines and 1.69x over prior NDP accelerators for ANNS by combining near-data processing with statistics-based PCA early exiting, dynamic-float encoding, and data-aware neighbor mapping.