<?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>Cache Performance on Kostas Chasialis</title><link>https://kchasialis.dev/tags/cache-performance/</link><description>Recent content in Cache Performance on Kostas Chasialis</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Sun, 25 Oct 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://kchasialis.dev/tags/cache-performance/index.xml" rel="self" type="application/rss+xml"/><item><title>Same O(1), different performance: finding orders in an order book</title><link>https://kchasialis.dev/blog/order-map-hash-tables/</link><pubDate>Sun, 25 Oct 2026 00:00:00 +0000</pubDate><guid>https://kchasialis.dev/blog/order-map-hash-tables/</guid><description>&lt;h2 id="the-problem"&gt;The problem&lt;/h2&gt;
&lt;p&gt;Many systems need to map one object to another, of the same or of a different type. This happens, for example, when they receive information in one form and want to convert it to another, or when they simply want to access information through a lightweight handle, called the key.&lt;/p&gt;
&lt;p&gt;The family of data structures that does this is called associative containers, and they are fundamental in most modern systems. There are many ways to implement one, depending on what the system needs, but by far the most common is the hash table.&lt;/p&gt;</description></item></channel></rss>