Tonight it鈥檚 a challenging one. Or, better, a problem of which is really difficult to find a good solution in < O(n3). Indeed, it鈥檚 a question that an ex-colleague was asked during an interview with Big-G. The guy, a part from being a REALLY smart guy, is also very humble, and he doesn鈥檛 want to be mentioned by name. So, sorry for girls looking for a young, smart, promising young man: you need to find who he is yourself. ;) ...
I was looking for info about [en:MapReduce] and I thought that would have been a good idea to take a look at the Tech Talks published by Google. Here we go. Title: 2007 Seattle Conference on Scalability: MapReduce Used on Large Geographic Data Sets Location: Google Tech Talks June 23, 2007 Speaker: Barry Brumitt, Google Inc. Abstract: MapReduce is a programming model and library designed to simplify distributed processing of huge datasets on large clusters of computers. This is achieved by providing a general mechanism which largely relieves the programmer from having to handle challenging distributed computing problems such as data distribution, process coordination, fault tolerance, and scaling. While working on Google maps, I鈥檝e used MapReduce extensively to process and transform datasets which describe the earth鈥檚 geography. In this talk, I鈥檒l introduce MapReduce, demonstrating its broad applicability through example problems ranging from basic data transformation to complex graph processing, all the in the context of geographic data. ...