A community dedicated to topics related to data structures and algorithms.
VisuAlgo was conceptualised in 2011 by Dr Steven Halim as a tool to help his students better understand data structures and algorithms, by allowing them to learn the basics on their own and at their own pace. Together with his students from the National University of Singapore, a series of visualiza...
A simple, whitespace theme for academics. Based on [*folio](https://github.com/bogoli/-folio) design.
B-Trees stand the test of time. In this article, we explore why we still use a 55 year old data structure: It is still super efficient on modern hardware when we use contention free optimistic lock coupling!
An overview of a class of data structures I didn't know about!
When to Use Two Phase Commit in Distributed Transaction (2022)
Everything you need to know about two phase commit algorithm
Evaluation of large language model (LLM) to generate efficient Solidity code
free and open source software
GZIP Compression is an extremely popular technique of lossless compression for photos, videos, & web pages. It is used by a large number of websites.
Conflict Resolution: Using Last-Write-Wins vs. CRDTs (2018)
Learn about two common techniques for resolving conflicts in your database: last-write-wins (LWW) and conflict-free replicated data types (CRDTs).
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.
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.
B-trees 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.
