Randomized fully dynamic graph algorithms with polylogarithmic time per operation
Journal of the ACM (JACM)
Social Network Data Analytics
Outlier detection in graph streams
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Multidimensional social network: model and analysis
ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part I
A Generic Architecture for a Social Network Monitoring and Analysis System
NBIS '11 Proceedings of the 2011 14th International Conference on Network-Based Information Systems
Time-Aggregated graphs for modeling spatio-temporal networks
CoMoGIS'06 Proceedings of the 2006 international conference on Advances in Conceptual Modeling: theory and practice
A modelling framework for social media monitoring
International Journal of Web Engineering and Technology
| Hi-index | 0.00 |
Nowadays, WWW contains a number of social media sites, which are growing rapidly. One of the main features of social media sites is to allow to its users creation and modification of contents of the site utilizing the offered WWW interfaces. Such contents are referred to as user generated contents and their type varies from site to site. Social media sites can be modeled as constantly evolving multirelational directed graphs. In this paper we discuss persistent data structures for such graphs, and present and analyze queries performed against the structures. We also estimate the space requirements of the proposed data structures, and compare them with the naive "store each complete snapshot of the graph separately". We also investigate query performance against our data structure. We present analytical estimation results, simulation results, and discuss its performance when it is used to store entire contents of Live journal.