[jira] [Commented] (CASSANDRA-8921) Experiment with a probabilistic tree of membership for maxPurgeableTimestamp

["Daniel Chia (JIRA)" <ji...@apache.org>]

    [ https://issues.apache.org/jira/browse/CASSANDRA-8921?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14658868#comment-14658868 ] 

Daniel Chia commented on CASSANDRA-8921:
----------------------------------------

[~benedict] if no one is working on this, I might give this a go.

> Experiment with a probabilistic tree of membership for maxPurgeableTimestamp
> ----------------------------------------------------------------------------
>
>                 Key: CASSANDRA-8921
>                 URL: https://issues.apache.org/jira/browse/CASSANDRA-8921
>             Project: Cassandra
>          Issue Type: Improvement
>          Components: Core
>            Reporter: Benedict
>
> maxPurgeableTimestamp appears to be a significant cost for some workloads, the majority of which stemming from the cost of membership tests across the overlapping tables. It would be possible to construct a tree of bloom filters from the existing filters, that could yield queries of the set of possible membership of a given key with logarithmic performance, and it appears there is a research paper (that I haven't dived into yet) that outlines something like this http://www.usna.edu/Users/cs/adina/research/Bloofi%20_CloudI2013.pdf



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)