AnsweredAssumed Answered

Atomic probabilistic counting and set membership

Question asked by danielsiegmann on Apr 28, 2015
Latest reply on Apr 29, 2015 by danielsiegmann
I am looking to do probabilistic counting and set membership using structures such as bloom filters and hyperloglog. I know I can store such structures, since they're just serialized as bytes, but I don't want to use optimistic locking because contention is high.

Is there any support for performing such operations atomically on the server-side, through user-defined functions or similar? Or any way for me to add extensions with such functionality? Apache HBase has coprocessors which might work, but I think MapR-DB doesn't?

(I could ingest the data through another system and batch the updates to reduce the contention, but it would be far simpler if all this could be handled in the database server.)