{
  "slug": "aeris-filter",
  "term": "Aeris filter",
  "aliases": [
    "Aeris"
  ],
  "definition": "Aeris is an adaptive range-emptiness filter that extends partition fingerprints after database feedback identifies a false positive.",
  "note": "Its on-disk reverse map supplies keys for correction and selective rejuvenation during expansion. [aeris-paper]\n\nThe target false-positive bound assumes a configured maximum range length; longer queries are supported without that same bound. [aeris-paper]\n\nThe authors report 5.1 GB of reverse-map disk space in a WiredTiger experiment with 100 million 8-byte keys and 504-byte values. This auxiliary storage and its cache belong in the system budget; the measured overhead is workload-specific. [aeris-paper]",
  "citations": [
    {
      "id": "aeris-paper",
      "title": "Chesetti et al. Aeris Filter: A Strongly and Monotonically Adaptive Range Filter. PACMMOD 4(1), article 7 (2026), sections 3-5. DOI: 10.1145/3786621.",
      "url": "https://prashantpandey.github.io/assets/pdf/uploads/sigmod26_aeris.pdf",
      "accessed": "2026-11-11"
    },
    {
      "id": "analysis",
      "title": "Hesela: Aeris and the cost of remembering corrections",
      "url": "https://hesela.com/analyses/bloom-filters-lsm-read-cost/#aeris-cost",
      "accessed": "2026-11-11"
    }
  ],
  "related": [
    "adaptive-quotient-filter",
    "grafite-range-filter",
    "succinct-range-filter"
  ],
  "status": "research",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-11",
  "provenance": [
    "Primary-source synthesis only; no author implementation or performance experiment executed by Hesela."
  ]
}