I'd be interested to see it Bloom filters are a useful data structure for some scenarios though I'd be concerned that a graph backed by a bloom filter is subject to data loss because it would be possible to not insert some triples because the filter thinks they are already present as you can always get false positives.
Also I wonder what value such an implementation has because you still have to store the triples somewhere so does it actually save any memory? I.e. what is the value proposition of such an implementation Rob On 08/03/2015 18:34, "Claude Warren" <[email protected]> wrote: >Hello. > >I have recently completed a bloom filter based graph implementation that >works both in memory and with MySQL. I think that the MySQL >implementation >is more performant that the SDB implementation, though I have not >completed >testing. > >The MySQL implementation requires a UDF to handle the Bloom searching. > >I am wondering if anyone is interested in this implementation. > >Claude > >-- >I like: Like Like - The likeliest place on the web ><http://like-like.xenei.com> >LinkedIn: http://www.linkedin.com/in/claudewarren
