<?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>BTree on Changlin&#39;s Blog</title>
    <link>https://timely-sprinkles-c55fc0.netlify.app/tags/btree/</link>
    <description>Recent content in BTree on Changlin&#39;s Blog</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-us</language>
    <lastBuildDate>Sun, 17 Dec 2023 14:54:37 -0600</lastBuildDate><atom:link href="https://timely-sprinkles-c55fc0.netlify.app/tags/btree/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>BTree</title>
      <link>https://timely-sprinkles-c55fc0.netlify.app/posts/btree/</link>
      <pubDate>Sun, 17 Dec 2023 14:54:37 -0600</pubDate>
      
      <guid>https://timely-sprinkles-c55fc0.netlify.app/posts/btree/</guid>
      <description>Btree The idea we saw earlier of putting multiple set (list, hash table) elements together into large chunks that exploit locality can also be applied to trees. Binary search trees are not good for locality because a given node of the binary tree probably occupies only a fraction of any cache line. B-trees are a way to get better locality by putting multiple elements into each tree node.
Degree m: Maximum number of the children</description>
    </item>
    
  </channel>
</rss>
