search

require-lx / community

The Javascript and Node.js meetup group in Lisbon
http://meetup.com/require-lx
37 stars 8 forks source link

TALK: Probabilistic Data Structures #88

Closed mping closed 8 years ago

mping commented 9 years ago

intro

In this talk I want to describe a bit some data structures that can give very approximate answers with a much lower footprint than what would be required to give an exact value.

description

Some data structures and algorithms such as HyperLogLog, Bloom Filters, etc can provide an interesting tradeoff between accuracy and memory, being ideal candidates for a range of applications.

In this talk I want to expose some of the problems of digging through large volumes of data, as well as some of the data structures that can give an approximate answer to queries such as cardinality estimation, membership, quantile, etc.

Although the language is dense, the talk will be light!

foliveira commented 9 years ago

Amazing @mping!

pjanuario commented 9 years ago

:+1:

joaojeronimo commented 9 years ago

:+1: :+1: :+1:

JosePedroDias commented 9 years ago

:+1:

pierreozoux commented 8 years ago

It was really good :) Do we have a video of the talk? Or tell me if you know a good one? (it is to share with a friend)

mping commented 8 years ago

@pierreozoux Don't think it was taped, but here's the slides if you want: https://github.com/mping/probabilistic-data-structures

pierreozoux commented 8 years ago

Thanks @mping :+1: