<?xml version="1.0" encoding="UTF-8"?><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"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Sybase IQ technical highlights</title>
	<atom:link href="http://www.dbms2.com/2009/08/25/sybase-iq-technical-highlights/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.dbms2.com/2009/08/25/sybase-iq-technical-highlights/</link>
	<description>Choices in data management and analysis</description>
	<lastBuildDate>Thu, 09 Feb 2012 09:22:14 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.3</generator>
	<item>
		<title>By: Mike Stonebraker on &#8220;real column stores&#8221; &#124; DBMS 2 : DataBase Management System Services</title>
		<link>http://www.dbms2.com/2009/08/25/sybase-iq-technical-highlights/#comment-203164</link>
		<dc:creator>Mike Stonebraker on &#8220;real column stores&#8221; &#124; DBMS 2 : DataBase Management System Services</dc:creator>
		<pubDate>Wed, 12 Jan 2011 13:46:45 +0000</pubDate>
		<guid isPermaLink="false">http://www.dbms2.com/?p=871#comment-203164</guid>
		<description>[...] A lesser oopsie is Mike&#8217;s criterion &#8220;IO-1&#8243;, which is written so confusingly that it technically seems not to be met by any of the vendors cited &#8212; including Vertica, which introduced Vertica FlexStore in mid-2009.  And while I&#8217;m at it &#8212; Aster Data nCluster definitely meets criterion IO-3; I confirmed that by asking Tasso Agyros. Mike&#8217;s &#8220;No&#8221; for Sybase IQ on his criterion CPU-5 is also pretty questionable, given that Sybase IQ operates on compressed data until &#8220;the last possible moment.&#8221; [...]</description>
		<content:encoded><![CDATA[<p>[...] A lesser oopsie is Mike&#8217;s criterion &#8220;IO-1&#8243;, which is written so confusingly that it technically seems not to be met by any of the vendors cited &#8212; including Vertica, which introduced Vertica FlexStore in mid-2009.  And while I&#8217;m at it &#8212; Aster Data nCluster definitely meets criterion IO-3; I confirmed that by asking Tasso Agyros. Mike&#8217;s &#8220;No&#8221; for Sybase IQ on his criterion CPU-5 is also pretty questionable, given that Sybase IQ operates on compressed data until &#8220;the last possible moment.&#8221; [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Enterprise headlines and summaries, 2009-08-25 &#171; Next Gen Enterprise</title>
		<link>http://www.dbms2.com/2009/08/25/sybase-iq-technical-highlights/#comment-136794</link>
		<dc:creator>Enterprise headlines and summaries, 2009-08-25 &#171; Next Gen Enterprise</dc:creator>
		<pubDate>Fri, 28 Aug 2009 05:44:43 +0000</pubDate>
		<guid isPermaLink="false">http://www.dbms2.com/?p=871#comment-136794</guid>
		<description>[...] Sybase IQ technical highlights General highlights of the Sybase IQ technical story include: * Sybase IQ is an analytic DBMS with a columnar/column-store architecture * Unlike most analytic DBMS, Sybase IQ has a shared-disk architecture. * The Sybase IQ indexing story is a bit complicated, with a bunch of different index kinds. Most are focused on columns with low cardinality, and it least in some cases are a lot like bitmaps. (Sybase IQ when first introduced was a pure bitmap index product, with a single index type “Fast Project”.) But one index kind, “High Group” — designed for columns with high cardinality – is an exception to most generalities about other Sybase IQ index kinds, and instead is more akin to a b-tree. [...]</description>
		<content:encoded><![CDATA[<p>[...] Sybase IQ technical highlights General highlights of the Sybase IQ technical story include: * Sybase IQ is an analytic DBMS with a columnar/column-store architecture * Unlike most analytic DBMS, Sybase IQ has a shared-disk architecture. * The Sybase IQ indexing story is a bit complicated, with a bunch of different index kinds. Most are focused on columns with low cardinality, and it least in some cases are a lot like bitmaps. (Sybase IQ when first introduced was a pure bitmap index product, with a single index type “Fast Project”.) But one index kind, “High Group” — designed for columns with high cardinality – is an exception to most generalities about other Sybase IQ index kinds, and instead is more akin to a b-tree. [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Justin Swanhart</title>
		<link>http://www.dbms2.com/2009/08/25/sybase-iq-technical-highlights/#comment-136755</link>
		<dc:creator>Justin Swanhart</dc:creator>
		<pubDate>Thu, 27 Aug 2009 21:42:52 +0000</pubDate>
		<guid isPermaLink="false">http://www.dbms2.com/?p=871#comment-136755</guid>
		<description>Fastbit doesn&#039;t use dictionaries.  It uses Word-Aligned-Hybrid compression (for which they have established an &quot;open&quot; patent) and is available LGPL.

I used it briefly as part of a POC at AdBrite and was VERY impressed.  I&#039;ve though about integrating it as a storage engine for MySQL, but MySQL is row engine oriented which sucks for a column store like FastBit.  

Eigenbase is pretty cool, and would make a nice frontend to add support for joins and other such SQL constructs which Fastbit currently doesn&#039;t support.</description>
		<content:encoded><![CDATA[<p>Fastbit doesn&#8217;t use dictionaries.  It uses Word-Aligned-Hybrid compression (for which they have established an &#8220;open&#8221; patent) and is available LGPL.</p>
<p>I used it briefly as part of a POC at AdBrite and was VERY impressed.  I&#8217;ve though about integrating it as a storage engine for MySQL, but MySQL is row engine oriented which sucks for a column store like FastBit.  </p>
<p>Eigenbase is pretty cool, and would make a nice frontend to add support for joins and other such SQL constructs which Fastbit currently doesn&#8217;t support.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Curt Monash</title>
		<link>http://www.dbms2.com/2009/08/25/sybase-iq-technical-highlights/#comment-136726</link>
		<dc:creator>Curt Monash</dc:creator>
		<pubDate>Thu, 27 Aug 2009 17:06:36 +0000</pubDate>
		<guid isPermaLink="false">http://www.dbms2.com/?p=871#comment-136726</guid>
		<description>I haven&#039;t drilled down to the level of detail I&#039;d like on the various Sybase index kinds, so I&#039;ll duck questions like Mark&#039;s.

CAM</description>
		<content:encoded><![CDATA[<p>I haven&#8217;t drilled down to the level of detail I&#8217;d like on the various Sybase index kinds, so I&#8217;ll duck questions like Mark&#8217;s.</p>
<p>CAM</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Julian Hyde</title>
		<link>http://www.dbms2.com/2009/08/25/sybase-iq-technical-highlights/#comment-136724</link>
		<dc:creator>Julian Hyde</dc:creator>
		<pubDate>Thu, 27 Aug 2009 16:58:16 +0000</pubDate>
		<guid isPermaLink="false">http://www.dbms2.com/?p=871#comment-136724</guid>
		<description>Jon, Justin,

Those capabilities are quite straightforward if the database uses dictionary compression and compresses to a fixed number of bits per value. LucidDB does the same in its compressed column stores.

http://www.luciddb.org</description>
		<content:encoded><![CDATA[<p>Jon, Justin,</p>
<p>Those capabilities are quite straightforward if the database uses dictionary compression and compresses to a fixed number of bits per value. LucidDB does the same in its compressed column stores.</p>
<p><a href="http://www.luciddb.org" rel="nofollow">http://www.luciddb.org</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Justin Swanhart</title>
		<link>http://www.dbms2.com/2009/08/25/sybase-iq-technical-highlights/#comment-136597</link>
		<dc:creator>Justin Swanhart</dc:creator>
		<pubDate>Wed, 26 Aug 2009 16:40:37 +0000</pubDate>
		<guid isPermaLink="false">http://www.dbms2.com/?p=871#comment-136597</guid>
		<description>Jon,

That is possible.  An example of such a bitmap index is implemented as Fastbit, an LGPL project.

It implements a type of bitmap compression which supports logical operations between bitmaps w/out decompressing.

You can find it here:
https://sdm.lbl.gov/fastbit/</description>
		<content:encoded><![CDATA[<p>Jon,</p>
<p>That is possible.  An example of such a bitmap index is implemented as Fastbit, an LGPL project.</p>
<p>It implements a type of bitmap compression which supports logical operations between bitmaps w/out decompressing.</p>
<p>You can find it here:<br />
<a href="https://sdm.lbl.gov/fastbit/" rel="nofollow">https://sdm.lbl.gov/fastbit/</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jon Smirl</title>
		<link>http://www.dbms2.com/2009/08/25/sybase-iq-technical-highlights/#comment-136527</link>
		<dc:creator>Jon Smirl</dc:creator>
		<pubDate>Wed, 26 Aug 2009 03:25:43 +0000</pubDate>
		<guid isPermaLink="false">http://www.dbms2.com/?p=871#comment-136527</guid>
		<description>A couple of years ago there was a TechWave conference where they talked about their ability to do comparison operations on compressed data without decompressing it. I thought that was a cool idea.</description>
		<content:encoded><![CDATA[<p>A couple of years ago there was a TechWave conference where they talked about their ability to do comparison operations on compressed data without decompressing it. I thought that was a cool idea.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Justin Swanhart</title>
		<link>http://www.dbms2.com/2009/08/25/sybase-iq-technical-highlights/#comment-136497</link>
		<dc:creator>Justin Swanhart</dc:creator>
		<pubDate>Tue, 25 Aug 2009 21:59:38 +0000</pubDate>
		<guid isPermaLink="false">http://www.dbms2.com/?p=871#comment-136497</guid>
		<description>I&#039;m under the impression that Sybase IQ supports compressed &#039;binned&#039; bitmap indexes.  These would require a lot of work to update, though I don&#039;t think they would have to recalculate the entire bitmap.</description>
		<content:encoded><![CDATA[<p>I&#8217;m under the impression that Sybase IQ supports compressed &#8216;binned&#8217; bitmap indexes.  These would require a lot of work to update, though I don&#8217;t think they would have to recalculate the entire bitmap.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mark Callaghan</title>
		<link>http://www.dbms2.com/2009/08/25/sybase-iq-technical-highlights/#comment-136472</link>
		<dc:creator>Mark Callaghan</dc:creator>
		<pubDate>Tue, 25 Aug 2009 16:49:18 +0000</pubDate>
		<guid isPermaLink="false">http://www.dbms2.com/?p=871#comment-136472</guid>
		<description>Bitmap indexes in Oracle support high-cardinality columns and their effectiveness in that case is determined by the number of rows per distinct index value, not by the index cardinality. The cost to update them is not as high as you mention for &#039;High Group&#039; indexes in Sybase IQ. Is Sybase IQ storing one bitmap per index value and replacing the entire bitmap on update?</description>
		<content:encoded><![CDATA[<p>Bitmap indexes in Oracle support high-cardinality columns and their effectiveness in that case is determined by the number of rows per distinct index value, not by the index cardinality. The cost to update them is not as high as you mention for &#8216;High Group&#8217; indexes in Sybase IQ. Is Sybase IQ storing one bitmap per index value and replacing the entire bitmap on update?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Daniel Lemire</title>
		<link>http://www.dbms2.com/2009/08/25/sybase-iq-technical-highlights/#comment-136452</link>
		<dc:creator>Daniel Lemire</dc:creator>
		<pubDate>Tue, 25 Aug 2009 12:39:35 +0000</pubDate>
		<guid isPermaLink="false">http://www.dbms2.com/?p=871#comment-136452</guid>
		<description>Thoughts: I&#039;m guessing that by &quot;projection&quot; they mean bit packing. In any case, it would be really useful if people in this industry agreed to some common definitions, or, minimally, to share their definitions. Reinventing the whole database language for each and every company is painful.</description>
		<content:encoded><![CDATA[<p>Thoughts: I&#8217;m guessing that by &#8220;projection&#8221; they mean bit packing. In any case, it would be really useful if people in this industry agreed to some common definitions, or, minimally, to share their definitions. Reinventing the whole database language for each and every company is painful.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

