<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Implementing Semantic Join Operators Efficiently · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2510.08489/</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/2510.08489/feed.xml" rel="self" type="application/rss+xml" /><item><title>Implementing Semantic Join Operators Efficiently — mentioned by itrummer</title><link>https://news.ycombinator.com/item?id=45549896</link><guid isPermaLink="false">urn:hackerpapers:mention:2510.08489:45549896</guid><pubDate>Sat, 11 Oct 2025 15:28:20 GMT</pubDate><description>&lt;p&gt;LlamaIndex relies heavily on RAG-style approaches, e.g., we&amp;#x27;re using items whose embedding vectors are close to the embedding vectors of the question (what you describe). RAG-style approaches work great if the answer depends only on a small part of the data, e.g., if the right answer can be extracted from a few top-N documents. It&amp;#x27;s less applicable if the answer cannot be extracted from a small data subset. E.g., you want to count the number of pictures showing red cars in your database (rather than retrieving a few pictures of red cars). Or, let&amp;#x27;s say you want to tag beach holiday pictures…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2510.08489/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DB</category></item></channel></rss>
