Storage Systems Seminar: Concise: A Fast and Memory-Efficient Key-Value Query Structure

Professor Chen Qian will give a talk on his research:

Concise: A Fast and Memory-Efficient Key-Value Query Structure

I will introduce a forwarding information base (FIB) design for layer-two network switching, called Concise. The data structure and algorithms of Concise are based on minimal perfect hashing. Concise costs the least memory and achieves fastest switching speed compared to existing FIB solutions. Concise may also help other big data applications such as distributed file indexing and ultra-fast taxonomy classification of metagenomic sequences.

When:
Monday, January 23, 2017 at 1:15 PM

Where:
E2-599

SSRC Contact:
Ethan L. Miller

Last modified 9 Jan 2017