I.V. Polyakov – Ph.D.(Phys.-Math.), Associate Professor, HSE (Moscow)

E-mail: ipolyakov@hse.ru

V.O. Polyakova – Student, HSE (Moscow)

E-mail: igorp86@mail.ru

A.A. Chepovskiy – Ph.D.(Phys.-Math.), Associate Professor, HSE (Moscow) E-mail: aachepovsky@hse.ru

In this paper we propose different approaches for compact storaging of big social graphs. The joint use of two types of storages makes it possible to obtain a flexible scheme that is oriented both to the fast completion of the graph and to fast searches for the paths and extracting of subgraphs. The effectiveness of the proposed structure is confirmed by experiments with data from the social network VKontakte.

1. Angles R. A Comparison of Current Graph Database Models // Proc. of the 2012 IEEE 28th International Conference on Data Engineering Workshops (ICDEW '12). IEEE Computer Society. Washington, DC, USA. 2012. P. 171−177.
2. Shalini Batra, Charu Tyagi Comparative Analysis of Relational and Graph Databases // International Journal of Soft Computing and Engineering (IJSCE). 2012. V. 2. № 2. P. 509−512.
3. Shrinivas S.G. et al. Applications of Graph Theory in Computer Science an Overview // International Journal of Engineering Science and Technology. 2010. V. 9. P. 4610−4621.
4. Polyakov I.V., Chepovskiy A.A., Chepovskiy A.M. Sgatie dannikh v khranilishe bolshikh graphov // Fundamentalnaya I prikladnaya matematika. 2016. V. 21. № 4. S. 125−132.
5. Polyakov I.V., Chepovskiy A.A. Buferizaciya i sgatie dannikh pri khranenii multigrapha // Trudi Megdunar. nauchnoy konf. Moskovskogo phiziko-tekhnicheskogo instituta (gosudarstvenniy universitet) и Instituta phiziko-tekhnicheskoy informatiki (SCVRT1516). М., Protvino: Institut phiziko-tekhnicheskoy informatiki. 2016. S. 76−78.
6. Polyakov I.V., Chepovskiy A.A., Chepovskiy A.M. Khranenie I obrabotka grapha socialnikh setei // Vestnik NGU. Ser.: Informacionnie tekchnologii. 2013. V. 11. № 4. S. 77−83.
7. Kang U., Hanghang Tong, Jimeng Sun, Ching-Yung Lin, Christos Faloutsos GBASE: a scalable and general graph management system // Proc. of the 17th ACM SIGKDD International conference on Knowledge discovery and data mining. August 21−24, 2011. San Diego, California, USA.
8. Bazenkov N.I., Gubanov D.A. Obzor informacionnikh system analiza socialnikh setei // Sb. Trudov «Upravlenie bolshimi sistemami». 2013. S. 357−394.
9. Batur T.V. Metodi analyza komputernikh socialnikh setei // Vestnik NGU. Ser.: Informacionnie tekchnologii. 2012. V. 10. № 4. S. 13−28.
10. Polyakov I.V., Chepovskiy A.A., Chepovskiy A.M. Algoritmi poiska putey na graphakh bolshogo razmera // Fundamentalnaya I prikladnaya matematika. 2014. V. 19. № 1. S. 165−172.
11. Kolomeychenko M.I., Polyakov I.V., Chepovskiy A.A., Chepovskiy A.M. Vy’delenie soobshhestv v grafe vzaimodejstvuyushhix ob’‘ektov // Fundamentalnaya I prikladnaya matematika. 2016. V. 21. № 3. S. 131−139.
12. Kolomeychenko M.I., Polyakov I.V., Chepovskiy A.A., Chepovskiy A.M. Metodi visualnogo analyza graphov. M.: Nacionalniy otkritiy universitet «INTUIT». 2016.