#probabilistic-data-structures

2 items tagged with "probabilistic-data-structures"

Authentication Authorization Backend Career Growth Clean Code CleanArchitecture Cloud Command Line Communication Concurrency DDD Databases DevOps Docker JWT Kubernetes Leadership Learning Linux Mental Health Microservices Networking OAuth2 Refactoring Security Senior Engineer Soft Skills Software Engineering SoftwareArchitecture Sysadmin System Design SystemDesign TDD Teamwork Terminal Testing ZeroTrust ab-testing accessibility agile ai algorithms analytics anthropic appsec architecture async-communication authentication automation aws backend behavioral build-vs-buy burnout business-acumen business-impact caching career career-growth ci-cd claude clean-architecture clean-code code-review collaboration communication containers context-switching databases decision-making deep-work design design-patterns design-system developer-experience devops distributed-systems docker engineering-culture engineering-leadership engineering-management engineering-quality engineering-strategy experimentation feature-flags finance-for-engineers flow-state frontend golang grafana hexagonal-architecture infrastructure-as-code interview job-search kanban kotlin kubernetes leadership lean-methodology learning llm makefile mental-models messaging metrics microservices mtls networking north-star-metric note-taking observability oop opentelemetry orchestration outcome-driven owasp performance-review personal-branding ports-and-adapters prd product-discovery product-mindset product-thinking productivity progressive-delivery prometheus protocol qa react redis reliability remote-work requirements salary-negotiation scalability scrum security senior-engineers soft-skills software-design software-engineering staff-engineer supply-chain system-design tailwind tdd technical-debt technical-decisions technical-leadership technical-writing terraform testing theory-of-constraints tooling tracing user-research ux wcag web-security

Posts

Bloom Filter: The Structure That Never Lies About Absence

How a bit array and k hash functions let you test set membership with zero false negatives, tunable false positives, and 1.14 MB for a million elements.

Jun 17, 2026algorithmsredisdatabases

HyperLogLog: Count Billions with 12 KB

How a single probabilistic trick lets you estimate 10⁹ unique elements using less memory than a thumbnail image.

Jun 17, 2026algorithmsredissystem-design