Return-Path: X-Original-To: apmail-hbase-dev-archive@www.apache.org Delivered-To: apmail-hbase-dev-archive@www.apache.org Received: from mail.apache.org (hermes.apache.org [140.211.11.3]) by minotaur.apache.org (Postfix) with SMTP id 2E22DD235 for ; Tue, 19 Feb 2013 06:19:15 +0000 (UTC) Received: (qmail 62225 invoked by uid 500); 19 Feb 2013 06:19:14 -0000 Delivered-To: apmail-hbase-dev-archive@hbase.apache.org Received: (qmail 61797 invoked by uid 500); 19 Feb 2013 06:19:14 -0000 Mailing-List: contact dev-help@hbase.apache.org; run by ezmlm Precedence: bulk List-Help: List-Unsubscribe: List-Post: List-Id: Reply-To: dev@hbase.apache.org Delivered-To: mailing list dev@hbase.apache.org Received: (qmail 61712 invoked by uid 99); 19 Feb 2013 06:19:12 -0000 Received: from arcas.apache.org (HELO arcas.apache.org) (140.211.11.28) by apache.org (qpsmtpd/0.29) with ESMTP; Tue, 19 Feb 2013 06:19:12 +0000 Date: Tue, 19 Feb 2013 06:19:12 +0000 (UTC) From: "Robert Dyer (JIRA)" To: dev@hbase.apache.org Message-ID: In-Reply-To: References: Subject: [jira] [Created] (HBASE-7877) KeyPrefixRegionSplitPolicy and DelimitedKeyPrefixRegionSplitPolicy splits are not always optimal MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8 Content-Transfer-Encoding: 7bit X-JIRA-FingerPrint: 30527f35849b9dde25b450d4833f0394 Robert Dyer created HBASE-7877: ---------------------------------- Summary: KeyPrefixRegionSplitPolicy and DelimitedKeyPrefixRegionSplitPolicy splits are not always optimal Key: HBASE-7877 URL: https://issues.apache.org/jira/browse/HBASE-7877 Project: HBase Issue Type: Improvement Components: regionserver Affects Versions: 0.94.5, 0.96.0 Reporter: Robert Dyer Priority: Minor With KeyPrefixRegionSplitPolicy (and now DelimitedKeyPrefixRegionSplitPolicy), if a split would break a group of keys it is modified to become the first key in the group's range. This is not always optimal. If the distribution of keys are such that the group containing the split has half the keys in the region, then no split will occur. The best solution would be to compute both the current key group's first key (what the current implementation does) as well as the next key group's first key and then choosing which of the two is closest to the original split point. -- This message is automatically generated by JIRA. If you think it was sent incorrectly, please contact your JIRA administrators For more information on JIRA, see: http://www.atlassian.com/software/jira