On Fri, Apr 2, 2010 at 12:54 AM, Chris Lu <chris...@gmail.com> wrote: > No need for Hadoop. It's even more slower. Lucene can do it easily. > > This has been implemented in DBSight. > The implementation is very similar to Facet search. Just need a way to load > the field quickly, like put it in memory or some data structure, and count > the sum/min/max during searching.
This will ONLY compute the aggregated value ( sum,count,min,max etc. ). I guess what Mike wants is use the aggregated value to sort the entries. Dynamically maintaining a sorted list while searching could be extremely expensive. > > -- > Chris Lu > ------------------------- > Instant Scalable Full-Text Search On Any Database/Application > site: http://www.dbsight.net > demo: http://search.dbsight.com > Lucene Database Search in 3 minutes: > http://wiki.dbsight.com/index.php?title=Create_Lucene_Database_Search_in_3_minutes > DBSight customer, a shopping comparison site, (anonymous per request) got > 2.6 Million Euro funding! > > > prasenjit mukherjee wrote: >> >> This looks like a use case more suited for Pig ( over Hadoop ). >> >> It could be difficult for lucene to do sort and sum simultaneously as >> sorting itself depends upon summed value. >> >> On Thu, Apr 1, 2010 at 11:47 PM, Michel Nadeau <aka...@gmail.com> wrote: >> >>> >>> Well that's my problem: we have a lot of records of all types >>> (afiiliates, >>> sales) so looping tons of records each time isn't possible. >>> >>> - Mike >>> aka...@gmail.com >>> >>> >>> On Thu, Apr 1, 2010 at 2:11 PM, prasenjit mukherjee >>> <prasen....@gmail.com>wrote: >>> >>> >> >> --------------------------------------------------------------------- >> To unsubscribe, e-mail: java-user-unsubscr...@lucene.apache.org >> For additional commands, e-mail: java-user-h...@lucene.apache.org >> >> > --------------------------------------------------------------------- To unsubscribe, e-mail: java-user-unsubscr...@lucene.apache.org For additional commands, e-mail: java-user-h...@lucene.apache.org
