Hi, If you store all mutual relations in a database, a lot of the relations will overlap. This is easily done using distinct clauses in sql. Use the overlapped values as tags on documents. That way you gain tremendous performance in search time, Obviously updating documents are a performance loss.
If users tend to upload more than find new "friends" it is good... -----Original Message----- From: Gérard Dupont [mailto:ger.dup...@gmail.com] Sent: 2. september 2009 11:54 To: solr-user@lucene.apache.org Cc: solr-...@lucene.apache.org; lucene-u...@lucene.apache.org; 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)). You can increase this limit of boolean clauses in the configuration but I guess too much is painful. I know that colleagues of me worked on Lucene with up to ~500 boolean wuery ith huge response time constraints and many GB indexes and it was working fine. I guess SolR will work in the same way. On Wed, Sep 2, 2009 at 11:47, rajan chandi <chandi.ra...@gmail.com> 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 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 > network. > I should be search across only 150 users' content. > > Is there an easy way to approach this problem? > > We've come-up with different approaches:- > > > - Storing the relationship in each document. > - A huge ORed query with all the IDs of the people that needs to be > searched. > - Creating a query and filtering the results based on the list of > contacts. > > None of these approach sounds to be plausible. > > We already have gone through recently released book on Solr 1.4 Enterprise > Search. The book also doesn't seem to have any pointers. > > Any good approach/pointers will help. > > Thanks and regards > Rajan Chandi > -- Gérard Dupont Information Processing Control and Cognition (IPCC) - EADS DS http://weblab-project.org Document & Learning team - LITIS Laboratory
