{"push_id":1365111892,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"c95cf53b6d82507694a00016fa6b3bef39a4b0f2","before":"82e8761688d02614de486ab660d8bffde3036929","commits":[{"sha":"c95cf53b6d82507694a00016fa6b3bef39a4b0f2","author":{"name":"Jung-Sang Ahn","email":"56b5bd6990cda0106db516a0d30a8876bcc4d785@gmail.com"},"message":"Add new Bnode class for non-block-aligned B+tree implementation\n\n- New B+tree implementation will use new B+tree node, which is not\nblock-aligned and based on binary search tree instead of array.\n\n- Each key-value pair will be logically indexed using BST, and then\nconverted to a flattened array when they are written back into the\nDB file. Maintaining BST will improve in-node insertion or removal,\nas insertion or removal at the middle of array requires memory shift\noperation, which is quite inefficient during initial load time.\n\n- Bnode class instance will be a basic unit of new Bnode cache\nimplementation.\n\nChange-Id: I1484a1ad6a0e87abd6ed0eb4e30c56f261d1c671\nReviewed-on: http://review.couchbase.org/68912\nReviewed-by: Chiyoung Seo <chiyoung@couchbase.com>\nTested-by: buildbot <build@couchbase.com>\nReviewed-by: Sundararaman Sridharan <sundar@couchbase.com>","distinct":true,"url":"https://api.github.com/repos/couchbase/forestdb/commits/c95cf53b6d82507694a00016fa6b3bef39a4b0f2"}]}
{"actor":{"display_login":"ns-codereview"}}