Data Structures and Algorithms

!data_structures

@programming.dev
Create post
Large Text Compression Benchmark

Large Text Compression Benchmark

Open link in next tab

Large Text Compression Benchmark

https://www.mattmahoney.net/dc/text.html

B-Trees: More Than I Thought I'd Want to Know

B-Trees: More Than I Thought I'd Want to Know

Open link in next tab

B-Trees: More Than I Thought I'd Want to Know

https://benjamincongdon.me/blog/2021/08/17/B-Trees-More-Than-I-Thought-Id-Want-to-Know/

B-Trees are not boring, after all

B-Trees: More Than I Thought I'd Want to Know
Nagle's algorithm - Wikipedia

Nagle's algorithm - Wikipedia

Open link in next tab

Nagle's algorithm - Wikipedia

https://en.wikipedia.org/wiki/Nagle%27s_algorithm

Dissecting the GZIP format (2011)

Dissecting the GZIP format (2011)

Open link in next tab

https://www.infinitepartitions.com/art001.html

An introduction to Conflict-Free Replicated Data Types · Part 1: Preliminaries

An introduction to Conflict-Free Replicated Data Types · Part 1: Preliminaries

Open link in next tab

An introduction to Conflict-Free Replicated Data Types · Part 1: Preliminaries

https://lars.hupel.info/topics/crdt/01-intro/

An introduction to Conflict-Free Replicated Data Types · Part 1: Preliminaries
What is GZIP Compression and is it Lossless?

What is GZIP Compression and is it Lossless?

Open link in next tab

What is GZIP Compression and is it Lossless?

https://bunny.net/academy/http/what-is-gzip-lossless-compression/

GZIP Compression is an extremely popular technique of lossless compression for photos, videos, & web pages. It is used by a large number of websites.

What is GZIP Compression and is it Lossless?
Conflict Resolution: Using Last-Write-Wins vs. CRDTs (2018)

Conflict Resolution: Using Last-Write-Wins vs. CRDTs (2018)

Open link in next tab

Conflict Resolution: Using Last-Write-Wins vs. CRDTs - DZone

https://dzone.com/articles/conflict-resolution-using-last-write-wins-vs-crdts

Learn about two common techniques for resolving conflicts in your database: last-write-wins (LWW) and conflict-free replicated data types (CRDTs).

When Bloom filters don't bloom

When Bloom filters don't bloom

Open link in next tab

When Bloom filters don't bloom

https://blog.cloudflare.com/when-bloom-filters-dont-bloom/

Last month finally I had an opportunity to use Bloom filters. I became fascinated with the promise of this data structure, but I quickly realized it had some drawbacks.

What is a Log Structured Merge Tree? Definition & FAQs | ScyllaDB

What is a Log Structured Merge Tree? Definition & FAQs | ScyllaDB

Open link in next tab

What is a Log Structured Merge Tree? Definition & FAQs | ScyllaDB

https://www.scylladb.com/glossary/log-structured-merge-tree/

Learn the definition of log structured merge tree and get answers to FAQs regarding: how LSM trees work to speed write operations and store keys and data efficiently.

What is a Log Structured Merge Tree? Definition & FAQs | ScyllaDB
B-trees and database indexes

B-trees and database indexes

Open link in next tab

B-trees and database indexes — PlanetScale

https://planetscale.com/blog/btrees-and-database-indexes

B-trees are used by many modern DBMSs. Learn how they work, how databases use them, and how your choice of primary key can affect index performance.

B-trees and database indexes — PlanetScale