REVIEW 11 cited by
Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints
abstract
As research interest surges, vector similarity search is applied in multiple fields, including data mining, computer vision, and information retrieval. {Given a set of objects (e.g., a set of images) and a query object, we can easily transform each object into a feature vector and apply the vector similarity search to retrieve the most similar objects. However, the original vector similarity search cannot well support \textit{hybrid queries}, where users not only input unstructured query constraint (i.e., the feature vector of query object) but also structured query constraint (i.e., the desired attributes of interest). Hybrid query processing aims at identifying these objects with similar feature vectors to query object and satisfying the given attribute constraints. Recent efforts have attempted to answer a hybrid query by performing attribute filtering and vector similarity search separately and then merging the results later, which limits efficiency and accuracy because they are not purpose-built for hybrid queries.} In this paper, we propose a native hybrid query (NHQ) framework based on proximity graph (PG), which provides the specialized \textit{composite index and joint pruning} modules for hybrid queries. We easily deploy existing various PGs on this framework to process hybrid queries efficiently. Moreover, we present two novel navigable PGs (NPGs) with optimized edge selection and routing strategies, which obtain better overall performance than existing PGs. After that, we deploy the proposed NPGs in NHQ to form two hybrid query methods, which significantly outperform the state-of-the-art competitors on all experimental datasets (10$\times$ faster under the same \textit{Recall}), including eight public and one in-house real-world datasets. Our code and datasets have been released at \url{https://github.com/AshenOn3/NHQ}.
Forward citations
Cited by 11 Pith papers
-
HNSW with Accuracy Guarantees Using Graph Spanners
A Certify-then-Rectify wrapper around HNSW uses conformal risk control plus EVT-estimated graph stretch to deliver average-case HNSW speed with high-probability exact k-NN recovery.
-
Don't Stir the Pot! Authorized Vector Data Retrieval via Access-Aware Indexing
Veda and EffVeda build access-aware lattice indexes on role-partitioned vector blocks to support authorized top-k queries with controlled duplication and pruned search.
-
Don't Stir the Pot! Authorized Vector Data Retrieval via Access-Aware Indexing
Veda and EffVeda partition vectors into disjoint role-combination blocks, apply lattice-based copy and merge operations within a storage budget, index large nodes with HNSW, and use coordinated search with distance bo...
-
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.
-
TEngineDB-V: An OLAP-Native Vector Search System for Large-$k$ Workloads at Tencent
An OLAP-native vector search system materializes a segment-decoupled global IVFPQ index as relational tables and executes large-k search via relational operators, reporting up to 145x speedup over StarRocks and 52x ov...
-
HNSW with Accuracy Guarantees Using Graph Spanners
A tiered Certify-then-Rectify system for HNSW that certifies approximate results statistically and falls back to exact recovery by treating the graph as a spanner whose stretch is bounded via extreme value theory.
-
CLIP: Lightweight Cosine-Law-Based Inverted-List Pruning for IVF-Based Vector Search
CLIP proposes a cosine-law-based pruning method for IVF vector search enabling O(1) cluster and log-time vector pruning with guarantees, plus variants for hierarchical and dynamic settings, showing up to 78% pruning a...
-
Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version)
A labeled flat proximity graph built from full- and single-attribute partitions supports arbitrary filtered ANNS and beats UNG on 1–2 attribute queries at similar recall.
-
RACORN-1: Adaptive Recall-Preserving Speedup for Low-Selectivity Filtered Vector Search
RACORN-1 adds adaptive search fallback to ACORN-1 to fix recall collapse at low selectivity in filtered vector search, achieving 9-26x speedups over HNSW with recovered recall on 1M-40M datasets.
-
Don't Stir the Pot! Authorized Vector Data Retrieval via Access-Aware Indexing
Veda and EffVeda partition vector data by role combinations, apply lattice-based copy/merge under storage budget, index large nodes with HNSW and small nodes with linear scan, then use query plans and coordinated sear...
-
E2E: Efficient Filtered AKNN Search via Adaptive Termination
A learned model predicts filtered AKNN search cost from early-probe local filter statistics, enabling per-query early termination with reported speedups of up to ~3x at similar recall.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.