<?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: Random Musing: Bluring the Line Between Storage and Database?</title>
	<atom:link href="http://blog.apokalyptik.com/2006/10/10/random-musing-bluring-the-line-between-storage-and-database/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.apokalyptik.com/2006/10/10/random-musing-bluring-the-line-between-storage-and-database/</link>
	<description>The random things that spew forth from my brain...</description>
	<lastBuildDate>Fri, 25 Jan 2013 23:59:19 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.6-beta2-24222</generator>
	<item>
		<title>By: CodeWord: Apokalyptik &#187; Blog Archive &#187; So I&#8217;m trying to solve a rather difficult problem&#8230;</title>
		<link>http://blog.apokalyptik.com/2006/10/10/random-musing-bluring-the-line-between-storage-and-database/comment-page-1/#comment-3256</link>
		<dc:creator>CodeWord: Apokalyptik &#187; Blog Archive &#187; So I&#8217;m trying to solve a rather difficult problem&#8230;</dc:creator>
		<pubDate>Mon, 18 Dec 2006 19:20:48 +0000</pubDate>
		<guid isPermaLink="false">http://blog.apokalyptik.com/?p=141#comment-3256</guid>
		<description><![CDATA[[...] I have X number of data objects with up to about min 45,000, max 50,000 possible values associated with each object. I know&#8230; Don&#8217;t ask (couldn&#8217;t tell you anyways). Now to be able to do this in MySQL is&#8230; well&#8230; possible&#8230; but absurd. I&#8217;m thinking of trying out the approach I&#8217;ve mused about here. It could possibly be a really great way to manage finding commonalities across tens of thousands of objects with a total of hundreds of millions of values. Or it could be a massive time sink. [...]]]></description>
		<content:encoded><![CDATA[<p>[...] I have X number of data objects with up to about min 45,000, max 50,000 possible values associated with each object. I know&#8230; Don&#8217;t ask (couldn&#8217;t tell you anyways). Now to be able to do this in MySQL is&#8230; well&#8230; possible&#8230; but absurd. I&#8217;m thinking of trying out the approach I&#8217;ve mused about here. It could possibly be a really great way to manage finding commonalities across tens of thousands of objects with a total of hundreds of millions of values. Or it could be a massive time sink. [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: apokalyptik</title>
		<link>http://blog.apokalyptik.com/2006/10/10/random-musing-bluring-the-line-between-storage-and-database/comment-page-1/#comment-1809</link>
		<dc:creator>apokalyptik</dc:creator>
		<pubDate>Tue, 10 Oct 2006 21:11:00 +0000</pubDate>
		<guid isPermaLink="false">http://blog.apokalyptik.com/?p=141#comment-1809</guid>
		<description><![CDATA[And thanks for the link.  I had a vague recollection of google having this kind of service, but then lost track of it.  Cheers ]]></description>
		<content:encoded><![CDATA[<p>And thanks for the link.  I had a vague recollection of google having this kind of service, but then lost track of it.  Cheers </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: apokalyptik</title>
		<link>http://blog.apokalyptik.com/2006/10/10/random-musing-bluring-the-line-between-storage-and-database/comment-page-1/#comment-1808</link>
		<dc:creator>apokalyptik</dc:creator>
		<pubDate>Tue, 10 Oct 2006 21:10:28 +0000</pubDate>
		<guid isPermaLink="false">http://blog.apokalyptik.com/?p=141#comment-1808</guid>
		<description><![CDATA[true, BUT, you&#039;ll be stuck with the gbase 250,000 item limit (assuming the max-results value times the start-index value equal the total possible number of results which tis possible to fetch on a certain criteria). This method would, theoretically, have no limit on the number of items on which you could pull in a single query. ]]></description>
		<content:encoded><![CDATA[<p>true, BUT, you&#039;ll be stuck with the gbase 250,000 item limit (assuming the max-results value times the start-index value equal the total possible number of results which tis possible to fetch on a certain criteria). This method would, theoretically, have no limit on the number of items on which you could pull in a single query. </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nick Lothian</title>
		<link>http://blog.apokalyptik.com/2006/10/10/random-musing-bluring-the-line-between-storage-and-database/comment-page-1/#comment-1806</link>
		<dc:creator>Nick Lothian</dc:creator>
		<pubDate>Tue, 10 Oct 2006 20:04:41 +0000</pubDate>
		<guid isPermaLink="false">http://blog.apokalyptik.com/?p=141#comment-1806</guid>
		<description><![CDATA[Or you could just stick your data in Google Base, and get a &lt;a href=&quot;http://code.google.com/apis/base/attrs-queries.html&quot; rel=&quot;nofollow&quot;&gt;rich query language&lt;/a&gt;, plus reliable datastore for free. 
 
Obviously it&#039;s not going to be suitable for all data, but for some very specific use cases I&#039;m convinced it would work. 
 
(Nice blog, BTW) ]]></description>
		<content:encoded><![CDATA[<p>Or you could just stick your data in Google Base, and get a <a href="http://code.google.com/apis/base/attrs-queries.html" rel="nofollow">rich query language</a>, plus reliable datastore for free.</p>
<p>Obviously it&#039;s not going to be suitable for all data, but for some very specific use cases I&#039;m convinced it would work.</p>
<p>(Nice blog, BTW) </p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Performance optimized by W3 Total Cache. Learn more: http://www.w3-edge.com/wordpress-plugins/

Page Caching using memcached
Database Caching using memcached
Object Caching 548/554 objects using memcached

 Served from: blog.apokalyptik.com @ 2013-05-19 11:22:14 by W3 Total Cache -->