Has anyone watched this yet? http://code.google.com/events/io/sessions/MercurialBigTable.html It's kind of interesting - a Googler talks about getting Mercurial running on BigTable. What fascinates me is that if I'm not horribly mistaken, it seems like they just threw out the revlog format entirely and just store the data in a key-value store as sort of a Git-like content addressable filesystem. I had thought they were taking advantage of the revlog structure somehow, but it appears like they basically just changed the underlying data format to be much more like Git and rewrote ah Hg speaking server on top of that. They even explicitly store the head values like refs instead of reading childless nodes out of the revlog, which is what I thought Hg did. Does anyone know how they do the graph walking efficiently with this structure? He mentioned it was about half as fast as native Hg, but that seemed to be acceptable. Curious if anyone had any thoughts or information on this. Shawn, are there technical reasons why this works well the way they're doing it for Hg but would not for Git (like in the repo MINA based server)? It looks like the data structure and protocol exchange are incredibly similar after they threw away all the revlog stuff. Or is it just that they're fine with the speed loss and the Android project would not be? Scott -- To unsubscribe from this list: send the line "unsubscribe git" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html