Re:ITA Software's Hiring Puzzles
by chime on Thursday April 22, 2010 @08:39AM
(#1284873)
There are no map-reduce implementations that work in real-time? I thought Google search worked like that. I do want it to work dynamically.
[ Parent
| on HN ]
MapReduce is used to build the search index (constantly), and your searches are run against the index.
You might find some of these links useful:
Re:ITA Software's Hiring Puzzles
by infinite8s on Friday April 23, 2010 @05:19PM
(#1289520)
You can use map-reduce on your search by partitioning up the starting keyspace alphabetically (26/num nodes), although with such an even partitioning the search will probably be unbalanced. But with some simple metrics on the starting letter frequency of words you could define a more balanced partitioning.