<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Vector Search on ermesonqueiroz</title>
    <link>https://ermeson.is-a.dev/tags/vector-search/</link>
    <description>Recent content in Vector Search on ermesonqueiroz</description>
    <image>
      <title>ermesonqueiroz</title>
      <url>https://ermeson.is-a.dev/%3Clink%20or%20path%20of%20image%20for%20opengraph,%20twitter-cards%3E</url>
      <link>https://ermeson.is-a.dev/%3Clink%20or%20path%20of%20image%20for%20opengraph,%20twitter-cards%3E</link>
    </image>
    <generator>Hugo</generator>
    <language>en</language>
    <lastBuildDate>Mon, 11 May 2026 10:20:00 +0000</lastBuildDate>
    <atom:link href="https://ermeson.is-a.dev/tags/vector-search/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Rinha de Backend 2026 - Part 2</title>
      <link>https://ermeson.is-a.dev/post/rinha-de-backend-2026-part-2/</link>
      <pubDate>Mon, 11 May 2026 10:20:00 +0000</pubDate>
      <guid>https://ermeson.is-a.dev/post/rinha-de-backend-2026-part-2/</guid>
      <description>&lt;p&gt;The main principle to solve this edition is Vector Search, so before entering this topic, I decided to understand what embeddings are, which is fundamental to understand and implement a Vector Search.&lt;/p&gt;
&lt;p&gt;Embeddings are a way of representing objects like images, audio and texts as points in a vector space. The locations of those points are helpful to find similar objects.&lt;/p&gt;
&lt;h2 id=&#34;example&#34;&gt;Example&lt;/h2&gt;
&lt;p&gt;For better understanding, we will use examples of fruits represented as vectors. Each dimension of the vector represents an attribute of the fruit; we will use: sweetness and color. Each dimension value must be between 0 and 1, the green color is equal to 0, and the red color is equal to 1.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Rinha de Backend 2026 - Part 1</title>
      <link>https://ermeson.is-a.dev/post/rinha-de-backend-2026-part-1/</link>
      <pubDate>Mon, 11 May 2026 00:02:00 +0000</pubDate>
      <guid>https://ermeson.is-a.dev/post/rinha-de-backend-2026-part-1/</guid>
      <description>&lt;p&gt;Rinha de Backend in a code challenge where you compete with other developers to build a backend under CPU, memory, and architecture constraints. The theme of the year is fraud detection using vector search.&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;For more information, please visit the &lt;a href=&#34;https://github.com/zanfranceschi/rinha-de-backend-2026&#34;
   
    
      target=&#34;_blank&#34; rel=&#34;noopener&#34;
   &gt;
   Rinha de Backend Repository
&lt;/a&gt;
.&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;This project already had previous editions. In this one, I will document the process of building my solution to this Code Challenge. This edition has a base principle that I’m unfamiliar with: &lt;strong&gt;Vector Search&lt;/strong&gt;. The next posts will be reporting my progress and what I’m learning in the process.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
