Tag
Jim Calabro introduces One Hash Bloom Filters, a variant that reduces hashing overhead in bloom filters, building on double-hashing techniques and Bluesky's production experience where bloom filters save millions of database queries per second.
Jim Calabro's blog index highlighting posts on One Hash Bloom Filters, the uscope debugger/introspection toolchain, a DWARF/ELF deep-dive series, and Go/Zig static linking techniques.
The research paper "B-Trees Are Back: Engineering Fast and Pageable Node Layouts" explores how to design faster, pageable B-tree node layouts to improve database index performance on modern hardware.
Eric Lippert's new Manning book "Fabulous Adventures in Data Structures and Algorithms" has become a top new release on Amazon, covering immutable data structures, DAWGs, compiler design, and Bayesian techniques relevant to AI.
This is a Chinese transcript of a Computerphile video that dives deep into how the undo/redo functionality in software is implemented, covering user expectations around the granularity of undo actions, implementing multi-level undo using stacks (two stacks), and the challenges of memory overhead and snapshot storage in bitmap editing.
A blog post explaining the simple two-stack algorithm for maintaining sliding-window aggregations (min, quantiles, HyperLogLog, etc.) with amortized O(1) operations, which works for associative aggregations without inverses, and tracing the algorithm's folklore origins back through Tangwongsan et al. and D. Sleator's lecture notes.
A technical blog post exploring techniques for writing type-safe generic data structures in C, progressing from header-inclusion macros and void pointers to unions and inline storage, illustrated with a linked list implementation.
Peter Mattis (CTO/cofounder of Cockroach Labs) shares a thread explaining B-tree node layout and spatial locality, inspired by recent B-tree discussions on the Pragmatic Engineer podcast.
Cargocut introduces 'nel', a tiny OCaml library of non-empty lists, and discusses a proposal to encode list reversal in the type so that intermediate reversed-construction invariants are tracked explicitly.
A technical deep-dive explaining how traditional lock coupling in concurrent binary trees suffers from physical lock contention at the root node, limiting scalability as CPU core counts grow, with benchmark results on a 16-core system.
A motivational tweet advising software engineers to practice Data Structures and Algorithms for skill improvement.
The post emphasizes pattern recognition as key to efficient LeetCode problem-solving for algorithm interviews, offering the NeetCode 150 list categorized by core patterns.
The article explains that Python's dict and set data structures, often assumed to be O(1), can exhibit quadratic-time performance in scenarios involving hash collisions and memory hierarchy effects.
This article explains how Swiss Tables are implemented in Go 1.24's built-in map, detailing the performance improvements and technical internals.
A beginner's guide to algorithms covering linear search, binary search, and depth-first search with JavaScript code examples.
This article explains intrusive linked lists, a data structure variation where links are embedded in the structure itself, used in Linux for efficient memory management and cache performance.
The paper introduces the sync heap, a novel data structure that decouples deletion from revealing the deleted element, enabling constant amortized time for insertions and deletions under limited inspections, and improving a textbook scheduling problem from O(n log n) to O(n).
This document details the time complexity of various operations on Python's built-in types such as list, tuple, and dict, using Big O notation to describe performance characteristics.
A tweet sharing 10 GitHub repositories for mastering Data Structures and Algorithms, including Coding Interview University, The Algorithms, JavaScript Algorithms, and other interview prep resources.
A technical blog post that explores sorting, hashing, and sketching algorithms on a dataset of 370,103 English words, measuring time and memory costs, with a focus on practical implementations like binary search, quicksort, and HyperLogLog.