[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: Indexed search with grep-like output

From: Eli Zaretskii
Subject: Re: Indexed search with grep-like output
Date: Sun, 02 Jan 2011 08:31:21 -0500

> From: Lennart Borgman <address@hidden>
> Date: Sun, 2 Jan 2011 12:40:10 +0100
> Cc: address@hidden
> On Sun, Jan 2, 2011 at 12:18 PM, Eli Zaretskii <address@hidden> wrote:
> >> From: Lennart Borgman <address@hidden>
> >> Date: Sun, 2 Jan 2011 05:12:32 +0100
> >> Cc: address@hidden
> >>
> >> I do not know about other search engines, but at least Windows Desktop
> >> Search allows you to restrict the search later.
> >
> > Because it's dog slow.
> Is it? Can you give an example?

`lid' takes 0.1sec to return results of a query of a DB that indexes
12,800 source files of a large C++ software system.  What's your
timing of a comparable query with Windows Desktop?

> I read that people have had good experience with Lucene and large
> amounts of files. Have you tested Lucene?

Yes, I use one of the tools that builds on Lucene (see
http://www.methods.co.nz/docindexer/) to index MS Office documents
(some 17,000 of them) I have on my office machine.  It is also very
fast: just a few seconds to return a query.

> > `lid' is very fast, so if you don't want to
> > index each tree separately, you can filter the output (which includes
> > the full absolute file name) in Emacs, in the process filter that
> > accepts `lid's output.
> Is not that slow since it requires a lot process switching?

Not slower than grep or compilation -- if you want the results to be
available to Emacs, and don't want to use synchronous subprocesses (so
that you could continue working while it runs, and perhaps even lookup
the first bunch of hits), you will always use this method.  (I don't
understand what you mean by "a lot of process switching" -- there are
two processes running in parallel.)

reply via email to

[Prev in Thread] Current Thread [Next in Thread]