DI-Smalltalk: Data structures for big data -- Bloom filter
Vinicius Cogo (Ph.D. Student)
2014-Oct-16, Thursday, 11h30-12h00
FCUL-DI, room C6.3.38
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).
Attendance and presentations are open to all.
Find more about DI-Smalltalks at https://smalltalks.di.fc.ul.

















