Presentation 2014-05-16
Efficiency Tricks for Hashing and Blooming in Streaming Algorithms
Marat ZHANIKEEV,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Streaming algorithms, also known as data streaming, are a realtime/online alternative to offline processing of data stored in a database. While streaming, it is important to stay below the per-item processing time budget. Since one would still like to extract as much valuable information as possible from the stream (larger sketches), it is important to use highly efficient algorithms for hash functions and bloom filters. This paper presents some of the efficiency tricks in this area. Note that the topic is only distantly related to the space efficiency (memory footprint minimization) problem and pursues drastically different objectives.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) fast hashing / blooming / bloom filter / streaming algorithm / efficient algorithm
Paper # IT2014-1
Date of Issue

Conference Information
Committee IT
Conference Date 2014/5/9(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Theory (IT)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Efficiency Tricks for Hashing and Blooming in Streaming Algorithms
Sub Title (in English)
Keyword(1) fast hashing
Keyword(2) blooming
Keyword(3) bloom filter
Keyword(4) streaming algorithm
Keyword(5) efficient algorithm
1st Author's Name Marat ZHANIKEEV
1st Author's Affiliation Computer Science and Systems Engineering Kyushu Institute of Technology()
Date 2014-05-16
Paper # IT2014-1
Volume (vol) vol.114
Number (no) 34
Page pp.pp.-
#Pages 4
Date of Issue