We did some test on on Cassandra, and the benchmark is from Section 7 of the
BigTable paper Bigtable: A Distributed Storage System for Structured Data,
the benchmark task includes: random write, random read, sequential write, and
sequential read. The test results made us puzzled. We use a
why reads are slower than writes:
http://wiki.apache.org/cassandra/FAQ#reads_slower_writes
no idea on seq vs random. i would not be surprised if there is a bug
in your test code.
On Fri, Mar 12, 2010 at 12:36 AM, Bingbing Liu rucb...@gmail.com wrote:
We did some test on on Cassandra, and the
the difference between se and random the test code is just how the key of each
record is generated.
the test code is :
long totalSWriteTime = 0;
for (int i = 0; i totalRows; i++) {
byte[] key = dg.getRandomRow();//when sequential write , we use i as the key
byte[] data = dg.generateValue();
Bingbing Liu,
On Fri, Mar 12, 2010 at 1:36 PM, Bingbing Liu rucb...@gmail.com wrote:
We did some test on on Cassandra, and the benchmark is from Section 7 of
the BigTable paper “Bigtable: A Distributed Storage System for Structured
Data”, the benchmark task includes: random write, random
