Return-Path: X-Original-To: apmail-cassandra-user-archive@www.apache.org Delivered-To: apmail-cassandra-user-archive@www.apache.org Received: from mail.apache.org (hermes.apache.org [140.211.11.3]) by minotaur.apache.org (Postfix) with SMTP id AEBC2C301 for ; Thu, 24 May 2012 13:47:40 +0000 (UTC) Received: (qmail 24593 invoked by uid 500); 24 May 2012 13:47:38 -0000 Delivered-To: apmail-cassandra-user-archive@cassandra.apache.org Received: (qmail 24509 invoked by uid 500); 24 May 2012 13:47:38 -0000 Mailing-List: contact user-help@cassandra.apache.org; run by ezmlm Precedence: bulk List-Help: List-Unsubscribe: List-Post: List-Id: Reply-To: user@cassandra.apache.org Delivered-To: mailing list user@cassandra.apache.org Received: (qmail 24501 invoked by uid 99); 24 May 2012 13:47:38 -0000 Received: from nike.apache.org (HELO nike.apache.org) (192.87.106.230) by apache.org (qpsmtpd/0.29) with ESMTP; Thu, 24 May 2012 13:47:38 +0000 X-ASF-Spam-Status: No, hits=-2.8 required=5.0 tests=HTML_MESSAGE,RCVD_IN_DNSWL_HI,SPF_PASS X-Spam-Check-By: apache.org Received-SPF: pass (nike.apache.org: local policy) Received: from [192.54.144.131] (HELO thsbbfxrt01p.thalesgroup.com) (192.54.144.131) by apache.org (qpsmtpd/0.29) with ESMTP; Thu, 24 May 2012 13:47:30 +0000 Received: from thsbbfxrt01p.thalesgroup.com (localhost.localdomain [127.0.0.1]) by localhost (Postfix) with SMTP id 8B67559A41E for ; Thu, 24 May 2012 15:47:03 +0200 (CEST) From: DE VITO Dominique To: "user@cassandra.apache.org" Date: Thu, 24 May 2012 15:47:01 +0200 Subject: what about an "hybrid" partitioner for CF with composite row key ? Thread-Topic: what about an "hybrid" partitioner for CF with composite row key ? Thread-Index: AQHNOGKvvyOeVnMqgUiTgXSpXq6QGpbW8q+AgAA/QsCAAKQ9AIAAlBsQgAAaqwCAAGfi8IAACW9A Message-ID: <12237_1337867223_4FBE3BD7_12237_3046_3_AEE40020481AB74EAADC798FC2BC7C4A01B13E26F945@THSONEA01CMS03P.one.grp> References: <5465E653-8578-42EF-A849-360610DC11DB@thelastpickle.com> <2C85E14562B39345BCCAD90B8E7955C913E4B4@DKEXC002.adform.com> <2C85E14562B39345BCCAD90B8E7955C914692F@DKEXC002.adform.com> <59E65970-9699-4517-BF7D-3E1B6E8007A4@thelastpickle.com> <2C85E14562B39345BCCAD90B8E7955C9149A2B@DKEXC002.adform.com> In-Reply-To: <2C85E14562B39345BCCAD90B8E7955C9149A2B@DKEXC002.adform.com> Accept-Language: fr-FR Content-Language: fr-FR X-MS-Has-Attach: X-MS-TNEF-Correlator: acceptlanguage: fr-FR x-pmwin-version: 3.1.0.0, Antivirus-Engine: 3.31.1, Antivirus-Data: 4.77G Content-Type: multipart/alternative; boundary="_000_AEE40020481AB74EAADC798FC2BC7C4A01B13E26F945THSONEA01CM_" MIME-Version: 1.0 --_000_AEE40020481AB74EAADC798FC2BC7C4A01B13E26F945THSONEA01CM_ Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: quoted-printable Hi, We have defined a CF with a composite row key that sounds like (folder id, = doc id). For our app, one very common pattern is accessing, through one ui action, s= ome bunch of data with the following row keys: (id, id_1), (id, id_2), (id,= id_3)... So, multiple rows are accessed, but all row keys have the same 1st part "fo= lder id". * with the BOP: for one ui action, one simple node is requested (in average= ), but it's much harder to balances the cluster nodes * with the RP: for one ui action, many nodes may be requested, but it's sim= pler to balance the cluster one sweeter(?) partitioner would be a partitioner that would distribute a r= ow according only to the first part of its key (=3D according to "folder id= " only). Is it doable to implement such a partitioner ? Thanks. Regards, Dominique --_000_AEE40020481AB74EAADC798FC2BC7C4A01B13E26F945THSONEA01CM_ Content-Type: text/html; charset="us-ascii" Content-Transfer-Encoding: quoted-printable

Hi,

 

We have defined a CF with a composite row key that sounds li= ke (folder id, doc id).

 

For our app, one very common pattern is accessing, through o= ne ui action, some bunch of data with the following row keys: (id, id_1), (id, id_2), (id, id_3)...

So, multiple rows are accessed, but all row keys have the sa= me 1st part "folder id".

 

* with the BOP: for one ui action, one simple node is reques= ted (in average), but it's much harder to balances the cluster nodes=

* with the RP: for one ui action, many nodes may be requeste= d, but it's simpler to balance the cluster

 

one sweeter(?) partitioner would be a partitioner that would distribute a row according only to the first part of its key (=3D according= to "folder id" only).

 

Is it doable to implement such a partitioner ?

Thanks.

 

Regards,

Dominique

 

--_000_AEE40020481AB74EAADC798FC2BC7C4A01B13E26F945THSONEA01CM_--