2014-05-08 22:42

題目鏈接

原題：

How would you split a search query across multiple machines?

題目：如何把一個搜索query分發(fā)到多個機(jī)器上？

解法：又是“Guy”出的題目。對query字符串算取數(shù)字簽名，然后對集群的機(jī)器數(shù)量取模，就可以得到對應(yīng)落在的機(jī)器了。

代碼：

1 // http://www.careercup.com/question?id=5377673471721472 2 // Answer: 3 // The genenral practice of splitting queries across multiple machine, would require two parts: 4 // 1. convert the query to a digital sign, possibly an integer. 5 // 2. modulo it by the number of machines in a cluster, this process may be multi-layered. 6 // Other scheduling strategies may affect the result of splitting, but I think modulo will be a simple and balanced way to split the queries. 7 int main() 8 { 9 return 0; 10 }

?

轉(zhuǎn)載于:https://www.cnblogs.com/zhuli19901106/p/3717855.html

總結(jié)

以上是生活随笔為你收集整理的Careercup - Google面试题 - 5377673471721472的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。