<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Manning on Ryan Orban</title><link>https://ryanorban.com/categories/manning/</link><description>Recent content in Manning on Ryan Orban</description><generator>Hugo</generator><language>en-us</language><managingEditor>me@ryanorban.com (Ryan Orban)</managingEditor><webMaster>me@ryanorban.com (Ryan Orban)</webMaster><copyright>Ryan Orban</copyright><lastBuildDate>Mon, 04 Apr 2022 00:00:00 +0000</lastBuildDate><atom:link href="https://ryanorban.com/categories/manning/index.xml" rel="self" type="application/rss+xml"/><item><title>Advanced Algorithms and Data Structures</title><link>https://ryanorban.com/notes/advanced-algorithms-data-structures-la-rocca/</link><pubDate>Mon, 04 Apr 2022 00:00:00 +0000</pubDate><author>me@ryanorban.com (Ryan Orban)</author><guid>https://ryanorban.com/notes/advanced-algorithms-data-structures-la-rocca/</guid><description>&lt;h3 id="summary" class="scroll-mt-8 group"&gt;
 Summary
 
 &lt;a href="#summary"
 class="no-underline hidden opacity-50 hover:opacity-100 !text-inherit group-hover:inline-block"
 aria-hidden="true" title="Link to this heading" tabindex="-1"&gt;
 &lt;svg
 xmlns="http://www.w3.org/2000/svg"
 width="16"
 height="16"
 fill="none"
 stroke="currentColor"
 stroke-linecap="round"
 stroke-linejoin="round"
 stroke-width="2"
 class="lucide lucide-link w-4 h-4 block"
 viewBox="0 0 24 24"
&gt;
 &lt;path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71" /&gt;
 &lt;path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71" /&gt;
&lt;/svg&gt;

 &lt;/a&gt;
 
&lt;/h3&gt;
&lt;p&gt;&lt;em&gt;Advanced Algorithms and Data Structures&lt;/em&gt; by Marcello La Rocca (Manning, 2021) takes a problem-first approach: each chapter introduces a practical engineering problem — caching, spell-check, nearest-neighbor search, clustering — then develops the data structure or algorithm that solves it. The book covers a wide arc from foundational structures like priority queues, treaps, and bloom filters to more advanced territory including k-d trees, clustering algorithms, and graph planarity detection.&lt;/p&gt;</description></item><item><title>Designing Cloud Data Platforms</title><link>https://ryanorban.com/notes/designing-cloud-data-platforms/</link><pubDate>Mon, 04 Apr 2022 00:00:00 +0000</pubDate><author>me@ryanorban.com (Ryan Orban)</author><guid>https://ryanorban.com/notes/designing-cloud-data-platforms/</guid><description>&lt;h3 id="summary" class="scroll-mt-8 group"&gt;
 Summary
 
 &lt;a href="#summary"
 class="no-underline hidden opacity-50 hover:opacity-100 !text-inherit group-hover:inline-block"
 aria-hidden="true" title="Link to this heading" tabindex="-1"&gt;
 &lt;svg
 xmlns="http://www.w3.org/2000/svg"
 width="16"
 height="16"
 fill="none"
 stroke="currentColor"
 stroke-linecap="round"
 stroke-linejoin="round"
 stroke-width="2"
 class="lucide lucide-link w-4 h-4 block"
 viewBox="0 0 24 24"
&gt;
 &lt;path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71" /&gt;
 &lt;path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71" /&gt;
&lt;/svg&gt;

 &lt;/a&gt;
 
&lt;/h3&gt;
&lt;p&gt;&lt;em&gt;&lt;a href="https://ryanorban.com/notes/designing-cloud-data-platforms/"&gt;Designing Cloud Data Platforms&lt;/a&gt;&lt;/em&gt; by Danil Zburivsky and Lynda Partner (Manning, 2021) provides a comprehensive architecture guide for building data platforms on cloud infrastructure. The book takes a layered approach: data ingestion → storage → processing → serving, with each layer examined through the lens of the major providers (AWS, GCP, Azure).&lt;/p&gt;</description></item></channel></rss>