{"paper":{"title":"Dynamic Range Majority Data Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Amr Elmasry, J. Ian Munro, Meng He, Patrick K. Nicholson","submitted_at":"2011-04-28T21:35:40Z","abstract_excerpt":"Given a set $P$ of coloured points on the real line, we study the problem of answering range $\\alpha$-majority (or \"heavy hitter\") queries on $P$. More specifically, for a query range $Q$, we want to return each colour that is assigned to more than an $\\alpha$-fraction of the points contained in $Q$. We present a new data structure for answering range $\\alpha$-majority queries on a dynamic set of points, where $\\alpha \\in (0,1)$. Our data structure uses O(n) space, supports queries in $O((\\lg n) / \\alpha)$ time, and updates in $O((\\lg n) / \\alpha)$ amortized time. If the coordinates of the poi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5517","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}