References - Data Storage for Social Networks: A Socially Aware Approach - page 43

12. Scellato, S., Mascolo, C., Musolesi, M., Latora, V.: Distance matters: geo-social metrics for
online social networks: salvatore scellato and cecilia mascolo and mirco musolesi and vito
latora. In: Proceedings of the 3rd Workshop on Online Social Networks (WOSN '10). pp. 8-8.
USENIX Association, Boston, MA, USA (2010). http://dl.acm.org/citation.cfm?id=1863190.
1863198
13. Ehrgott, M., Gandibleux, X.: Multiple criteria optimization. State of the Art Annotated
Bibliographic Surveys. Kluwer Academic, Dordrecht (2002)
14. Ghemawat, S., Gobioff, H., Leung, S.T.: The google file system. SIGOPS Oper. Syst. Rev. 37
(2003)
15. Haghani, P., Michel, S., Cudre-Mauroux, P., Aberer, K.: LSH at large—distributed KNN search
in high dimensions. 11th International Workshop on the Web and Databases (WebDB). Canada
(2008). http://webdb2008.como.polimi.it/images/stories/WebDB2008/paper14.pdf
16. Hewitt, E.: Cassandra: The Definitive Guide, 1st edn. O'Reilly Media, pages 332 Nov 29,
(2010)
17. Karger, D., Lehman, E., Leighton, T., Panigrahy, R., Levine, M., Lewin, D.: Consistent hashing
and random trees: distributed caching protocols for relieving hot spots on the world wide
web. In: Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing,
STOC '97, pp. 654-663. ACM, New York, NY, USA (1997)
18. Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular
graphs. SIAM J. Sci. Comput. 20 , 359-392 (1998)
19. Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular
graphs. SIAM J. Sci. Comput. 20 , 359-392 (1998)
20. Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R.,
Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: Oceanstore: an architecture for
global-scale persistent storage. SIGPLAN Not. 35 , 190-201 (2000)
21. Lakshman, A., Malik, P.: Cassandra: a decentralized structured storage system. SIGOPS Oper.
Syst. Rev. 44 , 35-40 (2010)
22. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. ACM Commun.
21 , 558-565 (1978)
23. Leskovec, J., Lang, K.J., Mahoney, M.: Empirical comparison of algorithms for network
community detection. In: Proceedings of the 19th International Conference on World Wide
Web, WWW '10, pp. 631-640. ACM, New York, NY, USA (2010). http://doi.acm.org/10.1145/
1772690.1772755 . http://doi.acm.org/10.1145/1772690.1772755
24. Liben-Nowell, D., Novak, J., Kumar, R., Raghavan, P., Tomkins, A.: Geographic routing in
social networks. Proc. Natl. Acad. Sci. USA 102 (33), 11623-11628 (2005)
25. Merkle, R.C.: A digital signature based on a conventional encryption function. In: A Confer-
ence on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology,
CRYPTO '87, pp. 369-378, Springer-Verlag, UK (1988). http://dl.acm.org/citation.cfm?id=
646752.704751
26. Newman, M.E.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. USA
103 (23), 8577-8582 (2006)
27. Nguyen, K., Pham, C., Tran, D.A., Zhang, F.: Preserving social locality in data replication
for social networks. In: IEEE ICDCS 2011 Workshop on Simplifying Complex Networks for
Practitioners (SIMPLEX 2011). Minneapolis, MN (2011)
28. Niesen: Social networks/blogs now account for one in every four and a half min-
utes online. (2010) http://blog.nielsen.com/nielsenwire/global/social-media-accounts-for-22-
percent-of-time-online/ . Report
29. Nishida, H., Nguyen, T.: Optimal client-server assignment for internet distributed systems.
In: 20th International Conference on Computer Communications and Networks (ICCCN
2011). Maui, Hawaii, USA (2011)
30. Pitoura, T., Ntarmos, N., Triantafillou, P.: Replication, load balancing and efficient range
query processing in dhts. In: Proceedings of the 10th international conference on Advances
in Database Technology,

EDBT '06, pp. 131-148, Munich, Germany, Springer-Verlag,

Heidelberg (2006). http://dx.doi.org/10.1007/11687238 11