Data updating method and web server

Abstract

The embodiment of the invention discloses a data updating method and a web server. The method of the embodiment of the invention comprises that: if the web server receives a data updating request of a user, a maximum clique to which the user is attributed is confirmed, and two random members in users in the maximum clique are friends; the web server sends a data inquiring message to a maximum clique cache server in which cache corresponding to the maximum clique is positioned; and the web server receives updating data sent by the maximum clique cache server, and the updating data are used for realizing data updating of the users requiring data updating. Only one data inquiring message needs to be sent or one time of data transmission needs to be performed for N friends in the maximum clique to which the user is attributed so that resources occupied by the web server in data updating or data uploading can be effectively reduced and system resources can be effectively saved.

Description

technical field [0001] The invention relates to the technical field of communication, in particular to a data update method and a web server. Background technique [0002] In recent years, social networks have developed rapidly and have increasingly become a part of people's daily lives. According to the 2011 Global Social Media Report released by InSites Consulting of the United States, there are more than 1 billion people in the world using social networks, accounting for about 70% of the number of Internet users. And more than 600 million users use social networks every day. At the same time, another data shows that the world's largest social network Facebook (Facebook) had 734.2 million global visits in June this year, and currently has more than 750 million registered users, covering 10% of the world's total population. For such a large-scale system, how to deploy and maintain it directly affects the performance, stability and user experience of the system, so the res...

AI Technical Summary

Problems solved by technology

[0009] Among them, the "pull-on-demand" mechanism based on memcached is to send a request to the web server when the user inquires about the update of friends' content. The cache server where the user is located sends query messages. When the data of the user’s friends is stored in N cache servers step by step, the web server has to send N query messages. When the data volume of the friends is large and the content is updated frequently, the N value will be Very large, resulting in a large query overhead and occupying a lot of system resources;

[0010] Among them, based on the memcached "push-on-change" mechanism, once a user updates the content, the user will push the actively updated content to the content cache of all friends. However, if the user has N friends, the To push N times, when the user has a large number of friends, it will take up a lot of system resources and bring a lot of load to the back-end server

Images