{"page":1,"limit":5000,"pages":1,"total":1227,"_links":{"self":{"href":"https:\/\/wallabag.jeremydormitzer.com\/api\/entries?sort=created&order=desc&tags=&since=0&page=1&perPage=5000"},"first":{"href":"https:\/\/wallabag.jeremydormitzer.com\/api\/entries?sort=created&order=desc&tags=&since=0&page=1&perPage=5000"},"last":{"href":"https:\/\/wallabag.jeremydormitzer.com\/api\/entries?sort=created&order=desc&tags=&since=0&page=1&perPage=5000"}},"_embedded":{"items":[{"is_archived":0,"is_starred":0,"user_name":"jdormit","user_email":"jeremy.dormitzer+wallabag@gmail.com","user_id":2,"tags":[{"id":24,"label":"databases","slug":"databases"},{"id":249,"label":"btree","slug":"btree"},{"id":250,"label":"datastructures","slug":"datastructures"}],"is_public":false,"id":1230,"uid":null,"title":"Part 7 - Introduction to the B-Tree","url":"https:\/\/cstack.github.io\/db_tutorial\/parts\/part7.html","content":"
\n

Writing a sqlite clone from scratch in C<\/p>\n

Overview<\/a><\/p>\n

View on GitHub (pull requests welcome)<\/a><\/p>\n<\/header>

Part 6 - The Cursor Abstraction<\/a>
<\/p>

Part 8 - B-Tree Leaf Node Format<\/a>
<\/p>

The B-Tree is the data structure SQLite uses to represent both tables and indexes, so it\u2019s a pretty central idea. This article will just introduce the data structure, so it won\u2019t have any code.<\/p>

Why is a tree a good data structure for a database?<\/p>