<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" 
      xmlns:thr="http://purl.org/syndication/thread/1.0">
  <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html" />
  <link rel="self" type="application/atom+xml" href="http://dashes.com/anil/atom.xml" />
  <id>tag:dashes.com,2010:/anil//1/tag:www.dashes.com,2003:/anil//1.1633-</id>
  <updated>2010-01-04T02:36:18Z</updated>
  <title>Comments for Google&apos;s advantage is RAM</title>
  <subtitle>A Blog About Making Culture</subtitle>
  <generator uri="http://www.sixapart.com/movabletype/">Movable Type 4.31-en</generator>
  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633</id>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html" />
    <link rel="service.edit" type="application/atom+xml" href="http://dashes.com/mt/mt-atom.cgi/weblog/blog_id=1/entry_id=1633" title="Google's advantage is RAM" />
    <published>2003-04-14T21:48:14Z</published>
    <updated>2005-08-12T06:49:44Z</updated>
    <title>Google&apos;s advantage is RAM</title>
    <summary>Update: Read the comments. Dan and Joshua, who know way more about this stuff than I do, explain why I&apos;m wrong and help me clarify...</summary>
    <author>
      <name>Anil</name>
      <uri>http://anildash.com/</uri>
    </author>
    
    <category term="tech" />
    
    <category term="tech" />
    
    <content type="html" xml:lang="en" xml:base="http://dashes.com/anil/">
      <![CDATA[<p><strong>Update:</strong> Read the comments. Dan and Joshua, who know way more about this stuff than I do, explain why I'm wrong and help me clarify what I'm really asking for. Smart guys, and great ideas.</p>
<p>One of the recurrent complaints about desktop search as compared to the standard set by Google is that finding one's own files is so much slower. If Google can index a couple billion pages and return the results in .03 seconds, why does a search of my hard drive take 30 seconds? We know that we'll put up with the search being 3 orders of magnitude slower because our own information is 3 orders of magnitude more important than the random fluff on the web, but how can we make it work <em>better</em>?</p>
<p>Well, Google's secret is no secret at all: It's RAM. Random Access Memory. Just like you've got in the machine you're using right now. Keep in mind, all the thousands of boxes in Google's racks do all their querying in RAM. Even with network latency and the time it takes to send a request to their data center and with the index encompassing terabytes of data, RAM is just that much faster. The downside, of course, is that keeping data in RAM requires redundancy, since it loses its contents as soon as the power is cut. Indeed, Google's people have said that one of their primary logistical concerns is the massive amounts of power needed for supporting and cooling all those RAM-hungry boxes. But if the couple hundred megabytes of information that you value were all available in RAM, your search times would be even faster than Google's.</p>
<p>So, how can this be done? Well, it's not hard. PCs have had a driver for RAM drives available since the days of DOS 3.0. But improvements in Windows' memory paging system made RAM drives obsolete. Still, Microsoft offers a <a href="http://support.microsoft.com/default.aspx?scid=http://support.microsoft.com:80/support/kb/articles/Q257/4/05.ASP&amp;NoWebContent=1">sample RAM disk driver</a> for Windows 2000, and even includes a version of the driver in XP, though you have to manually install it to activate it. Or you can download a <a href="http://www.arsoft-online.de/products/product.php?id=1">free third-party version</a> of the same driver, complete with installer.</p>
<p>(Side note to XP users, if you try to activate the driver: If you don't have any disks with the FAT file system, the driver won't work, as it uses FAT for the newly-created drive. You'll need to <a href="http://pub29.ezboard.com/fcyberwizardfrm20.showMessage?topicID=16.topic" title="scroll down to the third message">enable the fastfat driver</a> to make use of it.)</p>
<p>I tried a few experiments, moving my browser cache to the RAM drive, or moving my temporary files there, or even moving my entire email archive to RAM, and it turns out to make a massive difference in performance. Nearly everything is instant. Running a copy of Photoshop installed to the virtual drive is astonishing the first few times you start the app. But it's not a solution that really works for any length of time, as various parts of Windows balk at being run from a drive that's not &quot;real&quot;. And you don't want to have to reinstall your apps every time you reboot, even if XP only rarely needs to be rebooted.</p>
<p>So what good does this insight into Google and RAM drives do us? Well, it seems like there's an opportunity. Someone with just a little bit of time and ingenuity, who's interested in making tiny apps like <a href="http://www.torrez.org">Andre</a> does with <a href="http://www.torrez.net">torrez.net</a> could easily make an installer for a RAM drive that caches important, frequently-accessed data in RAM in a way that preserves its state by writing it to disk upon shutdown. Perhaps with a backup system that mirrors the RAM disk to the hard drive when the system is idle. The fact that RAM is so volatile could probably be compensated for, or even sold as a benefit. (&quot;Your browser history is <em>permanently erased</em> every time your computer shuts down, for the ultimate in security!&quot;) And a My Documents folder mirrored to this storage area would be searchable with Googlesque speed.</p>
<p>I'd be willing to beta test it. I work on a laptop, so even if the power cuts out, my battery acts like an uninterruptible power supply, preserving my system's power source. And I'd pay, I dunno, $30 or something for the simple software, along with another couple hundred bucks for enough RAM to copy everything useful to memory. I bet there's a market.</p>]]>
      
    </content>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1802</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1802" />
    <title>Comment from Geof on 2003-04-14</title>
    <author>
        <name>Geof</name>
        <uri>http://ijsm.org/</uri>
    </author>
    <content type="html" xml:lang="en" xml:base="http://ijsm.org/">
        <![CDATA[<p>Heck yeah there is.  I mean, I'd pay for it, too.</p>

<p>Of course, what happens to general Windows performance when N% of the RAM is taken up by the RAM drive?  Does it start to get more sluggish?</p>

<p>RAM manufacturers should get behind this ... it would be a way to soak up supply.</p>]]>
    </content>
    <published>2003-04-14T22:37:12Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1803</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1803" />
    <title>Comment from Brendon Bushman on 2003-04-14</title>
    <author>
        <name>Brendon Bushman</name>
        <uri>http://www.brendonbushman.com</uri>
    </author>
    <content type="html" xml:lang="en" xml:base="http://www.brendonbushman.com">
        <![CDATA[<p>Mac's had this too.  :)   I used to use it for internet apps, and occasionally, short snipps of looped, erm, "hard disk recording" on my "Powermac" 4400...</p>

<p><a href="http://developer.apple.com/techpubs/mac/Memory/Memory-179.html" rel="nofollow">&raquo; Memory Control Panel Developer Notes</a></p>]]>
    </content>
    <published>2003-04-14T23:07:47Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1804</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1804" />
    <title>Comment from mathowie on 2003-04-14</title>
    <author>
        <name>mathowie</name>
        <uri>http://a.wholelottanothing.org</uri>
    </author>
    <content type="html" xml:lang="en" xml:base="http://a.wholelottanothing.org">
        <![CDATA[<p><i>Of course, what happens to general Windows performance when N% of the RAM is taken up by the RAM drive?</i></p>

<p>With RAM as cheap as it is these days, I'd add another 512Mb stick into my PC just for this app.</p>

<p>(that'd be a great way to upsell the shareware RAM drive - just throw a DIMM in with say, a $50 price, or get someone like <a href="http://www.crucial.com/" rel="nofollow">Crucial</a> to bundle your app with their upgrades)</p>]]>
    </content>
    <published>2003-04-15T00:11:41Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1805</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1805" />
    <title>Comment from Matt on 2003-04-14</title>
    <author>
        <name>Matt</name>
        <uri>http://photomatt.net</uri>
    </author>
    <content type="html" xml:lang="en" xml:base="http://photomatt.net">
        <![CDATA[<p>Great idea. I'd buy it. A quick glance at Pricewatch shows copious amounts of RAM for crazy-low prices, so why not?</p>]]>
    </content>
    <published>2003-04-15T00:12:16Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1806</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1806" />
    <title>Comment from pb on 2003-04-14</title>
    <author>
        <name>pb</name>
        <uri></uri>
    </author>
    <content type="html" xml:lang="en" xml:base="">
        <![CDATA[<p>I wonder if a simple database will do, at least when searching for files by name. The Mac *used* to have one and files searches were very fast.</p>]]>
    </content>
    <published>2003-04-15T00:53:56Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1807</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1807" />
    <title>Comment from Adam Kalsey on 2003-04-15</title>
    <author>
        <name>Adam Kalsey</name>
        <uri>http://kalsey.com</uri>
    </author>
    <content type="html" xml:lang="en" xml:base="http://kalsey.com">
        <![CDATA[<p>There are some enterprise-level software packages that do this sort of thing for file servers. And Propel Software was doing some interesting things with in-memory databases that dumped to disk periodically. But I've never seen anything that does this for the average computer user.</p>

<p>You could fake it, though. Create a RAM drive with whatever RAM Disk driver you prefer. Then use something like <a href="http://www.warpgear.com/" rel="nofollow">Mr. Mirror</a> to ensure that the contents of that drive are constantly mirrored to a space on your physical disk.</p>

<p>At that point, all you need is a simple copy operation during Windows startup to copy everything from your mirror to the RAM drive.</p>]]>
    </content>
    <published>2003-04-15T05:08:52Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1808</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1808" />
    <title>Comment from David on 2003-04-15</title>
    <author>
        <name>David</name>
        <uri></uri>
    </author>
    <content type="html" xml:lang="en" xml:base="">
        <![CDATA[<p>I used this on Win2000 for a little while.  Haven't tried it on XP, though.</p>

<p>http://www.padring.com/soft/Utilities/DiskTools/RAMDiskNT.html</p>]]>
    </content>
    <published>2003-04-15T05:57:56Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1809</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1809" />
    <title>Comment from Geof on 2003-04-15</title>
    <author>
        <name>Geof</name>
        <uri>http://ijsm.org/</uri>
    </author>
    <content type="html" xml:lang="en" xml:base="http://ijsm.org/">
        <![CDATA[<p>Matt has a point, but I'm loathe to pop open the ol' laptop and mess with it.  I'll break open my tower any ol' time, but Anil makes a good point--without some kind of UPS, this works best with a laptop, where the batter serves to save you in the case of power outages.  [And since I live in the woods, I have to worry about such things.]</p>]]>
    </content>
    <published>2003-04-15T12:58:56Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1810</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1810" />
    <title>Comment from David on 2003-04-15</title>
    <author>
        <name>David</name>
        <uri>http://www.netwert.com</uri>
    </author>
    <content type="html" xml:lang="en" xml:base="http://www.netwert.com">
        <![CDATA[<p>The Mac RAM disk was a good thing.  Here's a tip:  Set your Photoshop cache into RAM, which improves processing without changing stability.</p>

<p>Another smart move is setting your IE cache to 0 rather than just sticking it in RAM.  The instant displaying that results is grand.  The drawback, though, is that pages have to refresh when the back button is clicked.</p>]]>
    </content>
    <published>2003-04-15T13:55:51Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1811</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1811" />
    <title>Comment from Daniel Egnor on 2003-04-15</title>
    <author>
        <name>Daniel Egnor</name>
        <uri>http://ofb.net/~egnor</uri>
    </author>
    <content type="html" xml:lang="en" xml:base="http://ofb.net/~egnor">
        <![CDATA[<p>Aieee!  This is so wrong.</p>

<p>The buffer cache built into any operating system newer than MS-DOS 3.3 is *exactly* "a RAM drive that caches important, frequently-accessed data".  If you want a demonstration, just load Photoshop twice; you'll see how the second time it's much faster -- that's because the files have been cached in RAM by the operating system!  If using a RAM disk is still faster, then the OS is broken and its VM system needs fixing.</p>

<p>In any case, the reason Google is faster is because it's *indexed*.  You can get desktop search applications that work much more quickly than Google does; the cost is that they'll need to "crawl" your data periodically (just like Google!) and spend a bunch of disk space on an index (just like Google!).  That's disk space, not RAM.  Once your data has been indexed, the queries will execute lickety-split.</p>

<p>Any query engine that takes 30 seconds to return is either monstrously broken, or (much more likely) doesn't have an index; it's scanning all your data sequentially.  The e-mail search in Outlook, for example, is not indexed.  Other e-mail systems are better about indexing.  There are add-ons that do nothing but index your mail; see Zoe Interwingle, for example, which I promise will take less than 30 seconds to process a query.  Back in the day, AltaVista used to sell a very fast desktop search add-on.</p>

<p>Maybe more desktop application data should be indexed, maybe there should be some kind of universal search interface that runs over it all -- that's a holy grail we've been chasing for many years now.</p>

<p>But please, please, stop telling people to use a RAM disk, that's just wrong.  Operating systems are designed to move data between RAM and disk ("virtual memory" and "buffer cache") adaptively; overriding that is rarely a good idea and always a lot of hassle.</p>

<p>It *is* possible to optimize applications to run out of RAM (that's what the enterprise companies who accelerate databases and such do), but this really isn't the direction to be going in.  Much better to optimize the basic OS caching algorithms (if necessary) and *build indexes*.</p>

<p>Whew.</p>]]>
    </content>
    <published>2003-04-15T14:37:07Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1812</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1812" />
    <title>Comment from Daniel Egnor on 2003-04-15</title>
    <author>
        <name>Daniel Egnor</name>
        <uri>http://ofb.net/~egnor/</uri>
    </author>
    <content type="html" xml:lang="en" xml:base="http://ofb.net/~egnor/">
        <![CDATA[<p>One more note, sorry.</p>

<p>If you make a big RAM disk and dedicate it to your browser cache or Photoshop or whatever, you will find that your browser or Photoshop or whatever may be faster.</p>

<p>However, you've just subtracted a bunch of RAM from the rest of your system, which means that *everything else* will be that much more sluggish.  On the whole it may be a lose, but you won't know that by benchmarking Photoshop start-up times.</p>

<p>It may sometimes be useful to second-guess the operating system's cache, but you have to be very careful about what you measure.</p>]]>
    </content>
    <published>2003-04-15T14:45:42Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1813</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1813" />
    <title>Comment from Maciej Ceglowski on 2003-04-15</title>
    <author>
        <name>Maciej Ceglowski</name>
        <uri>http://www.idlewords.com</uri>
    </author>
    <content type="html" xml:lang="en" xml:base="http://www.idlewords.com">
        <![CDATA[<p>I agree with Daniel that a 30 second local search time has to be due to the lack of an index.   In that case a RAM disk will still help, but not as much as indexing would have helped in the first place.</p>

<p>That said, maxing out your RAM is a good thing.   It might even help you get much better battery life, if your laptop never has to spin up the drive.</p>

<p> Rumor has it the next version of Windows will include a relational database filesystem that should make local search much more pleasant.  And DRM features to guarantee that whatever you find isn't usable ;-)</p>]]>
    </content>
    <published>2003-04-15T16:39:55Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1814</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1814" />
    <title>Comment from Anil on 2003-04-15</title>
    <author>
        <name>Anil</name>
        <uri>http://anildash.com/</uri>
    </author>
    <content type="html" xml:lang="en" xml:base="http://anildash.com/">
        <![CDATA[<p>Daniel, I've gotten a few emails that agree with what you're saying. Please note that I'm not advocating disabling or negating the excellent virtual memory system built into Windows.</p>

<p>And you're absolutely right, indexing is critical. But applications like Outlook <em>do</em> index messages or files, and Office has long offered an indexing service, as has Windows itself. Yet none of these systems are as fast as a brute-force full-text search on data that's stored in RAM.</p>

<p>I don't doubt that the right way for these systems to evolve is to have smarter engines that index during idle time and cache more info more intelligently in RAM. But if a non-indexed, unintelligent search mechanism is orders of magnitude faster in RAM than a VM-aware, indexed &quot;smart&quot; search engine, why wouldn't we pursue the avenue that's producing better results right now?</p>]]>
    </content>
    <published>2003-04-15T19:00:16Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1815</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1815" />
    <title>Comment from joshua on 2003-04-15</title>
    <author>
        <name>joshua</name>
        <uri>http://burri.to/~joshua/</uri>
    </author>
    <content type="html" xml:lang="en" xml:base="http://burri.to/~joshua/">
        <![CDATA[<p>You're missing the point - an index provides logarithmic or<br />
better speedup, whereas brute searching in RAM only provides<br />
a linear speedup over disk searching.</p>

<p>A well-constructed btree runs searches that run in O(log(n)) where n<br />
is the number of items in the index. A brute force search will always<br />
run in time O(n). Scanning RAM instead of disk provides a linear<br />
factor speedup. The tree method wins out after only a very small<br />
change in the size of n (specifically, your order of magnitude or so.)</p>

<p>Even in memory, a brute-force search is going to be limited by the<br />
data rate that memory supports. A btree or generic index is going<br />
to beat that simply by virtue of not needing to scan through most<br />
of the corpus.</p>

<p>Sadly, on windows, you are hamstrung by poor implementations <br />
(Microsoft Find Fast or whatever basically sucks) but at least in<br />
Unix-land, there are good solutions. I have over a gigabyte of<br />
archived mail, and using glimpse with an on-disk hash is still much<br />
faster than simply putting everything in RAM and scanning the whole<br />
thing.</p>]]>
    </content>
    <published>2003-04-15T19:20:36Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1816</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1816" />
    <title>Comment from joshua on 2003-04-15</title>
    <author>
        <name>joshua</name>
        <uri>http://burri.to/~joshua/</uri>
    </author>
    <content type="html" xml:lang="en" xml:base="http://burri.to/~joshua/">
        <![CDATA[<p>Perhaps you should look at (the now somewhat quaintly named) book,<br />
Managing Gigabytes (http://www.cs.mu.oz.au/mg/) - it covers<br />
indexing in quite a lot of depth.</p>]]>
    </content>
    <published>2003-04-15T19:32:00Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1817</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1817" />
    <title>Comment from Daniel Egnor on 2003-04-15</title>
    <author>
        <name>Daniel Egnor</name>
        <uri>http://ofb.net/~egnor/</uri>
    </author>
    <content type="html" xml:lang="en" xml:base="http://ofb.net/~egnor/">
        <![CDATA[<p>The Windows virtual memory system is not "excellent".  It is atrocious, which is why you see any benefit from a RAMdisk in the first place.  And you *are* advocating disabling it.  That's exactly what a RAMdisk does.  Instead of saying "use this memory to cache the most often used information, or to store running applications, or to generally optimize performance", you're saying "use this memory to cache exactly these files, regardless of how frequently or infrequently they're used, and if there's any space left over, don't use it for anything".</p>

<p>Don't believe us?  Install a *decent* third party search tool.  Microsoft's are all really stupid and have confusing user interfaces that lead you to believe that things are indexed when they're really not.  Hell, Zoe is freeware written in Java and it still runs rings around Microsoft's indexing; how's that for pathetic?  And there are much better tools than Zoe.  (I don't use Windows, so I can't tell you exactly which one is best right now.)</p>

<p>If you find that a RAMdisk helps you, then by all means use one, but understand that this is not a new and exciting principle for system design.  System designers already spend lots of time carefully balancing disk and RAM -- at least, the good ones do.  A RAMdisk is the clumsiest possible caching solution, and the fact that it helps you says more about Microsoft's technology than anything else.</p>]]>
    </content>
    <published>2003-04-15T19:32:05Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1818</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1818" />
    <title>Comment from Anil on 2003-04-15</title>
    <author>
        <name>Anil</name>
        <uri>http://anildash.com/</uri>
    </author>
    <content type="html" xml:lang="en" xml:base="http://anildash.com/">
        <![CDATA[<p>Phew! You guys are brutal. Which is at least partially a reflection of the fact you're right. The "excellent" above was facetious, but your point still stands. Perhaps I should recast my recommendation within the context of what comes with the operating system today, not what's possible with third-party indexing software.</p>

<p>I guess what I'm advocating, if you separate out the implementation, is caching of information based on its importance, not merely the frequency with which it's accessed. For example, I have archives of old mail which I only touch once a week, or once a month, or sometimes less than that. But when I need a phone number or some quote out of one of those messages, I need it <em>now</em>, and even the best indexing systems that I've seen don't handle that properly yet.</p>

<p>So I want to be able to flag data as being important to cache, not merely frequently accessed and efficiently indexed. </p>

<p>Thanks to both of you for the advice, though. That's what I get for speaking on a subject based on observations instead of in-depth knowledge. Cool stuff!</p>]]>
    </content>
    <published>2003-04-15T20:31:39Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1819</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1819" />
    <title>Comment from Lotas Smartman on 2003-04-15</title>
    <author>
        <name>Lotas Smartman</name>
        <uri>http://www.lotas-smartman.net/blog</uri>
    </author>
    <content type="html" xml:lang="en" xml:base="http://www.lotas-smartman.net/blog">
        <![CDATA[<p>one word: http://www.superspeed.com/. well URL! they have one that works. one of their apps mirrors, one just deletes when your system reboots. The one that mirrors sounds like the one your looking for. Their soft called ramdisk is the one that backups stuff. very interesting idea.</p>]]>
    </content>
    <published>2003-04-15T22:08:15Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1820</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1820" />
    <title>Comment from Grant Barrett on 2003-04-15</title>
    <author>
        <name>Grant Barrett</name>
        <uri>http://www.worldnewyork.net/</uri>
    </author>
    <content type="html" xml:lang="en" xml:base="http://www.worldnewyork.net/">
        <![CDATA[<p><i>You can get desktop search applications that work much more quickly than Google does; the cost is that they'll need to "crawl" your data periodically (just like Google!) and spend a bunch of disk space on an index (just like Google!).</i></p>

<p>On OS X, the locate DB is a god-send in the terminal. It works like a champ. And if I leave the Sherlock indexing turned on, find by content in Aqua is super-sweet. </p>

<p>I think you're on Windows, Anil, but if you've got an OS X machine handy, drag those foldrs into the Sherlock window, do a Get Info on the original folder, and choose the drop-down triangle for Index Content. Next time you need to look in that folder (which I sounds like it's static, otherwise you ought to manually upate it regularly), the search by content is super-fast. I do exactly this for some old mail folders. </p>

<p>I believe the same thing exists in Windows, but I usually turn it off, there, too, and so have little experience with it beyond that. </p>

<p>Also, I don't know if you saw <a>this</a>, but it sounds interesting. Also, there are <a>vague rumors</a> that something like the BeOS live metadata file system will be implemented in the next major release of OS X. That kind of setup basically precludes real searching at all, if I understand it correctly.</p>]]>
    </content>
    <published>2003-04-16T00:38:04Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1821</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1821" />
    <title>Comment from Brian on 2003-04-16</title>
    <author>
        <name>Brian</name>
        <uri>http://introverting.nu</uri>
    </author>
    <content type="html" xml:lang="en" xml:base="http://introverting.nu">
        <![CDATA[<p>Grant, glad to see someone mention indexing in OS X ... </p>

<p>Not a Win/Mac thing, but Mac users should pay attention to indexing. For example, by default the Finder's preferences are set to use languages such as Danish, French, German, etc. to search files.  Pop that down to English only (or, fewer languages, at least) and you'll not only decrease the size of the database, but you'll also increase the speed of your searches.</p>

<p>I also make a habit of re-indexing my PowerMail database from time to time ... It finds mail extremely quickly.</p>]]>
    </content>
    <published>2003-04-16T04:55:03Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1822</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1822" />
    <title>Comment from Etienne Pollard on 2003-04-16</title>
    <author>
        <name>Etienne Pollard</name>
        <uri></uri>
    </author>
    <content type="html" xml:lang="en" xml:base="">
        <![CDATA[<p>Just wanted to second joshua's book recommendation (if you find this stuff interesting!) - "Managing Gigabytes" is an astonishingly good book on all aspects of text and image indexing and compression. The software is a bit out of date, but it's still the finest book on this subject ever published (IMHO).</p>

<p>A few other people recommending it: http://www.bigredswitch.com/blog/archives/2002/12/10/000093.html, http://www.amazon.com/exec/obidos/tg/detail/-/1558605703%3Fvi%3Dglance&e=6251</p>

<p>The accompanying software (http://www.mds.rmit.edu.au/mg/) was created to demonstrate the key concepts from the book and was originally written in C, but appears to be unmaintained now. However, there is a Java version (http://mg4j.dsi.unimi.it/) which looks interesting.</p>]]>
    </content>
    <published>2003-04-16T15:18:06Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1823</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1823" />
    <title>Comment from nathan on 2003-04-16</title>
    <author>
        <name>nathan</name>
        <uri>http://www.simiant.com</uri>
    </author>
    <content type="html" xml:lang="en" xml:base="http://www.simiant.com">
        <![CDATA[<p>Solid state is where it's at: http://www.texmemsys.com/ or http://www.soliddata.com/products/ ...no moving parts.</p>]]>
    </content>
    <published>2003-04-16T20:22:13Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1824</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1824" />
    <title>Comment from paul mison on 2003-04-17</title>
    <author>
        <name>paul mison</name>
        <uri>http://husk.org/blog/</uri>
    </author>
    <content type="html" xml:lang="en" xml:base="http://husk.org/blog/">
        <![CDATA[<p>HFS+ *is* indexed. There's a file structure (the Directory B-Tree, I believe; developer.apple.com explains this all in a TechNote) that tells the system where every file is, and as a byproduct file searches only have to look at this structure, rather than the whole file system. It certainly records file names, which are the most commonly searched for item.</p>

<p>Of course, mounted drives that aren't HFS+, or UFS drives (if you're that much of a Unix weenie) don't have the same data available, so the Finder's Find is much slower. That's where locatedb might come in worthwhile.</p>]]>
    </content>
    <published>2003-04-17T09:44:02Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1825</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1825" />
    <title>Comment from robnit on 2003-04-23</title>
    <author>
        <name>robnit</name>
        <uri>http://www.mary-margaret.com</uri>
    </author>
    <content type="html" xml:lang="en" xml:base="http://www.mary-margaret.com">
        <![CDATA[<p>is this maybe what you want?<br />
http://www.whereisit-soft.com/</p>

<p>I need something similar, to search the hundreds of resumes I have stored on my drive.<br />
-robnit</p>]]>
    </content>
    <published>2003-04-23T20:58:31Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1826</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1826" />
    <title>Comment from Akilesh on 2003-04-27</title>
    <author>
        <name>Akilesh</name>
        <uri>http://www.akilesh.com/</uri>
    </author>
    <content type="html" xml:lang="en" xml:base="http://www.akilesh.com/">
        <![CDATA[<p>"But when I need a phone number or some quote out of one of those messages, I need it now, and even the best indexing systems that I've seen don't handle that properly yet."</p>

<p>There certainly are good indexing systems that handle that properly. Perhaps try an evaluation copy of <a href="http://www.dtsearch.com/PLF_desktop_2.html" rel="nofollow">dt-search desktop</a> or <a href="http://www.enfish.com/" rel="nofollow">Enfish</a> or, for something a little more esoteric, <a href="http://www.zootsoftware.com/" rel="nofollow">Zoot</a>. </p>

<p>With all of these you should see pretty much instant searches after they've indexed the relevant data.</p>]]>
    </content>
    <published>2003-04-27T05:14:31Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1827</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1827" />
    <title>Comment from ken on 2004-02-17</title>
    <author>
        <name>ken</name>
        <uri></uri>
    </author>
    <content type="html" xml:lang="en" xml:base="">
        <![CDATA[<p>paul: what they mean is "indexed content".  Sure, HFS+ is fast at finding a file with a certain name, but if you've indexed the content, then you can do google-esque searches on the content, like "find me all the files in my home folder that use the term 'banana'".</p>

<p>The Directory B-Tree will let you find files with the name "banana" quickly, but they still have to look at the contents of each file if you want to search the content, if it's not content-indexed as well.</p>]]>
    </content>
    <published>2004-02-17T20:10:33Z</published>
  </entry>

  <entry>
    <id>tag:www.dashes.com,2003:/anil//1.1633-comment:1828</id>
    <thr:in-reply-to ref="tag:www.dashes.com,2003:/anil//1.1633" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html"/>
    <link rel="alternate" type="text/html" href="http://dashes.com/anil/2003/04/googles-advanta.html#c1828" />
    <title>Comment from &#27611;&#34987;&#20250; on 2004-04-11</title>
    <author>
        <name>&#27611;&#34987;&#20250;</name>
        <uri></uri>
    </author>
    <content type="html" xml:lang="en" xml:base="">
        <![CDATA[<p>&#19981;&#20840;&#30693;&#36947;&#21834;</p>]]>
    </content>
    <published>2004-04-11T07:38:53Z</published>
  </entry>

</feed>
