Cover Image

Maximum Inner Product is Query-Scaled Nearest Neighbor

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chen, Tingyang, Fu, Cong, Wang, Kun, Ke, Xiangyu, Gao, Yunjun, Zhou, Wenchao, Ni, Yabo, Zeng, Anxiang
Format:	Preprint
Published:	2025
Subjects:	Databases
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Stitching Inner Product and Euclidean Metrics for Topology-aware Maximum Inner Product Search
by: Chen, Tingyang, et al.
Published: (2025)

Empowering Graph-based Approximate Nearest Neighbor Search with Adaptive Awareness Capabilities
by: Ruan, Jiancheng, et al.
Published: (2025)

Reveal Hidden Pitfalls and Navigate Next Generation of Vector Similarity Search from Task-Centric Views
by: Chen, Tingyang, et al.
Published: (2025)

Scalable Graph Indexing using GPUs for Approximate Nearest Neighbor Search
by: Li, Zhonggen, et al.
Published: (2025)

View-based Explanations for Graph Neural Networks
by: Chen, Tingyang, et al.
Published: (2024)

A GPU-Accelerated Framework for Multi-Attribute Range Filtered Approximate Nearest Neighbor Search
by: Li, Zhonggen, et al.
Published: (2026)

Accelerating Graph Indexing for ANNS on Modern CPUs
by: Wang, Mengzhao, et al.
Published: (2025)

An Interactive Multi-modal Query Answering System with Retrieval-Augmented Large Language Models
by: Wang, Mengzhao, et al.
Published: (2024)

Approximate Nearest Neighbor Search of Large Scale Vectors on Distributed Storage
by: Yu, Kun, et al.
Published: (2025)

SINDI: an Efficient Index for Approximate Maximum Inner Product Search on Sparse Vectors
by: Li, Ruoxuan, et al.
Published: (2025)

Effective and General Distance Computation for Approximate Nearest Neighbor Search
by: Yang, Mingyu, et al.
Published: (2024)

Efficient Computation of Trip-based Group Nearest Neighbor Queries (Full Version)
by: Zaman, Shahiduz, et al.
Published: (2025)

BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector
by: Yin, Ziqi, et al.
Published: (2026)

Beyond Relational: Semantic-Aware Multi-Modal Analytics with LLM-Native Query Optimization
by: Zhu, Junhao, et al.
Published: (2025)

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
by: Wang, Carrie, et al.
Published: (2025)

In-context Clustering-based Entity Resolution with Large Language Models: A Design Space Exploration
by: Fu, Jiajie, et al.
Published: (2025)

VSAG: An Optimized Search Framework for Graph-based Approximate Nearest Neighbor Search
by: Zhong, Xiaoyao, et al.
Published: (2025)

BRkNN-light: Batch Processing of Reverse k-Nearest Neighbor Queries for Moving Objects on Road Networks
by: Song, Anbang, et al.
Published: (2025)

TaCo: Data-adaptive and Query-aware Subspace Collision for High-dimensional Approximate Nearest Neighbor Search
by: Wei, Jiuqi, et al.
Published: (2026)

GTS: GPU-based Tree Index for Fast Similarity Search
by: Zhu, Yifan, et al.
Published: (2024)

Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search
by: Yang, Shuo, et al.
Published: (2024)

SliceGX: Layer-wise GNN Explanation with Model-slicing
by: Zhu, Tingting, et al.
Published: (2025)

Efficient Data-aware Distance Comparison Operations for High-Dimensional Approximate Nearest Neighbor Search
by: Deng, Liwei, et al.
Published: (2024)

Dimensionality-Reduction Techniques for Approximate Nearest Neighbor Search: A Survey and Evaluation
by: Wang, Zeyu, et al.
Published: (2024)

Multiple Index Merge for Approximate Nearest Neighbor Search
by: Jing, Liuchang, et al.
Published: (2026)

Exploring the Meaningfulness of Nearest Neighbor Search in High-Dimensional Space
by: Chen, Zhonghan, et al.
Published: (2024)

Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks
by: Wang, Yiqi, et al.
Published: (2024)

Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search
by: Hua, Zhiyuan, et al.
Published: (2025)

ESG: Elastic Graphs for Range-Filtering Approximate k-Nearest Neighbor Search
by: Yang, Mingyu, et al.
Published: (2025)

Panorama: Fast-Track Nearest Neighbors
by: Ramani, Vansh, et al.
Published: (2025)

QPAD: Quantile-Preserving Approximate Dimension Reduction for Nearest Neighbors Preservation in High-Dimensional Vector Search
by: Fu, Jiuzhou, et al.
Published: (2025)

Privacy-Preserving Approximate Nearest Neighbor Search on High-Dimensional Data
by: Liu, Yingfan, et al.
Published: (2025)

CANDY: A Benchmark for Continuous Approximate Nearest Neighbor Search with Dynamic Data Ingestion
by: Zeng, Xianzhi, et al.
Published: (2024)

Quantization Meets Projection: A Happy Marriage for Approximate k-Nearest Neighbor Search
by: Yang, Mingyu, et al.
Published: (2024)

SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search
by: Gou, Yutong, et al.
Published: (2024)

Survey of Filtered Approximate Nearest Neighbor Search over the Vector-Scalar Hybrid Data
by: Lin, Yanjun, et al.
Published: (2025)

MCI: A Maximal Clique Index for Efficient Arbitrary-Filtered Approximate Nearest Neighbor Search
by: Ye, Xiaowei, et al.
Published: (2026)

DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search
by: Chatzakis, Manos, et al.
Published: (2025)

EMA: Approximate Nearest Neighbor Search with General Attribute Filtering and Dynamic Updates
by: Li, Mocheng, et al.
Published: (2026)

Efficient Approximate Nearest Neighbor Search under Multi-Attribute Range Filter
by: Yu, Yuanhang, et al.
Published: (2026)