Thank you Erik. It is not clear to me what it would look like in Ferret, but it sounds like a good direction to dig in.
> Erik Hatcher wrote: > I'm not familiar enough with Ferret, but I do this sort filtering and > set intersections with Java Lucene, primarily using Solr, from a Ruby > on Rails front-end. > > I build up bit sets (using Solr's new OpenBitSet class) that > represent "all items collected" and apply that filter to searches and > also intersect (using bit set ANDing) with other sets such as "all > objects from 1861" and "all poetry genre objects", and so on. I've > also customized Solr to return back facet counts, so given your > example it could show how many books were in stock in each category > and allow you to filter to see all those books easily too. Using > these types of set intersection operations even bypasses the > traditional Lucene search by simply dealing with efficiently > structure sets of document id's. > > Erik -- Posted via http://www.ruby-forum.com/. _______________________________________________ Ferret-talk mailing list [email protected] http://rubyforge.org/mailman/listinfo/ferret-talk
