Before running benchmarks for DeMon , an experimental distributed data store, I read Gernot Heiser's amazing list of benchmarking crimes and best practices. What it didn't tell me is that I needed to use open loop clients. Let me tell you why.
A great blog post from 2013 describes using bloom filters to build a space-efficient full text search index for small numbers of documents. The algorithm is simple: Per document, create a bloom filter of all its words. To query, simply check each document's bloom filter for the query terms. With a query time complexity of O(number-of-documents) , we can forget about using this on big…
Experience it yourself at transitmap.io (now defunct). Transitmap lets you watch thousands of buses, metros, commuter trains, and even ferries move across a map in real time. Try it on your phone next time you are waiting for a bus in Sweden. In most cases, the vehicle on transitmap will move only a few seconds behind the real one.