hbase-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "cuijianwei (JIRA)" <j...@apache.org>
Subject [jira] [Updated] (HBASE-10153) improve VerifyReplication to compute BADROWS more accurately
Date Fri, 13 Dec 2013 04:03:07 GMT

     [ https://issues.apache.org/jira/browse/HBASE-10153?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]

cuijianwei updated HBASE-10153:
-------------------------------

    Description: VerifyReplicaiton could compare the source table with its peer table and
compute BADROWS. However, the current BADROWS computing method might not be accurate enough.
For example, if source table contains rows as {r1, r2, r3, r4} and peer table contains rows
as {r1, r3, r4} BADROWS will be 3 because 'r2' in source table will make all the later row
comparisons fail. Will it be better if the BADROWS is computed to 1 in this situation? Maybe,
we can compute the BADROWS more accurately in merge comparison?  (was: VerifyReplicaiton could
compare the source table with its peer table and compute BADROWS. However, the current BADROWS
computing method might not be accurate enough. For example, if source table contains rows
as {r1, r2, r3, r4} and peer table contains rows as {r1, r3, r4}, the BADROWS counter will
be 3 because 'r2' in source table will make all the later comparisons fail. Will it be better
if the BADROWS is computed to 1 in this situation? Maybe, we can compute the BADROWS more
accurately in merge comparison?)

> improve VerifyReplication to compute BADROWS more accurately
> ------------------------------------------------------------
>
>                 Key: HBASE-10153
>                 URL: https://issues.apache.org/jira/browse/HBASE-10153
>             Project: HBase
>          Issue Type: Improvement
>          Components: Replication
>    Affects Versions: 0.94.14
>            Reporter: cuijianwei
>         Attachments: HBASE-10153-0.94-v1.patch
>
>
> VerifyReplicaiton could compare the source table with its peer table and compute BADROWS.
However, the current BADROWS computing method might not be accurate enough. For example, if
source table contains rows as {r1, r2, r3, r4} and peer table contains rows as {r1, r3, r4}
BADROWS will be 3 because 'r2' in source table will make all the later row comparisons fail.
Will it be better if the BADROWS is computed to 1 in this situation? Maybe, we can compute
the BADROWS more accurately in merge comparison?



--
This message was sent by Atlassian JIRA
(v6.1.4#6159)

Mime
View raw message