lucene-java-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Mathieu Lecarme <>
Subject Re: Does Lucene support partition-by-keyword indexing?
Date Sat, 01 Mar 2008 21:50:02 GMT
The easiest way is to split index by Document. In Lucene, index  
contains Document and inverse index of Term. If you wont to put Term  
in different place, Document will be duplicated on each index, with  
only a part of their Term.

How will you manage node failure in your network?

They were some trial to build big p2p search engine to compet with  
Google, but, it will be easier to split by Document.

If you have to many computers and want to see them working together,  
why don't use Nutch with Hadoop?

Le 1 mars 08 à 19:16, Yin Qiu a écrit :

> Hi,
> I'm planning to implement a search infrastructure on a P2P overlay. To
> achieve this, I want to first distribute the indices to various nodes
> connected by this overlay. My approach is to partition the indices by
> keyword, that is, one node takes care of certain keywords (or  
> terms). When a
> simple TermQuery is encountered, we just find the node associated  
> with that
> term (with distributed hash table) and get the result. And suppose a
> BooleanQuery is issued, we contact all the nodes involved in this  
> query and
> finally merge the result.
> So my question is: does Lucene support partitioning the indices by  
> keywords?
> Thanks in advance.
> --
> Look before you leap
> -------------------------------------------

To unsubscribe, e-mail:
For additional commands, e-mail:

View raw message