Gregory Chanan explains the ACID per-row semantics of HBase and the usage of row-level locks and MVCC to ensure them:
- (w1) After acquiring the RowLock, each write operation is immediately assigned a write number
- (w2) Each data cell in the write stores its write number.
- (w3) A write operation completes by declaring it is finished with the write number.
- (r1) Each read operation is first assigned a read timestamp, called a read point.
- (r2) The read point is assigned to be the highest integer such that all writes with write number <= x have been completed.
- (r3) A read r for a certain (row, column) combination returns the data cell with the matching (row, column) whose write number is the largest value that is less than or equal to the read point of r.
Probably self understood that you should read and save this article if HBase is already in your datacenter or at least at horizon.
Original title and link: Apache HBase Internals: Locking and Multiversion Concurrency Control ( ©myNoSQL)