<?xml version="1.0" encoding="utf-8"?>
<feed xml:lang="en-us" xmlns="http://www.w3.org/2005/Atom"><title>Simon Willison's Weblog: thrift</title><link href="http://simonwillison.net/" rel="alternate"/><link href="http://simonwillison.net/tags/thrift.atom" rel="self"/><id>http://simonwillison.net/</id><updated>2009-10-21T22:11:37+00:00</updated><author><name>Simon Willison</name></author><entry><title>Introducing BERT and BERT-RPC</title><link href="https://simonwillison.net/2009/Oct/21/bert/#atom-tag" rel="alternate"/><published>2009-10-21T22:11:37+00:00</published><updated>2009-10-21T22:11:37+00:00</updated><id>https://simonwillison.net/2009/Oct/21/bert/#atom-tag</id><summary type="html">
    
&lt;p&gt;&lt;strong&gt;&lt;a href="http://github.com/blog/531-introducing-bert-and-bert-rpc"&gt;Introducing BERT and BERT-RPC&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;
Justification for inventing a brand new serialisation protocol: Thrift and Protocol Buffers both use IDLs and code generation, XML “is not convertible to a simple unambiguous data structure in any language I’ve ever used” and JSON lacks support for unencoded binary data. The result is BERT—Binary ERlang Term—which extracts a format from Erlang in much the same way that JSON extracted one from JavaScript.


    &lt;p&gt;Tags: &lt;a href="https://simonwillison.net/tags/erlang"&gt;erlang&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/github"&gt;github&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/javascript"&gt;javascript&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/json"&gt;json&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/protocolbuffers"&gt;protocolbuffers&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/serialisation"&gt;serialisation&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/thrift"&gt;thrift&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/xml"&gt;xml&lt;/a&gt;&lt;/p&gt;



</summary><category term="erlang"/><category term="github"/><category term="javascript"/><category term="json"/><category term="protocolbuffers"/><category term="serialisation"/><category term="thrift"/><category term="xml"/></entry><entry><title>simple-thrift-queue</title><link href="https://simonwillison.net/2008/Aug/4/thrift/#atom-tag" rel="alternate"/><published>2008-08-04T12:27:16+00:00</published><updated>2008-08-04T12:27:16+00:00</updated><id>https://simonwillison.net/2008/Aug/4/thrift/#atom-tag</id><summary type="html">
    
&lt;p&gt;&lt;strong&gt;&lt;a href="http://github.com/myelin/simple-thrift-queue/tree/master"&gt;simple-thrift-queue&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;
Phillip Pearson’s surprisingly concise in-memory message queue written in Python using Facebook’s Thrift library (which is similar to Protocol Buffers, but was open sourced much earlier on). Handles 4,000 requests per second on a laptop.

    &lt;p&gt;&lt;small&gt;&lt;/small&gt;Via &lt;a href="http://www.myelin.co.nz/post/2008/8/4/"&gt;Queuing with Thrift&lt;/a&gt;&lt;/small&gt;&lt;/p&gt;


    &lt;p&gt;Tags: &lt;a href="https://simonwillison.net/tags/facebook"&gt;facebook&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/message-queues"&gt;message-queues&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/messaging"&gt;messaging&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/phillip-pearson"&gt;phillip-pearson&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/protocolbuffers"&gt;protocolbuffers&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/python"&gt;python&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/thrift"&gt;thrift&lt;/a&gt;&lt;/p&gt;



</summary><category term="facebook"/><category term="message-queues"/><category term="messaging"/><category term="phillip-pearson"/><category term="protocolbuffers"/><category term="python"/><category term="thrift"/></entry></feed>