Probabilistic Data Structures

3 题

  • Tinder

    设计Tinder。请覆盖Swipe ingestion as a high-volume, append-only event write path (like/pass events) decoupled from match detection, Match detection: checking whether A likes B AND B likes A, where that...

    免费指南
  • Top K Songs (Spotify)

    设计Top K Songs (Spotify)。请覆盖Framing top-K as a heavy-hitters/frequency-estimation problem over a play-count stream, Count-Min Sketch + heap (bounded error, memory trade-off) vs exact per-partition...

    免费指南
  • 网页爬虫

    设计网页爬虫。请覆盖URL frontier design: priority queues for scheduling and re-crawl ordering, Politeness: robots.txt compliance and per-domain rate limiting to avoid hammering one host, JavaScript rendering...

    免费指南