<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="bbPress/1.0.3" -->
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>DataStax Support Forums &#187; User Favorites: zznate</title>
		<link><a href='http://www.datastax.com/support-forums/profile/zznate'>zznate</a></link>
		<description>Software, Support, and Training for Apache Cassandra</description>
		<language>en-US</language>
		<pubDate>Sat, 25 May 2013 06:12:30 +0000</pubDate>
		<generator>http://bbpress.org/?v=1.0.3</generator>
		<textInput>
			<title><![CDATA[Search]]></title>
			<description><![CDATA[Search all topics from these forums.]]></description>
			<name>q</name>
			<link>http://www.datastax.com/support-forums/search.php</link>
		</textInput>
		<atom:link href="http://www.datastax.com/support-forums/rss/profile/" rel="self" type="application/rss+xml" />

		<item>
			<title>rob4you on "Nodes were Unavailable"</title>
			<link>http://www.datastax.com/support-forums/topic/nodes-were-unavailable/page/2#post-7242</link>
			<pubDate>Wed, 31 Oct 2012 00:09:58 +0000</pubDate>
			<dc:creator>rob4you</dc:creator>
			<guid isPermaLink="false">7242@http://www.datastax.com/support-forums/</guid>
			<description>&#60;p&#62;The problem doesn't seem to have been fixed.&#60;/p&#62;
&#60;p&#62;Look at this snippet:&#60;/p&#62;
&#60;p&#62;&#38;gt; CREATE KEYSPACE a WITH strategy_class = 'org.apache.cassandra.locator.SimpleStrategy' AND strategy_options:replication_factor='1';&#60;/p&#62;
&#60;p&#62;&#38;gt; DESCRIBE KEYSPACE a;&#60;br /&#62;
CREATE KEYSPACE a WITH strategy_class = 'SimpleStrategy' AND strategy_options:replication_factor='1';&#60;/p&#62;
&#60;p&#62;&#38;gt; USE a;&#60;br /&#62;
&#38;gt; CREATE TABLE t (id int PRIMARY KEY, col1 text);&#60;/p&#62;
&#60;p&#62;&#38;gt; SELECT * FROM t:&#60;br /&#62;
Unable to complete request: one or more nodes were unavailable.&#60;/p&#62;
&#60;p&#62;&#38;gt; SHOW VERSION;&#60;br /&#62;
[cqlsh 2.2.0 &#124; Cassandra 1.1.5 &#124; CQL spec 3.0.0 &#124; Thrift protocol 19.32.0]&#60;/p&#62;
&#60;p&#62;I'm using DSE, latest release.
&#60;/p&#62;</description>
		</item>
		<item>
			<title>thobbs on "Nodes were Unavailable"</title>
			<link>http://www.datastax.com/support-forums/topic/nodes-were-unavailable/page/2#post-5799</link>
			<pubDate>Fri, 10 Aug 2012 19:11:28 +0000</pubDate>
			<dc:creator>thobbs</dc:creator>
			<guid isPermaLink="false">5799@http://www.datastax.com/support-forums/</guid>
			<description>&#60;p&#62;Thanks for the post! I sent a note to the docs team, so that should be fixed shortly.
&#60;/p&#62;</description>
		</item>
		<item>
			<title>tstarbow on "Nodes were Unavailable"</title>
			<link>http://www.datastax.com/support-forums/topic/nodes-were-unavailable/page/2#post-5688</link>
			<pubDate>Thu, 09 Aug 2012 17:48:53 +0000</pubDate>
			<dc:creator>tstarbow</dc:creator>
			<guid isPermaLink="false">5688@http://www.datastax.com/support-forums/</guid>
			<description>&#60;p&#62;It is pretty annoying that the &#34;Getting Started Using the Cassandra CLI&#34; for Cassandra 1.0 (&#60;a href=&#34;http://www.datastax.com/docs/1.0/dml/using_cql&#34; rel=&#34;nofollow&#34;&#62;http://www.datastax.com/docs/1.0/dml/using_cql&#60;/a&#62;) code doesn't work as written. It looks like it has been fixed on 1.1 docs:&#60;/p&#62;
&#60;p&#62;CREATE KEYSPACE twissandra&#60;br /&#62;
         WITH strategy_class = 'org.apache.cassandra.locator.SimpleStrategy'&#60;br /&#62;
         AND strategy_options:replication_factor='1';
&#60;/p&#62;</description>
		</item>
		<item>
			<title>semoru on "(C Sharp) .NET 3.5 clients for Cassandra 1.0.X"</title>
			<link>http://www.datastax.com/support-forums/topic/c-sharp-net-35-clients-for-cassandra-10x#post-3963</link>
			<pubDate>Fri, 27 Jul 2012 09:31:48 +0000</pubDate>
			<dc:creator>semoru</dc:creator>
			<guid isPermaLink="false">3963@http://www.datastax.com/support-forums/</guid>
			<description>&#60;p&#62;I've been recently involved within a project to connect Cassandra and VB.NET 3.5. We finally implemented it with cassandra-sharp.&#60;/p&#62;
&#60;p&#62;I made a tutorial in my blog&#60;/p&#62;
&#60;p&#62;&#60;a href=&#34;http://www.semoru.com/2012/07/27/how-to-connect-cassandra-and-net-framework-3-5/&#34; rel=&#34;nofollow&#34;&#62;http://www.semoru.com/2012/07/27/how-to-connect-cassandra-and-net-framework-3-5/&#60;/a&#62;&#60;/p&#62;
&#60;p&#62;hope it helps
&#60;/p&#62;</description>
		</item>
		<item>
			<title>Anonymous on "Hive Query Problems"</title>
			<link>http://www.datastax.com/support-forums/topic/hive-query-problems#post-1855</link>
			<pubDate>Mon, 07 May 2012 00:02:04 +0000</pubDate>
			<dc:creator>Anonymous</dc:creator>
			<guid isPermaLink="false">1855@http://www.datastax.com/support-forums/</guid>
			<description>&#60;p&#62;Hi..&#60;br /&#62;
can anybody suggest me if I could aggregate all the values of a column in an array using Hive UDAF.
&#60;/p&#62;</description>
		</item>
		<item>
			<title>Marius Waldal on "Writing loads of columns using CQL vs Hector"</title>
			<link>http://www.datastax.com/support-forums/topic/writing-loads-of-columns-using-cql-vs-hector#post-1161</link>
			<pubDate>Thu, 16 Feb 2012 13:15:46 +0000</pubDate>
			<dc:creator>Marius Waldal</dc:creator>
			<guid isPermaLink="false">1161@http://www.datastax.com/support-forums/</guid>
			<description>&#60;p&#62;Thank you so much for anwering, Nate. To be more specific about what I'm trying to do:&#60;/p&#62;
&#60;p&#62;The use case is a location CF with predefined columns for county, municipality etc, and an areaid. There are about 5.300 rows in this cf. &#60;/p&#62;
&#60;p&#62;In addition to using this as a cf for lookup, it is also used to verify if areaids from a log import job are valid when importing log lines. To do this, we have so far read all ids by getting all rows and returning the id column (done once, putting the IDs in a List). &#60;/p&#62;
&#60;p&#62;However, I thought it would be more efficient (and more cassandra-ish) to include 1 additional row in the location cf with all the IDS, so that when importing we would instead just read the valid IDs from columns in this row. And this is where the CQL dilemma shows up, writing 5300+ columns in that gnarly CQL statement :-)&#60;/p&#62;
&#60;p&#62;But we also thought about another option: concatenating all the IDs into a loong delimited String and then writing that string to a single column in the new lookup row, and then splitting it again when doing the import job.&#60;/p&#62;
&#60;p&#62;This approach has a hacky feel to it, but whatever is more efficient is good. It should also ensure less overhead than using thousands of columns, as the location cf is also rebuilt periodically, and this may involve areaids being removed. An update query against the row with thousands of columns will not remove the IDs that are obsolete, so we would have to first delete the row and then write it with the new columns. Having all IDs concatenated in one column means the update only needs to update this single column.&#60;br /&#62;
However, this could perhaps also result in the query being too large for a single thrift msg?&#60;/p&#62;
&#60;p&#62;That was a lot of rambling. What do you think?&#60;br /&#62;
1 column?&#60;br /&#62;
Or thousands of columns with row deletion and new insert, in batches of i.e. 500 columns?&#60;/p&#62;
&#60;p&#62;The columns will be String columns with a maximum of 5 digits each: 20012,20063 etc&#60;/p&#62;
&#60;p&#62;Marius
&#60;/p&#62;</description>
		</item>
		<item>
			<title>zznate on "Writing loads of columns using CQL vs Hector"</title>
			<link>http://www.datastax.com/support-forums/topic/writing-loads-of-columns-using-cql-vs-hector#post-1150</link>
			<pubDate>Wed, 15 Feb 2012 20:47:05 +0000</pubDate>
			<dc:creator>zznate</dc:creator>
			<guid isPermaLink="false">1150@http://www.datastax.com/support-forums/</guid>
			<description>&#60;p&#62;Yeah, that insert would end up being some gnarly CQL. &#60;/p&#62;
&#60;p&#62;Using Hector's Mutator class would be simple and most likely more efficient. If this is an insert your workload will be doing frequently, take some time to play with the batch size. The bigger this is, the more efficient, but making this too big will cause transport errors and burn memory. To avoid continuous array resizing overhead, Thrift will keep expanding buffer sizes of the underlying connection until the max is reached (16MB by default). &#60;/p&#62;
&#60;p&#62;Start with about 500 columns and go up or down as needed.
&#60;/p&#62;</description>
		</item>
		<item>
			<title>Marius Waldal on "Writing loads of columns using CQL vs Hector"</title>
			<link>http://www.datastax.com/support-forums/topic/writing-loads-of-columns-using-cql-vs-hector#post-1143</link>
			<pubDate>Wed, 15 Feb 2012 09:43:57 +0000</pubDate>
			<dc:creator>Marius Waldal</dc:creator>
			<guid isPermaLink="false">1143@http://www.datastax.com/support-forums/</guid>
			<description>&#60;p&#62;We are trying to use CQL for all Cassandra operations, but in cases that are typical cassandra-ish and not relational-ish (like having a single row with thousands of columns), this seems like bad practice. As a relational db would never have a high number of columns, inserting multiple columns listing first the column names and then column values or updating columns using name=value pairs is practical. &#60;/p&#62;
&#60;p&#62;But creating a CQL statement with thousands of name=value pairs does not ring well in my ears. Of course, one could do batch inserts instead, but this still seems like trying to force relational db-pants on nosql-legs... &#60;/p&#62;
&#60;p&#62;Is it in any way better to use e.g. Hector mutators with addInsertion for each column? Will it be more efficient? &#60;/p&#62;
&#60;p&#62;Marius
&#60;/p&#62;</description>
		</item>
		<item>
			<title>Anonymous on "Hash Cluster - Single Table"</title>
			<link>http://www.datastax.com/support-forums/topic/hash-cluster-single-table#post-1053</link>
			<pubDate>Wed, 18 Jan 2012 05:51:06 +0000</pubDate>
			<dc:creator>Anonymous</dc:creator>
			<guid isPermaLink="false">1053@http://www.datastax.com/support-forums/</guid>
			<description>&#60;p&#62;Finally I found out SSTable is indexed by B+Tree.&#60;/p&#62;
&#60;p&#62;&#60;a href=&#34;https://twitter.com/#&#34; rel=&#34;nofollow&#34;&#62;https://twitter.com/#&#60;/a&#62;!/mujiang/status/159042770147876864/photo/1/large&#60;/p&#62;
&#60;p&#62;Thanks,&#60;br /&#62;
Charlie &#124; DBA
&#60;/p&#62;</description>
		</item>
		<item>
			<title>zznate on "Are a CompositeType column queries with LESS_THAN_EQUAL component equality supported in Hector?"</title>
			<link>http://www.datastax.com/support-forums/topic/are-a-compositetype-column-queries-with-less_than_equal-component-equality-supported-in-hector#post-1028</link>
			<pubDate>Fri, 06 Jan 2012 21:47:56 +0000</pubDate>
			<dc:creator>zznate</dc:creator>
			<guid isPermaLink="false">1028@http://www.datastax.com/support-forums/</guid>
			<description>&#60;p&#62;The original motivation on our side was some experimentation with persisting object graphs:&#60;br /&#62;
&#60;a href=&#34;https://github.com/riptano/hector-jpa&#34; rel=&#34;nofollow&#34;&#62;https://github.com/riptano/hector-jpa&#60;/a&#62;&#60;/p&#62;
&#60;p&#62;As you may have figured out, though it's been there for a few months, most folks have not really put composites through their paces. Specifically, the grave misunderstanding (and admitedly poor documentation of) DynamicComposites:&#60;br /&#62;
&#60;a href=&#34;https://issues.apache.org/jira/browse/CASSANDRA-3625&#34; rel=&#34;nofollow&#34;&#62;https://issues.apache.org/jira/browse/CASSANDRA-3625&#60;/a&#62;
&#60;/p&#62;</description>
		</item>
		<item>
			<title>Anonymous on "Are a CompositeType column queries with LESS_THAN_EQUAL component equality supported in Hector?"</title>
			<link>http://www.datastax.com/support-forums/topic/are-a-compositetype-column-queries-with-less_than_equal-component-equality-supported-in-hector#post-1027</link>
			<pubDate>Fri, 06 Jan 2012 21:42:38 +0000</pubDate>
			<dc:creator>Anonymous</dc:creator>
			<guid isPermaLink="false">1027@http://www.datastax.com/support-forums/</guid>
			<description>&#60;p&#62;Yeah, it was this jira that led me to trying this out with composite types. Todd Nine's mention and example (quoted below) of a column scan made me think I might be able to scan within the first and second components. Obviously this is not yet possible as we figured out.&#60;/p&#62;
&#60;blockquote&#62;&#60;p&#62;
status &#38;gt; 100 &#38;amp;&#38;amp; status &#38;lt; 300 &#38;amp;&#38;amp; unitId = 10&#60;/p&#62;
&#60;p&#62;I would need to construct a column scan of the following to get correct result sets.&#60;/p&#62;
&#60;p&#62;start =&#38;gt; 100+1+10+0&#60;/p&#62;
&#60;p&#62;end =&#38;gt; 300+0+10+1
&#60;/p&#62;&#60;/blockquote&#62;
&#60;p&#62;So given Todd's example, &#34;status &#38;gt; 100 &#38;amp;&#38;amp; status &#38;lt; 300 &#38;amp;&#38;amp; unitId = 10&#34; works but &#34;status &#38;gt; 100 &#38;amp;&#38;amp; status &#38;lt; 300 &#38;amp;&#38;amp; unitId &#38;lt; 10&#34; doesn't.&#60;/p&#62;
&#60;p&#62;Thanks.
&#60;/p&#62;</description>
		</item>
		<item>
			<title>zznate on "Are a CompositeType column queries with LESS_THAN_EQUAL component equality supported in Hector?"</title>
			<link>http://www.datastax.com/support-forums/topic/are-a-compositetype-column-queries-with-less_than_equal-component-equality-supported-in-hector#post-1026</link>
			<pubDate>Fri, 06 Jan 2012 20:40:34 +0000</pubDate>
			<dc:creator>zznate</dc:creator>
			<guid isPermaLink="false">1026@http://www.datastax.com/support-forums/</guid>
			<description>&#60;p&#62;Just remembered a long ago thread regarding how composites do comparisons independently on different components (see &#60;a href=&#34;https://issues.apache.org/jira/browse/CASSANDRA-2231&#34; rel=&#34;nofollow&#34;&#62;https://issues.apache.org/jira/browse/CASSANDRA-2231&#60;/a&#62; if you are interested). You will get the expected results, all columns where the first component is &#34;zero&#34; with the following:&#60;/p&#62;
&#60;p&#62;    Composite startRange = new Composite();&#60;br /&#62;
    startRange.addComponent(0,new Long(0), AbstractComposite.ComponentEquality.EQUAL);&#60;/p&#62;
&#60;p&#62;    Composite endRange = new Composite();&#60;br /&#62;
    endRange.addComponent(0, new Long(0), AbstractComposite.ComponentEquality.GREATER_THAN_EQUAL);&#60;/p&#62;
&#60;p&#62;    sliceQuery.setRange(startRange, endRange, false, 100);
&#60;/p&#62;</description>
		</item>
		<item>
			<title>Anonymous on "Are a CompositeType column queries with LESS_THAN_EQUAL component equality supported in Hector?"</title>
			<link>http://www.datastax.com/support-forums/topic/are-a-compositetype-column-queries-with-less_than_equal-component-equality-supported-in-hector#post-1025</link>
			<pubDate>Fri, 06 Jan 2012 20:19:42 +0000</pubDate>
			<dc:creator>Anonymous</dc:creator>
			<guid isPermaLink="false">1025@http://www.datastax.com/support-forums/</guid>
			<description>&#60;p&#62;Separately, I'm experimenting with using super columns which seems like a better way to go for my particular use case. Because composite column queries restrict component equality to one component (the first component), I cannot limit the query results like I can in the super column solution. So it seems for my use case, CompositeTypes are not an efficient substitute for SuperColumns. Here's why I think that is...&#60;/p&#62;
&#60;p&#62;Given data (T1:T2)=&#38;gt; (2:1),(2:0),(1:0),(0:1),(0:0) - DESCENDING ordered&#60;br /&#62;
Arguments t1=2 and t2=0 where T1&#38;lt;=t1 and T2&#38;lt;=t2&#60;/p&#62;
&#60;p&#62;Composite&#60;br /&#62;
----------&#60;br /&#62;
slice_query(t1); /* returns (2:1),(2:0),(1:0),(0:1),(0:0) to client */&#60;br /&#62;
client_filter(results_of_slice_query, t2); &#60;/p&#62;
&#60;p&#62;Super - Allows limit to be applied&#60;br /&#62;
-----------------------------------&#60;br /&#62;
super_slice_query(t1 limit 1); /* returns {(2:1),(2:0)} */&#60;br /&#62;
client_filter(results_of_slice_query, t2); &#60;/p&#62;
&#60;p&#62;The Super column solution is not as efficient if the client_filter fails to find a T2 given t2 because it would require an iterative query. Maybe not so bad given we will have 1000s of different values for T1 and with a composite column solution, it would be inefficient to send all those to the client.&#60;/p&#62;
&#60;p&#62;There may be other solutions...
&#60;/p&#62;</description>
		</item>
		<item>
			<title>Anonymous on "Are a CompositeType column queries with LESS_THAN_EQUAL component equality supported in Hector?"</title>
			<link>http://www.datastax.com/support-forums/topic/are-a-compositetype-column-queries-with-less_than_equal-component-equality-supported-in-hector#post-1022</link>
			<pubDate>Fri, 06 Jan 2012 19:49:41 +0000</pubDate>
			<dc:creator>Anonymous</dc:creator>
			<guid isPermaLink="false">1022@http://www.datastax.com/support-forums/</guid>
			<description>&#60;p&#62;@zznate same problem with 1.0.6.
&#60;/p&#62;</description>
		</item>
		<item>
			<title>zznate on "Are a CompositeType column queries with LESS_THAN_EQUAL component equality supported in Hector?"</title>
			<link>http://www.datastax.com/support-forums/topic/are-a-compositetype-column-queries-with-less_than_equal-component-equality-supported-in-hector#post-1018</link>
			<pubDate>Fri, 06 Jan 2012 18:29:00 +0000</pubDate>
			<dc:creator>zznate</dc:creator>
			<guid isPermaLink="false">1018@http://www.datastax.com/support-forums/</guid>
			<description>&#60;p&#62;@heskech can you try again with 1.0.6? There was a (vaguely related) issue that was addressed (but this is a stretch). &#60;/p&#62;
&#60;p&#62;You are correct that it should have filtered on equality for the first component - I'll take your code and try to duplicate what you are seeing. Thanks for your patience (and the completeness of your examples!).
&#60;/p&#62;</description>
		</item>

	</channel>
</rss>
