Why Graph Search Is Moving Databases to a New Level
NEWS ANALYSIS: Open-source database features the most far-reaching search IT since Google started ranking Websites more than a decade ago.Little do we know how popular cloud services such as Google, Yahoo, Bing, Twitter, Facebook, Pinterest, LinkedIn, Google+ and Web-based email have not only improved the way people interconnect, socialize and do business, they also help improve our search for information on the Web. But they have, and significantly so. Because computers and networks remember everything we do when we punch a keyboard, click on a Website or touch a virtual keyboard, those massive logs of data saved by networks are now leading us into a new world of search: graph search. Graph search, an open-source database project built on all the networking we do online every day, is the most far-reaching search IT to go mainstream since Google started storing up and ranking Websites more than a decade ago. Basically, a graph search database anonymously uses all the contacts in all the networks in which you work to help you find information. Anything you touch, any service you use and anything people in your networks touch eventually can help speed information back to you. It avoids anything non-relevant that would slow down the search. How It Stands Apart From Standard Databases
Here's a typical use case: You might be looking for a particular type of restaurant in New York City--say Vietnamese. Using a graph search engine--let's deploy the one now powering Facebook's internal search--you enter a query (i.e., "Vietnamese restaurant in midtown Manhattan"); the graph search database then connects all the dots in your friends' accounts and identifies whether they've talked about, photographed or reviewed Vietnamese restaurants in midtown Manhattan. It looks at previous queries about Vietnamese restaurants you have made yourself in the past, it looks at the local geographic area where you currently are, and then it delivers those search results to you in microseconds.