Data push method and device, storage medium, and electronic device

#This application claims priority to PCT Application No. PCT/CN2018/075778, filed on Feb. 8, 2018, which in turn claims priority of Chinese Patent Application No. 201710109224.X, filed with the Chinese Patent Office on Feb. 27, 2017 and entitled “DATA PUSH METHOD AND DEVICE”. The two applications are incorporated by reference in their entirety.

#The present disclosure relates to the computer field, and specifically, to a data push method and device, a storage medium, and an electronic device.

#Identifier information (docId) of articles is cached directly in existing solutions for storing data push history. Internet users have increasingly demanded for latest feeds in this era of information explosion. Data push applications attract users by the important factors of efficiency and real-time performance of pushing relevant data to the users. The retention rate of users decreases if users keep seeing same feeds repetitively when refreshing data or failing to refresh data. Therefore, when data is pushed to users, efficient filtering of historical pushed data is critical to retention of users.

#The accompanying drawings shown herein are provided for further understanding of the present disclosure, and constitute a part of this application, and the exemplary embodiments of the present disclosure and its description are used for explaining the present disclosure, but do not constitute improper limitations to the present disclosure. In the accompanying drawings:

#FIG. 1 is a schematic diagram of storing historical push data according to the related technology;

#FIG. 2 is a schematic diagram of an application environment of a data push method according to an embodiment of the present disclosure;

#To make the solutions of the present disclosure more comprehensible to a person skilled in the art, the following clearly and completely describes the technical solutions in the embodiments of the present disclosure with reference to the accompanying drawings in the embodiments of the present disclosure. Apparently, the described embodiments are some of the embodiments of the present disclosure rather than all of the embodiments. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments of the present disclosure without creative efforts shall fall within the protection scope of the present disclosure.

#It should be noted that the terms “first” and “second” in the specification, the claims, and the accompanying drawings of the present disclosure are used only to differentiate similar objects, and do not describe a specific relationship or sequence therebetween. It is to be understood that the terms so used are interchangeable under appropriate circumstances such that the embodiments of the present disclosure described herein can be implemented in sequences other than those illustrated or otherwise described herein. Moreover, the terms “include”, “comprise”, and any variants thereof are intended to cover a non-exclusive inclusion, such that a process, method, system, product, or device that includes a series of steps or units is not necessarily limited to those steps and units expressly listed, but may include other steps or units not expressly listed or inherent to such process, method, product, or device.

#Often, docId of an article is cached directly in a solution for storing historical push data. FIG. 1 is a schematic diagram of storing historical push data according to the related technology. As shown in FIG. 1, identifier information (docId) of historical push data is stored in a cache region. Undesirable experience may occur when data (for example, feeds) has excessively large quantities of users and refreshes. For example, an article is pushed repeatedly, or data fails to be refreshed. As a result, feeds cannot be infinitely refreshed. The main reason is as follows: Identifier information (docId) of articles is cached directly in the existing solution for storing historical push data. When a quantity of refreshes of users is excessively large, storage space is excessively consumed to cause a rapid increase in storage costs. In such scenarios, storage overflows, old data push records are eliminated, and many repetitive articles are recommended consequently. In addition, historical data push records of users are stored at a remote cache service node. When there is a large amount of storage, a remotely read single historical record may be excessively large to cause a network timeout. As a result, a historical data push record cannot be returned, and no recommended data of feeds is returned.