Core Spring Data
Written by: Oliver Gierke
Featured Refcardz: Top Refcardz:
  1. Git
  2. Prep for CD
  3. DNS
  4. Data Mining
  5. Spring Data
  1. Data Mining
  2. Spring Data
  3. DNS
  4. Machine Learning
  5. MongoDB
150+ Refcardz Available · Get them all

Link Details

Previous | Next

Surprise Me!

Link 930145 thumbnail
User 1112497 avatar

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

A simple time decaying approximate membership filter
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.
Vote up
Vote down
  • 4
  • 0
  • 617
  • 429
SaveShareSend Tags: , , ,

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)