{"id":642737,"date":"2013-02-15T15:32:08","date_gmt":"2013-02-15T20:32:08","guid":{"rendered":"http:\/\/gigaom.com\/?p=611223"},"modified":"2013-02-15T15:32:08","modified_gmt":"2013-02-15T20:32:08","slug":"facebooks-graph-search-mastermind-shares-a-few-tech-secrets","status":"publish","type":"post","link":"https:\/\/mereja.media\/index\/642737","title":{"rendered":"Facebook\u2019s Graph Search mastermind shares a few tech secrets"},"content":{"rendered":"

A month after launching its vaunted Graph Search feature to much fanfare, Facebook is finally opening up a bit about how, exactly, it works. The product\u2019s primary architect, Lars Rasmussen, took to Reddit yesterday in an Ask Me Anything session<\/a> during which he elaborated (beyond what Om reported last month<\/a>) on how Graph Search is built.<\/p>\n

Of course, this being a Reddit discussion, Rasmussen answers a bunch of questions about the history of graph search, its privacy issues, his role with building Google Maps (and Wave) and his walks with Mark Zuckerberg. But here are some of the more-informative excerpts about the architecture itself.<\/p>\n

\"gs4\"<\/a><\/p>\n

\"gs2\"<\/a><\/p>\n

\"gs1\"<\/a><\/p>\n

\"gs3\"<\/a><\/p>\n

I should point out, too, that we\u2019ll be talking a bit about graph processing and graph databases at our Structure: Data<\/a> conference next month, too. Graphs, as it turns out, are a great way to storing, processing and presenting a lot of data that has nothing to do with social connections<\/a>.<\/p>\n

\"\"<\/p>\n

<\/a><\/p>\n

Related research and analysis from GigaOM Pro:<\/strong>
Subscriber content. Sign up for a free trial<\/a>.<\/p>\n