When: Thursday, 2014-Oct-16, 11h30-12h00
Where: FCUL-DI, room C6.3.38
Presenter: Vinicius Cogo
Abstract: In this smalltalk, the presenter will describe the Bloom filter (BF) data structure, as well as present known use cases in big data and some existent implementations. BFs are space-efficient probabilistic data structures for membership testing (i.e., test if an element belongs or not to a large dataset).
About the presenter: Ph.D student at FCUL-DI