---
title: "Discussion on \"B-Tree vs LSM-Tree Indexing\" | Hashnode"
description: "Discussion on \"B-Tree vs LSM-Tree Indexing\". Understand the indexing structures behind relational SQL databases and write-heavy NoSQL databases."
url: "https://hashnode.com/posts/database-indexing-byte/6a45c4c819a53d5d37e7eb0b"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [B-Tree vs LSM-Tree Indexing](https://abstractalgorithms.hashnode.dev/database-indexing-byte?utm_source=hashnode&utm_medium=feed)

Understand the indexing structures behind relational SQL databases and write-heavy NoSQL databases.

Jul 2 · 1 min read · abstractalgorithms.hashnode.dev  
Read the article

-   [#databases](https://hashnode.com/tag/databases)
-   [#indexing](https://hashnode.com/tag/indexing)
-   [#b-tree](https://hashnode.com/tag/b-tree)
-   [#lsm-tree](https://hashnode.com/tag/lsm-tree)

## Written by

[Abstract Algorithms](https://hashnode.com/@abstractalgorithms)

@abstractalgorithms

  
[View profile](https://hashnode.com/@abstractalgorithms)

Exploring the fascinating world of algorithms, data structures, and software engineering through clear explanations and practical examples.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.