<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2403.04871/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2403.04871/feed.xml" rel="self" type="application/rss+xml" /><item><title>ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data — mentioned by VoVAllen</title><link>https://news.ycombinator.com/item?id=42499471</link><guid isPermaLink="false">urn:hackerpapers:mention:2403.04871:42499471</guid><pubDate>Tue, 24 Dec 2024 03:19:26 GMT</pubDate><description>&lt;p&gt;Hi, I&amp;#x27;m the author of the article. I actually think the opposite of what you mentioned. IVF is more suitable for prefiltering compared to HNSW. For prefiltering in HNSW, there is a certain requirement for the filtering rate—it can&amp;#x27;t be too low, or the entire graph may become disconnected. For instance, with the commonly used parameter m=16, each node can have at most 16 neighbors. If the filtering rate is below 5%, it can directly result in no neighbors meeting the condition, causing the algorithm to fail entirely. This is why the academic community has proposed alternatives like ACRON[1]. On…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2403.04871/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.IR</category></item></channel></rss>
