Return-Path: Delivered-To: apmail-incubator-cassandra-user-archive@minotaur.apache.org Received: (qmail 78959 invoked from network); 20 Feb 2010 20:20:58 -0000 Received: from hermes.apache.org (HELO mail.apache.org) (140.211.11.3) by minotaur.apache.org with SMTP; 20 Feb 2010 20:20:58 -0000 Received: (qmail 11285 invoked by uid 500); 20 Feb 2010 20:20:57 -0000 Delivered-To: apmail-incubator-cassandra-user-archive@incubator.apache.org Received: (qmail 11266 invoked by uid 500); 20 Feb 2010 20:20:57 -0000 Mailing-List: contact cassandra-user-help@incubator.apache.org; run by ezmlm Precedence: bulk List-Help: List-Unsubscribe: List-Post: List-Id: Reply-To: cassandra-user@incubator.apache.org Delivered-To: mailing list cassandra-user@incubator.apache.org Received: (qmail 11257 invoked by uid 99); 20 Feb 2010 20:20:57 -0000 Received: from nike.apache.org (HELO nike.apache.org) (192.87.106.230) by apache.org (qpsmtpd/0.29) with ESMTP; Sat, 20 Feb 2010 20:20:57 +0000 X-ASF-Spam-Status: No, hits=-0.0 required=10.0 tests=SPF_PASS X-Spam-Check-By: apache.org Received-SPF: pass (nike.apache.org: domain of jbellis@gmail.com designates 74.125.78.150 as permitted sender) Received: from [74.125.78.150] (HELO ey-out-1920.google.com) (74.125.78.150) by apache.org (qpsmtpd/0.29) with ESMTP; Sat, 20 Feb 2010 20:20:49 +0000 Received: by ey-out-1920.google.com with SMTP id 13so36201eye.8 for ; Sat, 20 Feb 2010 12:20:29 -0800 (PST) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=gamma; h=domainkey-signature:mime-version:received:in-reply-to:references :from:date:message-id:subject:to:content-type :content-transfer-encoding; bh=PF/nYdtc3r4zQhC243MV/4e8Tdr3HKA6u7oV9jl3lBw=; b=m1j+F41zRmMDCjLROVIPIP75Rhg7VsrxnZp6gkh1wLIN/dL/A6w7Fl3PYZN19fHuhT w+W/TpNSTzVaqECGTYt2Qcxyd4Ig1bVsQOZtp4mCywMeDKcIgr4RD+CvIEJKWt4Lz4jT coRAlltE92CdtCEdLhcz/EV6B5nO2nrBgeXeA= DomainKey-Signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:in-reply-to:references:from:date:message-id:subject:to :content-type:content-transfer-encoding; b=fPEwV+UJyNARMJKPI85TzA4esm+aChPBX4dj8ov3XvbGq1MegFsY9QF+FN9+wgJRQo JtIqeFM7Q+xaV7hvjZvLiJDH6GanyOWoWqmIp9S9bDUr9+RJ6Zb1r+zLIA7BukbdTunh adgwbS462CLNtMeh5a71XBPA/ACbt2t+0/Bvc= MIME-Version: 1.0 Received: by 10.216.159.204 with SMTP id s54mr1578699wek.99.1266697229246; Sat, 20 Feb 2010 12:20:29 -0800 (PST) In-Reply-To: <5f7770581002201212l7b0f8e9apc4a1ecf05a498365@mail.gmail.com> References: <016e01cab13d$a6f7a790$f4e6f6b0$@com> <5f7770581002201212l7b0f8e9apc4a1ecf05a498365@mail.gmail.com> From: Jonathan Ellis Date: Sat, 20 Feb 2010 15:20:09 -0500 Message-ID: Subject: Re: Testing row cache feature in trunk: write should put record in cache To: cassandra-user@incubator.apache.org Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable X-Virus-Checked: Checked by ClamAV on apache.org We don't use native java serialization for anything but the on-disk BitSets in our bloom filters (because those are deserialized once at startup, so the overhead doesn't matter), btw. We're talking about adding compression after https://issues.apache.org/jira/browse/CASSANDRA-674. On Sat, Feb 20, 2010 at 3:12 PM, Tatu Saloranta wrot= e: > On Fri, Feb 19, 2010 at 11:44 AM, Weijun Li wrote: >> I see. How much is the overhead of java serialization? Does it slow down= the >> system a lot? It seems to be a tradeoff between CPU usage and memory. > > This should be relatively easy to measure, as a stand-alone thing. Or > maybe even from profiler stack traces > =A0If native Java serialization is used, there may be more efficient > alternatives, depending on data -- default serialization is highly > inefficient for small object graphs (like individual objects), but ok > for larger graphs; this because much of class metadata is included, > result is very self-contained. > Beyond default serialization, there are more efficient general-purpose > Java serialization frameworks; like Kryo or fast(est) json-based > serializers (jackson); see > [http://code.google.com/p/thrift-protobuf-compare/wiki/Benchmarking] > for some idea on alternatives. > > In fact: one interesting idea would be to further trade some CPU for > less memory by using fast compression (like LZF). I hope to experiment > with this idea some time in future. But challenge is that this would > help most with clustered scheme (compressing more than one distinct > item), which is much trickier to make work. Compression does ok with > individual items, but real boost comes from redundancy between similar > items. > > -+ Tatu +- >