Dealing with multi-partition transactions in a distributed KV solution - High Scalability -

I've been getting asked about this a lot lately so I figured I'd just blog about it. Products like WebSphere eXtreme Scale work by taking a dataset, partitioning it using a key and then assigning those partitions to a number of JVMs. Each partition usually has a primary and a replica. These 'shards' are assigned to JVMs. A transactional application typically interacts with the data on a single par

[rawwell]

"Multi-partition transactions can be great for searching large amounts of data in parallel. The search speed/second does increase with the grid size. Larger grids can store larger amounts of data but the throughput typically stays the same as the grid grows (assuming the data size grows linearly wit

[kazutanaka]

複数パーティションにまたがる検索のスケーラビリティ、キャッシュかリバースインデクスで単一パーティション検索に転化、それが不可能ならパーティションを同一内容の複数グリッドにしてラウンドロビン