09:23Announcements across Microsoft SQL at Microsoft Ignite 2026 | Data Exposed
Microsoft Developer
We all use dictionaries constantly, but most of us treat them as a black box. This talk opens that box. We'll walk through how hash tables actually work and what the 2011 "hash flooding" vulnerability taught us about algorithmic complexity attacks. We'll also check some genuinely weird behavior (hash(-1) == hash(-2)), the birthday paradox, and why your hash seeds are randomized. We'll wrap up with a quick tour of other hash-based structures like Bloom filters and consistent hashing. Due to an on-site AV error, this recording starts 3:00 minutes into the presentation.
Published 2026-10-07 · Watch on YouTube ↗
Availability and playback restrictions are controlled by the original channel.
09:23Microsoft Developer
05:34
02:05
02:17
10:51SyntaxPilot
08:20
04:59IIMTRobot
Allow Google Analytics to measure visits. Your history stays in your browser. Privacy details