{
  "checked_on": "2026-11-06",
  "sources": [
    {
      "title": "Bigtable: A Distributed Storage System for Structured Data",
      "authors": "Fay Chang et al.",
      "year": 2006,
      "url": "https://static.usenix.org/events/osdi06/tech/chang/chang_html/index.html",
      "section": "6, Bloom filters",
      "role": "Existing reading-corpus anchor; per-SSTable negative lookup mechanism"
    },
    {
      "title": "Monkey: Optimal Navigable Key-Value Store",
      "authors": "Niv Dayan, Manos Athanassoulis, Stratos Idreos",
      "year": 2017,
      "url": "https://cs-people.bu.edu/mathan/publications/sigmod17-dayan.pdf",
      "section": "4.1",
      "role": "Externally verified primary source; continuous optimal allocation objective"
    },
    {
      "title": "RocksDB Bloom Filter",
      "url": "https://github.com/meta/rocksdb/wiki/RocksDB-Bloom-Filter",
      "role": "Current official implementation context; cache-local filters and tradeoffs"
    }
  ],
  "data_provenance": "All experiment data are generated by the included Python source. No paper datasets or figures are redistributed."
}
