PathFinder: Efficiently Supporting Conjunctions and Disjunctions for Filtered Approximate Nearest Neighbor Search
Tianming Wu, Dixin Tang

TL;DR
PathFinder is a novel indexing framework that efficiently supports complex filtered approximate nearest neighbor searches by combining attribute-specific indexes with a cost-based optimizer, significantly improving query throughput.
Contribution
It introduces a new optimization metric, a two-phase optimization process, and an index borrowing technique for complex filtered ANNS, addressing limitations of prior graph-based indexes.
Findings
Outperforms baselines by up to 9.8x in throughput
Achieves high recall of 0.95 in experiments
Supports complex conjunctions and disjunctions efficiently
Abstract
Filtered approximate nearest neighbor search (ANNS) restricts the search to data objects whose attributes satisfy a given filter and retrieves the top- objects that are most semantically similar to the query object. Many graph-based ANNS indexes are proposed to enable efficient filtered ANNS but remain limited in applicability or performance: indexes optimized for a specific attribute achieve high efficiency for filters on that attribute but fail to support complex filters with arbitrary conjunctions and disjunctions over multiple attributes. Inspired by the design of relational databases, this paper presents PathFinder, a new indexing framework that allows users to selectively create ANNS indexes optimized for filters on specific attributes and employs a cost-based optimizer to efficiently utilize them for processing complex filters. PathFinder includes three novel techniques: 1) a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Advanced Image and Video Retrieval Techniques · Information Retrieval and Search Behavior
