How is a histogram implemented as a data structure?

I’m reading a paper about O(1) median filtering. I’m confused how histograms, denoted H, have the properties described. How can histograms be implemented such that: summing histograms, H(A ∪ B) = H(A) + H(B), is a O(1) operation with respect to the number of accumulated (points)?