4 ms·
Cool! I didn't totally follow the issues with keeping the data in memory, and it sounds like it is solved now - but you could probably use a cardinality estima
by me_again 3y ago
Cool!
I didn't totally follow the issues with keeping the data in memory, and it sounds like it is solved now - but you could probably use a cardinality estimation algorithm to estimate the number of unique beacon IDs while only using constant space. https://en.wikipedia.org/wiki/Count-distinct_problem https://en.wikipedia.org/wiki/Count-distinct_problem
- sodality2 3y agoThat’s a really good point. I’ve been meaning to go to a football game recently and bring it, to stress test it with the largest gathering I can quickly access. If it can easily scan a couple thousand without a sweat, I’d consider it pretty solid anyway. But a fixed-size estimating data structure would be really cool to research. I will surely look into it, thank you for the suggestion! Side note: Definitely one of my favorite parts of this project, that I get to investigate more in-depth and interesting CS concepts without having to worry about doing the easiest solution. I’m scratching an itch, not developing a solution to deliver ASAP.