The Fifth Elephant 2015

A conference on data, machine learning, and distributed and parallel computing

POC: How to slice, dice & search billions of users events in seconds (from scratch)

Submitted by Bhasker Kode (@bhaskerkode) on Sunday, 14 June 2015

Section: Crisp Talk Technical level: Beginner

View proposal in schedule


results from a proof of concept business intelligence tool, where each bit in a multi-billion bitmap, represented a user performing an event. a minimal 100 LOC implementation gave encouraging results, and also areas that could improve - caveats, ideas to roll out your own BI tool.


Supported actions:

Couting the number of users performing an event(cardinality)
Counting the number of users performing a combination of 1000 events
How to support searching events across time ranges (to suit your case)

1) bits to be compared
2) bits intersection
3) time for running intersection
4) time for counting intersection
5) hacks & tricks when working with bits, popcount & bitmaps

First version up in two days. Will show you how to get it up and running for your internal team as well.

Speaker bio

Bosky (@bhaskerkode) leads a product engg team at Helpshift & works on erlang, clojure and golang.

building distributed systems since ‘06 across edtech, adtech & mobile in erlang, clojure & go.

more talks at

more about bosky at




  • Jaime Allen (@jaimeallen) 2 months ago

    Much a debt of gratitude is in order for the latest advancement. I’m totally drawn in with the post of for the challenges. The tip of the making is eaten up by me concerning advancement and mobile phones.

Login with Twitter or Google to leave a comment