Link Details

Link 930145 thumbnail
User 1112497 avatar

By andrewconner
via eng.42go.com
Published: Feb 27 2013 / 09:37

We discuss a simple data structure we designed for an approximate membership filter with probabilistic time decay. Our data structure needs to remember newer data with a higher probability and older data with a lower probability. In addition, we are going to have a large number of filters in the system, so a low memory overhead is required. Lastly filters are serialized/deserialized frequently, and they need to be done fast. Therefore, we looked for a different solution than LRU, and we came up with the data structure in this blog.
  • 4
  • 0
  • 1287
  • 434

Add your comment


Html tags not supported. Reply is editable for 5 minutes. Use [code lang="java|ruby|sql|css|xml"][/code] to post code snippets.

Voters For This Link (4)



Voters Against This Link (0)



    Apache Hadoop
    Written by: Piotr Krewski
    Featured Refcardz: Top Refcardz:
    1. Play
    2. Akka
    3. Design Patterns
    4. OO JS
    5. Cont. Delivery
    1. Play
    2. Java Performance
    3. Akka
    4. REST
    5. Java