Re: A very complex search problem.

2009-09-02 Thread rajan chandi
f relationship concept so > > > you don't end up with N users and N relations... > > > In this is the case when you search than you only have 1 And clause > > > instead of 3. > > > > > > > > > I think Hadoop running HBase is ideal

Re: A very complex search problem.

2009-09-02 Thread Aakash Dharmadhikari
have 1 And clause > > instead of 3. > > > > > > I think Hadoop running HBase is ideal for this application. Facebook is > > using HBase (I think) CouchDB is also excellent... > > > > > > -Birger > > > > > > > > > > > &

Re: A very complex search problem.

2009-09-02 Thread rajan chandi
-Original Message- > From: gwk [mailto:g...@eyefi.nl] > Sent: 2. september 2009 12:34 > To: solr-user@lucene.apache.org > Subject: Re: A very complex search problem. > > Hello Rajan, > > I might be mistaken, but isn't CouchDB or a similar map/reduce database > ideal f

Re: A very complex search problem.

2009-09-02 Thread rajan chandi
Hi Gwk, Thanks for the pointers. The only concern will be the relevance. Lucene has the best relevance capability so far. CouchDB sounds to be interesting though. May be We'll try to find some bench-marks on relevance score of CouchDB. Thanks and Regards Rajan Chandi On Wed, Sep 2, 2009 at 4:04

RE: A very complex search problem.

2009-09-02 Thread Lie, Birger
pplication. Facebook is using HBase (I think) CouchDB is also excellent... -Birger -Original Message- From: gwk [mailto:g...@eyefi.nl] Sent: 2. september 2009 12:34 To: solr-user@lucene.apache.org Subject: Re: A very complex search problem. Hello Rajan, I might be mistaken, but isn'

Re: A very complex search problem.

2009-09-02 Thread gwk
Hello Rajan, I might be mistaken, but isn't CouchDB or a similar map/reduce database ideal for situations like this? Regards, gwk rajan chandi wrote: Hi All, We are dealing with a very complex problem of person specific search. We're building a social network where people will post stuff

Re: A very complex search problem.

2009-09-02 Thread rajan chandi
lucene-...@lucene.apache.org; Shalin Shekhar Mangar > Subject: Re: A very complex search problem. > > Hi, > > The big OR query should be the easiest way and it may work up to ~1000 > users > (ie you can specific by default 1024 boolean clause so up to N users in the >

RE: A very complex search problem.

2009-09-02 Thread Lie, Birger
g; lucene-...@lucene.apache.org; Shalin Shekhar Mangar Subject: Re: A very complex search problem. Hi, The big OR query should be the easiest way and it may work up to ~1000 users (ie you can specific by default 1024 boolean clause so up to N users in the OR where N = 1024 - (boolean clause in your query)

Re: A very complex search problem.

2009-09-02 Thread Gérard Dupont
Hi, The big OR query should be the easiest way and it may work up to ~1000 users (ie you can specific by default 1024 boolean clause so up to N users in the OR where N = 1024 - (boolean clause in your query)). You can increase this limit of boolean clauses in the configuration but I guess too much

A very complex search problem.

2009-09-02 Thread rajan chandi
Hi All, We are dealing with a very complex problem of person specific search. We're building a social network where people will post stuff and other users should be able to see the content only from their contacts. e.g. There are 10,000 users in the system and there are only 150 users in my netw