Giovanni Bajo's swapfile

Because memory is volatile
Options:

Golomb-coded sets: smaller than Bloom filters

04 Sep

Posted by: Giovanni Bajo in: C++, Optimizations, Python

While reading the super-interesting Imperial Violet, Adam Langley’s weblog, I stumbled upon a new data structure that I had never heard of: the Golomb-coded sets (GCS). It is a probabilistic data structure conceptually similar to the famous Bloom filters, but with a more compact in-memory representation, and a slower query time.

C++ and copy-on-write data structures

25 Mar

Posted by: Giovanni Bajo in: C++

I generally like C++ and the way C++ feels, but there is one specific quirk which is caused by STL designers’ choice of data structures which cannot be implemented with a copy-on-write (aka COW) semantic. Curious about which quirk? Keep on reading! COW might look like an implementation detail, but it can really change the [...]

Search

Follow me

GitHub ProfileTwitter ProfileLinkedIn ProfileFacebook Profile

Short mindswaps

Swap partitions

strings | sort | uniq

algorithms api C++ Canvas Compile-time Function Execution cow ctypes D DNSBL GPU greylisting H264 hash HTML5 IE9 Languages optimization Programming py2app py2exe pyinstaller Python qt RBL security SpamAssassin tokens

Recent Comments

A design creation of Design Disease

Copyright © 2010 - Giovanni Bajo's swapfile - is proudly powered by WordPress
InSense 1.0 Theme by Design Disease brought to you by HostGator Web Hosting.