Dynamo: amazon's highly available key-value store
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Survey of graph database models
ACM Computing Surveys (CSUR)
Bigtable: A Distributed Storage System for Structured Data
ACM Transactions on Computer Systems (TOCS)
Planetary-scale views on a large instant-messaging network
Proceedings of the 17th international conference on World Wide Web
Saying good-bye to DBMSs, designing effective interfaces
Communications of the ACM - The Status of the P versus NP Problem
| Hi-index | 0.00 |
Nowadays, the glory of social networking sites is unprecedented. Thus, we are so close; the world is even smaller than you thought; a friend of your friend probably knows a friend of others friend; Facebook shrunk the gap between us. The six degrees of separation theory proposed in 1967 stated that we are all just six degrees of separation apart. This paper addresses the research problem of identifying the degree of separation from a different viewpoint by considering not only the degree of separation between two normal-persons or famous-persons, but also between two persons with very rare-special features. We re-evaluate and extend the six degrees of separation theory by using a real social searching Facebook tool ''We R So Close''. Experiments were performed on Facebook platform; and the graph database was used to store the collected data. Results add a new phase to the research that cemented the phrase ''six degrees of separation'', it reported that the average number of acquaintances separating any two people no matter who they are even with rare-special features, i.e. those who work in rare jobs, is not six but 3.9.