bunsenmcdubbs

3 ms·

1.
by bunsenmcdubbs 6y ago
Great question! You are correct, these methods would be equivalent w.r.t. tree "shape". The problem emerges downstream. In our shared database, we reply on the fact that user IDs are uniformly distributed. If we directly compared
2.
by bunsenmcdubbs 6y ago
That is an interesting idea. Off the top of my head, I'm not sure - I personally do not have much experience with graph databases (mostly focused on Postgres). We are doing some more infrastructure-y work in this area and changing the
3.
by bunsenmcdubbs 6y ago
Woah these look great! Sad I didn't encounter them earlier. Our team is actively working on improvements in this part of our data infrastructure (hence this project & blog post) so maybe there will be a follow up coming up with the
4.
by bunsenmcdubbs 6y ago
Yes! You are correct. This ensures that we are able to maintain a cohesive view of the entire "user" across all their devices, browsers etc (so long as the Heap customer has a method for identifying their end user). A classic exam
5.
by bunsenmcdubbs 6y ago
> Hopefully this data stucture can be extended to completely remove every bit of tracking information collected about a user, so that it can comply with GDPR and respect privacy This is already the case! Interestingly enough, our identit
6.
by bunsenmcdubbs 6y ago
And great question! The hashing heuristic is a bit of a cute trick and I definitely glossed over it a bit in the post. I'll try to elaborate a bit more here... > most hashes ... are essentially one way functions, ideally preserving
7.
by bunsenmcdubbs 6y ago
Hey, author here! I've been working on infrastructure and database-y things at Heap for the last couple years, ranging from improving Postgres performance and availability to building out services (like this one!) and refactoring, enca