[ 
https://issues.apache.org/jira/browse/COUCHDB-1084?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13004362#comment-13004362
 ] 

Randall Leeds commented on COUCHDB-1084:
----------------------------------------

The difference between the SSD and spinning media here is noteworthy:
SSD:
~100k more writes but only ~20k fewer reads total.

Spinning:
~6k more writes but ~78k fewer reads.

The best way I can think to explain this is that possibly the SSD test was CPU 
bound while the spinning media test was I/O bound. The latter is almost 
certainly true. In which case, I think we're seeing the seek penalty already, 
even with a small data set. Pushing more writes down to the OS more quickly 
means our disk heads are hovering at the end of the file more, perhaps. Thus, 
the negative impact on readers. However, it's certainly *not* that reads got 
*slower* since the patch hasn't changed the read path. It's merely an artifact 
of the testing environment and relaximation's as-fast-as-possible benchmark 
style.

On the other hand, avoiding the seek by using an SSD and increasing the I/O 
bandwidth we maybe see just how much those saved CPU cycles can push writes 
through faster to more heavily saturate the disk and get niiiice write 
throughput.

More testing maybe, but does this align with what you see?

> Remove unnecessary btree lookup inside couch_db_updater
> -------------------------------------------------------
>
>                 Key: COUCHDB-1084
>                 URL: https://issues.apache.org/jira/browse/COUCHDB-1084
>             Project: CouchDB
>          Issue Type: Improvement
>          Components: Database Core
>    Affects Versions: 1.2
>            Reporter: Damien Katz
>            Assignee: Damien Katz
>         Attachments: remove_btree_lookup.patch
>
>
> The CouchDB update process has an unnecessary btree lookup, where it reads 
> the values in bulks, checks for conflicts, writes the docs to disk, updates 
> the values appropriately and writes them to the btree out in a second step. 
> It's possible to avoid this second step, and instead do all the checking, doc 
> writing and value transformation in a single btree lookup, thereby reducing 
> the number of btree traversals and disk IO.

--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira

Reply via email to