{"provider_name":"Hatena Blog","width":"100%","blog_url":"https://int128.hatenablog.com/","categories":["app engine","java"],"title":"appengine-mapreduce-java\u306b\u304a\u3051\u308bSharding\u306e\u5236\u9650\u4e8b\u9805","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fint128.hatenablog.com%2Fentry%2F20101108%2F1289233875\" title=\"appengine-mapreduce-java\u306b\u304a\u3051\u308bSharding\u306e\u5236\u9650\u4e8b\u9805 - GeekFactory\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","url":"https://int128.hatenablog.com/entry/20101108/1289233875","author_url":"https://blog.hatena.ne.jp/int128/","published":"2010-11-08 01:31:15","version":"1.0","author_name":"int128","height":"190","provider_url":"https://hatena.blog","type":"rich","description":"appengine-mapreduce-java\u3067\u4e26\u5217\u5ea6\u304c\u4e0a\u304c\u3089\u306a\u3044\u304b\u3089\u5909\u3060\u3068\u601d\u3063\u3066\u3044\u305f\u3089\u3001\u30e6\u30fc\u30b6\u30ac\u30a4\u30c9\u306b\u4ee5\u4e0b\u306e\u8a18\u8ff0\u304c\u3042\u308a\u307e\u3057\u305f\u3002 Sharding is currently done by splitting the space of keys lexicographically. For instance, suppose you have the keys 'a', 'ab', 'ac', and 'e' and you request two splits. The framework will find that the first key is 'a' and the last k\u2026","image_url":null,"blog_title":"GeekFactory"}