Improved range-summable random variable construction algorithms

A. R. Calderbank, A. Gilbert, K. Levchenko, S. Muthukrishnan, M. Strauss

    Research output: Contribution to conferencePaperpeer-review


    Range-summable universal hash functions, also known as range-summable random variables, are binary-valued hash functions which can efficiently hash single values as well as ranges of values from the domain. They have found several applications in the area of data stream processing where they are used to construct sketches - small-space summaries of the input sequence. We present two new constructions of range-summable universal hash functions on n-bit strings, one based on Reed-Muller codes which gives k-universal hashing using O(n log k) space arid time for point operations and O(n 2 1og k) for range operations, and another based on a new subcode of the second-order Reed-Muller code, which gives 5-universal hashing using O(n) space, O(n log 3 n) time for point operations, and O(n 3) time for range operations. We also present a new sketch data structure using the new hash functions which improves several previous results.

    Original languageEnglish (US)
    Number of pages10
    StatePublished - 2005
    EventSixteenth Annual ACM-SIAM Symposium on Discrete Algorithms - Vancouver, BC, United States
    Duration: Jan 23 2005Jan 25 2005


    OtherSixteenth Annual ACM-SIAM Symposium on Discrete Algorithms
    Country/TerritoryUnited States
    CityVancouver, BC

    ASJC Scopus subject areas

    • Software
    • General Mathematics


    Dive into the research topics of 'Improved range-summable random variable construction algorithms'. Together they form a unique fingerprint.

    Cite this