<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Speed-ANN: Low-Latency and High-Accuracy Nearest Neighbor Search via Intra-Query Parallelism · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2201.13007/</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/2201.13007/feed.xml" rel="self" type="application/rss+xml" /><item><title>Speed-ANN: Low-Latency and High-Accuracy Nearest Neighbor Search via Intra-Query Parallelism — mentioned by fireysausage</title><link>https://news.ycombinator.com/item?id=37127887</link><guid isPermaLink="false">urn:hackerpapers:mention:2201.13007:37127887</guid><pubDate>Mon, 14 Aug 2023 23:00:17 GMT</pubDate><description>&lt;p&gt;I don&amp;#x27;t see how you compete against the 50 other providers. You just implemented a speedup on the graph search (maybe credit the authors of the paper you are ripping off in your github?). However this speedup trades the overall throughput for latency. And even in the paper, its not exact. Maybe drop the disingenuous marketing and find something else to work on. The 50 other vector dbs will implement this trivial addition and you&amp;#x27;ll be left with nothing to show. Sources: https://arxiv.org/abs/2201.13007 https://dl.acm.org/doi/pdf/10.1145/3572848.3577527&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2201.13007/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DC</category></item></channel></rss>
