I've tried with OpenBitSetDISI...its not a performance effective one.... but able generate results with BitArray fast enough.... ... check the demo app http://demo.wisestepp.com/jobs/JobSearchResults.aspx?am9ibmFtZSxqYXZh-yCfmbUTwmeY%3d
If you have an example or sample code to work with OpenBitSetDISI..please fwd it to me... Thank you in advance. Regards, Karunaker Reddy V On Fri, May 20, 2011 at 1:05 PM, digy digy <digyd...@gmail.com> wrote: > Take a look at OpenBitSetDISI in Lucene.Net.Util > > DIGY > > On Fri, May 20, 2011 at 10:20 AM, lars aslin <larsaas...@gmail.com> wrote: > > > Hi > > Im building a search function with Lucene.NET where I want faceted > > searches to be supported. To accomplish this in an efficient way I > > thought a good idea would be to have a filter for each category and > > then use the AND-operation between each category-filters BitArray and > > the BitArray for the search result, thus getting the search result > > grouped by category by just using the AND-operation. Heres a blog-post > > describing it better > > > > > http://www.devatwork.nl/articles/lucenenet/faceted-search-and-drill-down-lucenenet/ > > . > > > > Now, I see that the Bits-method is tagged as "obsolete" in the API so > > I guess it will be removed sometime in the future. So is there another > > way of accomplish faceted searches in Lucene in a simular way or > > should stick to the Bits-method to receive a BitArray anyway. > > WebRep > > Overall rating > > >
