{
  "status": "research",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-20",
  "slug": "space-saving",
  "term": "Space-Saving",
  "aliases": [
    "SpaceSaving",
    "Space-Saving summary"
  ],
  "definition": "Space-Saving estimates frequent items with labelled counters, replacing a minimum-count item when a new identity arrives at a full summary.",
  "note": "For unit insertions, increment a tracked key. Otherwise use a free slot or replace a minimum counter q with the new key at q+1, recording q as its error allowance. A tracked key's true count lies in [count-error, count]; an untracked key's frequency is at most the current minimum, or zero while slots remain unused. [metwally]\n\nWith m counters and N arrivals, the counter sum is N and the minimum is at most N/m. Every key strictly above N/m is retained. Ranking estimates alone does not certify an exact top-k set: overlapping count intervals can leave the order unresolved. [metwally]\n\nWith two counters and lexical eviction tie-breaking, A A A B C D E ends with D:(count 3, error 2) and E:(count 4, error 3). A is absent even though it occurs three times and every other key occurs once. E's interval [1,4] includes its true count 1; the bound remains valid while the ranking is wrong. [worked]\n\nA less obvious relation uses different budgets. Misra-Gries with m counters corresponds to Space-Saving with m+1. Subtracting Space-Saving's minimum from its estimates gives Misra-Gries counters, treating missing keys as that minimum or zero, respectively. This is not an equivalence at the same counter count. [mergeable]",
  "related": [
    "misra-gries",
    "count-min-sketch",
    "tinylfu"
  ],
  "citations": [
    {
      "id": "metwally",
      "title": "Metwally, Agrawal and El Abbadi. Efficient Computation of Frequent and Top-k Elements in Data Streams, sections 3-4.",
      "url": "https://www.cs.emory.edu/~cheung/Courses/584/Syllabus/papers/Frequency-count/2005-Metwally-Top-k-elements.pdf",
      "accessed": "2026-11-20"
    },
    {
      "id": "mergeable",
      "title": "Agarwal, Cormode, Huang, Phillips, Wei and Yi. Mergeable Summaries, section 2, Lemmas 1-2.",
      "url": "https://users.cs.utah.edu/~jeffp/papers/merge-summ.pdf",
      "accessed": "2026-11-20"
    },
    {
      "id": "worked",
      "title": "Hesela. Frequent-item certificates: exact examples, executable model and tests.",
      "url": "https://hesela.dev/research/heavy-hitter-certificates/README.md",
      "accessed": "2026-11-20"
    }
  ],
  "provenance": [
    "UCSB identifies the authors' technical report as 2005-23, dated 1 May 2005. The linked full manuscript supplies the update rule and frequency bounds; no speedup or workload distribution is imported.",
    "The example's eviction tie-break is explicitly fixed. Other valid tie-breaks can retain different identities; deterministic frequency guarantees do not imply a unique output representation.",
    "This record covers cumulative unit insertions without aging, deletions, weighted updates or saturated counters. Estimated request popularity is not a complete cache-admission policy."
  ]
}
