CN110795667B - Method, device, equipment and storage medium for determining resources to be pushed - Google Patents
Method, device, equipment and storage medium for determining resources to be pushed Download PDFInfo
- Publication number
- CN110795667B CN110795667B CN201910995634.8A CN201910995634A CN110795667B CN 110795667 B CN110795667 B CN 110795667B CN 201910995634 A CN201910995634 A CN 201910995634A CN 110795667 B CN110795667 B CN 110795667B
- Authority
- CN
- China
- Prior art keywords
- network resource
- time
- value
- pushed
- bit sequence
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 55
- 238000003860 storage Methods 0.000 title claims abstract description 22
- 238000001914 filtration Methods 0.000 claims description 28
- 238000011161 development Methods 0.000 abstract description 10
- 238000012423 maintenance Methods 0.000 abstract description 7
- 238000005192 partition Methods 0.000 description 18
- 238000010586 diagram Methods 0.000 description 10
- 238000004590 computer program Methods 0.000 description 7
- 230000008569 process Effects 0.000 description 6
- 238000004891 communication Methods 0.000 description 5
- 230000006870 function Effects 0.000 description 5
- 230000007704 transition Effects 0.000 description 5
- 230000008859 change Effects 0.000 description 4
- 238000009826 distribution Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 2
- 238000013508 migration Methods 0.000 description 2
- 230000005012 migration Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 239000013307 optical fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000001364 causal effect Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000009897 systematic effect Effects 0.000 description 1
- 238000012549 training Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/958—Organisation or management of web site content, e.g. publishing, maintaining pages or automatic linking
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9535—Search customisation based on user profiles and personalisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9536—Search customisation based on social or collaborative filtering
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/01—Social networking
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Computing Systems (AREA)
- Health & Medical Sciences (AREA)
- Economics (AREA)
- General Health & Medical Sciences (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The disclosure provides a method, a device, equipment and a storage medium for determining resources to be pushed. The method comprises the following steps: acquiring a binary bit sequence of the network resource; the binary bit sequence comprises a classification identification bit and a time identification bit, wherein the classification identification bit represents the category to which the network resource belongs, and the time identification bit represents the release time of the network resource; and determining the network resource to be pushed according to the classification identification bit and the time identification bit contained in the binary bit sequence. According to the method and the device, the network resources to be pushed can be determined according to the classification identification bits and the time identification bits. Switching among a plurality of index lists is not needed, so that the development complexity and the maintenance cost are reduced.
Description
Technical Field
The present disclosure relates to the field of resource pushing, and in particular, to a method, an apparatus, a device, and a storage medium for determining a resource to be pushed.
Background
With the rapid development of networks, there is a product form that can display the content of works distributed by users within 24 hours. When a user releases a new piece of work content, all fans who pay attention to the user need to be distributed and informed, so that a row of user avatars is displayed at the top of the attention page of the user. These avatars are user avatars of works distributed within 24 hours of all people the user is interested in. If the latest work of one or several interested users has been over 24 hours, the user avatars will disappear in the attention page.
The network content published by the user can be collectively referred to as network resources. Such as video, speech, microblogs, etc. In the related technical scheme, it is determined that network resources to be pushed are generally maintained by a plurality of index lists, for example, a user has fan and friends in relationship, and if the user has read and unread states, four index lists are needed for maintenance. The problem with maintaining multiple index lists simultaneously is that:
1. when the user relationship changes, the list needs to be migrated, for example, a fan becomes a friend or a friend falls into a fan, and the list needs to be migrated between the friend and fan state list;
2. when the read state of the network resource is changed to be a category which needs to be migrated, for example, the network resource is changed from an unread state to a read state, or a user issues a new work, the state of the network resource of the user is changed from a read state to an unread state, and the network resource needs to be migrated between a read state list and an unread state list;
3. if the aforementioned 1 and 2 changes occur simultaneously, the list migration caused by the change of both states must also be considered simultaneously.
However, as can be seen from the foregoing points 1 to 3, the maintenance cost and the development complexity of each index list are high.
4. The consumption of the client for the avatar list is in the form of page turning, for example, concerning works published within 24 hours by hundreds of users, the client needs to page in the form of feed stream to view more user avatars in a more loading manner. This process of loading more is also complicated if switching between lists, and it is necessary to record which index list the page is turned to now in the page turning information, and if the critical state of switching the index list is reached, to request the index data of another list again. Either development complexity or performance and storage overhead is a relatively costly implementation.
Therefore, in view of the above, a new method is needed to solve the above problems.
Disclosure of Invention
The present disclosure is directed to a method and an apparatus for determining a resource to be pushed, so as to solve at least one of the problems described above.
In a first aspect, the present disclosure provides a method for determining a resource to be pushed, where the method includes:
acquiring a binary bit sequence of the network resource; the binary bit sequence comprises a classification identification bit and a time identification bit, wherein the classification identification bit represents the category to which the network resource belongs, and the time identification bit represents the release time of the network resource;
and determining the network resource to be pushed according to the classification identification bit and the time identification bit contained in the binary bit sequence.
In one embodiment, the values of the classification identification bits correspond to the categories of the network resources one to one; wherein each category has a different recommendation priority; in addition, the value of the recommended priority and the value of the classification identification bit accord with a linear correlation relationship; the linear correlation comprises a positive correlation or a negative correlation;
the value of the time identification bit corresponds to the release time of the network resource one by one; the value size of the time identification bit and the release time of the network resource accord with the linear correlation relationship;
determining the network resource to be pushed according to the classification identification bit and the time identification bit contained in the binary bit sequence, wherein the method comprises the following steps:
and determining the network resource to be pushed according to the value of the binary bit sequence of the network resource.
In one embodiment, the method further comprises:
aiming at each network resource, when the category of the network resource changes, acquiring the category of the changed network resource;
the value of the class identifier bit in the binary bit sequence of the network resource is configured to a value corresponding to the changed class.
In an embodiment, when the recommended priority and the value of the classification flag conform to a positive correlation, and the value of the time flag and the issue time of the network resource conform to the positive correlation, before the obtaining of the binary bit sequence of the network resource, the method further includes:
receiving a page turning request of a client; the page turning request carries the maximum value of the binary bit sequence of the network resource to be pushed in the next page after page turning;
determining the network resource to be pushed according to the classification identification bit and the time identification bit contained in the binary bit sequence, wherein the method comprises the following steps:
and determining the network resource of which the value of the binary bit sequence is less than or equal to the maximum value as the network resource to be pushed according to the values of the classification identification bits and the time identification bits contained in the binary bit sequence.
In one embodiment, before determining the network resource to be pushed according to the classification identification bit and the time identification bit contained in the binary bit sequence, the method further includes:
filtering out network resources to be pushed which do not meet the conditions according to the value of the binary bit sequence; the conditions include a type of the network resource and a release time of the network resource.
In one embodiment, after determining the network resource to be pushed according to the classification identification bit and the time identification bit contained in the binary bit sequence, the method further comprises:
filtering out network resources to be pushed which do not meet the conditions according to the value of the binary bit sequence; the condition comprises the type of the network resource and the release time of the network resource;
and pushing the rest network resources to be pushed to the client.
In one embodiment, when the recommended priority and the value of the classification flag conform to the positive correlation, and the value of the time flag and the distribution time of the network resource conform to the positive correlation, the filtering out the network resource that does not conform to the condition according to the value of the binary bit sequence includes:
acquiring current time;
determining a minimum time boundary value of the network resource to be pushed according to the current time;
and filtering out the network resources to be pushed, wherein the value of the time identification bits is smaller than the minimum time boundary value.
In a second aspect, the present disclosure provides an apparatus for determining a resource to be pushed, the apparatus comprising:
an acquisition module configured to acquire a binary bit sequence of a network resource; the binary bit sequence comprises a classification identification bit and a time identification bit, wherein the value of the classification identification bit represents the category of the network resource, and the value of the time identification bit represents the release time of the network resource;
and the determining module is configured to determine the network resource to be pushed according to the classification identification bit and the time identification bit contained in the binary bit sequence.
In one embodiment, the values of the classification identification bits correspond to the categories of the network resources one to one; wherein each category has a different recommendation priority; in addition, the value of the recommended priority and the value of the classification identification bit accord with a linear correlation relationship; the linear correlation comprises a positive correlation or a negative correlation;
the value of the time identification bit corresponds to the release time of the network resource one by one; the value size of the time identification bit and the release time of the network resource accord with the linear correlation relationship;
the determining module is configured to determine the network resource to be pushed according to the value of the binary bit sequence of the network resource.
In one embodiment, the apparatus further comprises:
the acquisition type module is configured to acquire the changed type of the network resource when the type of the network resource changes for each network resource;
a configuration module configured to configure a value of a classification identification bit in a binary bit sequence of the network resource to a value corresponding to the changed class.
In an embodiment, before the obtaining the binary bit sequence of the network resource, when the recommended priority and the value of the classification flag conform to a positive correlation, and the value of the time flag and the issue time of the network resource conform to the positive correlation, the apparatus further includes:
the receiving module is configured to receive a page turning request of a client; the page turning request carries the maximum value of the binary bit sequence of the network resource to be pushed in the next page after page turning;
and the determining module is configured to determine, according to values of the classification identification bits and the time identification bits included in the binary bit sequence, that the network resource of which the value of the binary bit sequence is smaller than or equal to the maximum value is the network resource to be pushed.
In one embodiment, before determining the network resource to be pushed according to the classification identification bit and the time identification bit contained in the binary bit sequence, the apparatus further includes:
the first filtering module is configured to filter out network resources to be pushed which do not meet the conditions according to the value of the binary bit sequence; the conditions include a type of the network resource and a release time of the network resource. In one embodiment, after determining the network resource to be pushed according to the classification identification bit and the time identification bit contained in the binary bit sequence, the apparatus further includes:
the second filtering module is configured to filter out network resources to be pushed which do not meet the conditions according to the value of the binary bit sequence; the conditions comprise the type of the network resource and the release time of the network resource;
and the pushing module is configured to push the remaining network resources to be pushed to the client.
In an embodiment, when the recommended priority and the value of the classification flag conform to a forward linear correlation, and the value of the time flag and the release time of the network resource conform to the forward linear correlation, the first filtering module or the second filtering module is configured to obtain the current time, determine a minimum time boundary value of the network resource to be pushed according to the current time, and filter out the network resource to be pushed whose value of the time flag is smaller than the minimum time boundary value.
According to a third aspect of the embodiments of the present disclosure, there is provided an electronic apparatus including:
a processor;
a memory for storing the processor-executable instructions;
wherein the processor is configured to execute the instructions to implement the method of the first aspect.
According to a fourth aspect of embodiments of the present disclosure, there is provided a computer storage medium having stored thereon computer-executable instructions for performing the method of the first aspect.
The technical scheme provided by the embodiment of the disclosure at least brings the following beneficial effects:
the disclosure provides a method, a device, equipment and a storage medium for determining resources to be pushed. The method comprises the following steps: acquiring a binary bit sequence of the network resource; the binary bit sequence comprises a classification identification bit and a time identification bit, wherein the value of the classification identification bit represents the category of the network resource, and the value of the time identification bit represents the time for issuing the network resource; and determining the network resource to be pushed according to the classification identification bit and the time identification bit contained in the binary bit sequence. In the related art, as described in the background art, it is determined that resources to be pushed are generally maintained by multiple index lists, and changes in the states of the resources to be pushed cause changes and transitions between the index lists, and if a client performs page turning and loads more resources, the process of loading more resources requires mutual transition between the multiple lists, so that development complexity, performance and storage overhead are relatively consumed. According to the method and the device, the network resources to be pushed can be determined according to the classification identification bits and the time identification bits. Switching among a plurality of index lists is not needed, so that the development complexity and the maintenance cost are reduced.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and, together with the description, serve to explain the principles of the disclosure and are not to be construed as limiting the disclosure.
FIG. 1 is a schematic diagram of a suitable scenario in accordance with an embodiment of the present disclosure;
fig. 2 is a schematic flow chart of resource determination to be pushed according to an embodiment of the present disclosure;
fig. 3 is a schematic flow chart of resource determination to be pushed according to an embodiment of the present disclosure;
fig. 4 is a schematic diagram of an apparatus for determining resources to be pushed according to an embodiment of the present disclosure;
fig. 5 is a schematic structural diagram of a computer device according to one embodiment of the present disclosure.
Detailed Description
To further illustrate the technical solutions provided by the embodiments of the present disclosure, the following detailed description is made with reference to the accompanying drawings and the specific embodiments. Although the disclosed embodiments provide method steps as shown in the following embodiments or figures, more or fewer steps may be included in the methods based on conventional or non-inventive labor. In steps where no necessary causal relationship logically exists, the order of execution of the steps is not limited to that provided by the embodiments of the present disclosure. The method can be executed in the order of the embodiments or the method shown in the drawings or in parallel in the actual process or the control device.
Fig. 1 shows an application scenario for determining resources to be pushed. The application scenario includes a plurality of terminal devices 110 and a server 130, and fig. 1 illustrates three terminal devices 110 as an example, and the number of terminal devices 110 is not limited in practice. A client 120 for viewing network resource information (for example, a client for producing and browsing a short video) is installed in the terminal device 110. Client 120 and server 130 may communicate over a communication network. Terminal devices 110 are for example mobile phones, tablets and personal computers etc. The server 130 may be implemented by a single server or may be implemented by a plurality of servers. The server 130 may be implemented by a physical server or may be implemented by a virtual server.
In one possible application scenario, in order to reduce the communication delay of the resource to be pushed, the servers 130 may be deployed in different regions, or in order to balance the load, different servers 130 may serve users respectively. The plurality of servers 130 can realize the sharing of the resources to be pushed through the blockchain, and the plurality of servers 130 form a multimedia data sharing system. For example, the terminal device 110 corresponding to the user a is located at the point a and is in communication connection with the server 130, and the terminal devices 110 corresponding to the users C and B are located at the point B and are in communication connection with other servers 130.
Each server 130 in the network resource sharing system has a node identifier corresponding to the server 130, and each server 130 in the network resource sharing system may store node identifiers of other servers in the data sharing system, so that the generated blocks are broadcast to other servers 130 in the network resource sharing system according to the node identifiers of other servers 130.
In the related art, as described in the background art, it is determined that resources to be pushed are generally maintained by multiple index lists, and changes in the states of the resources to be pushed cause changes and transitions between the index lists, and if a client performs page turning and loads more resources, the process of loading more resources requires mutual transition between the multiple lists, so that development complexity, performance and storage overhead are relatively consumed.
In view of this, the present disclosure provides a method for determining a network resource to be pushed, and as shown in fig. 2, a flow chart of the method is schematically illustrated, which may include the following steps:
step 201: acquiring a binary bit sequence of the network resource, wherein the binary bit sequence comprises a classification identification bit and a time identification bit, the value of the classification identification bit represents the category to which the network resource belongs, and the value of the time identification bit represents the time for issuing the network resource.
For example, in the binary bit sequence of the network resource, data with a size of 64 bits can be stored, two bits are occupied at the high order, for example, the 47 th and 48 th bits are used as the classification flag bits, the remaining low order bits are used as the time flag bits, the remaining high order bits of 49 th to 64 th bits can be used as the reserved bits, and when only 48 bits are adopted, the reserved bits can be all 0 or all 1. Two bits (i.e., bits 47 and 48) of the class identification bits can represent 4 categories: "11" indicates "the friend has unread work", "10" indicates "the fan has unread work", "01" indicates "the friend and has read all", "00" indicates "the fan and has read all". Thus, regardless of the size of the 0-46 bit values, the logical order of the four states is guaranteed by the two high order bits (i.e., the class identifier bits). For example, if a and B are in a friend relationship, user a and user B are both in the friend list of each other, and if user B is the fan of user a, user a is in the friend list of user B, but user B is not in the friend list of user a. That is, the embodiment is equivalent to that four logical partitions composed of the classification identification bits are logically divided in the same physical index sequence: the "11" partition, the "10" partition, the "01" partition, and the "00" partition.
For the sake of more intuitive explanation, an example of an ordered index list (for the convenience of understanding, this example will be referred to as example a hereinafter) is given, and for the sake of simplicity, this is explained by using a six-bit binary bit sequence in example a), and includes the following binary bit sequences of 8 network resources:
(110011, 110010,110001, 110000), (100011, 100001), (010010), (000011), wherein, the symbol "," a sequence of binary bits for separating two network resources, included in the same "()" bracket is a sequence of binary bits of network resources belonging to the same category, it is to be noted that the symbol "," and "()" are only used for illustrating the embodiment of the present disclosure, and are not used for limiting the embodiment of the present disclosure. That is, in implementation, the symbols "," and "()" may not be used, as long as different network resources can be distinguished.
In practice, the leftmost two bits of the 6-bit bits can be used as the classification flag bits, and the other four bits can be used as the time flag bits of 0-46 bits equivalent to 64-bit bits.
Step 202: and determining the network resource to be pushed according to the classification identification bit and the time identification bit contained in the binary bit sequence.
Therefore, after the binary bit sequence of the network resource is obtained, the network resource to be pushed is determined according to the classification identification bit and the time identification bit in the binary bit sequence. As described in the background, determining that resources to be pushed are generally maintained by a plurality of index lists, and a change in each state of the resources to be pushed causes a change migration between the index lists, so that development complexity or performance and storage overhead is relatively consumed. By adopting the scheme provided by the embodiment of the disclosure, the invention can maintain a plurality of states only by one index list (the index category has a binary bit sequence), determine the resource to be pushed and does not need to switch and maintain among a plurality of index lists, thereby reducing the development complexity and the maintenance cost.
In one embodiment, when the classification of the network resources has a push priority, in the embodiment of the present disclosure, in order to facilitate sorting of a push sequence of the network resources according to categories, values of the classification flag bits correspond to the categories of the network resources one to one, where each category has a different recommendation priority, and the values of the recommendation priority and the classification flag bits conform to a linear correlation relationship, where the linear correlation relationship includes a positive correlation or a negative correlation, and certainly, in order to facilitate determination of the network resources to be pushed according to a binary bit sequence, the values of the time flag bits correspond to release times of the network resources one to one; the value of the time identification bit and the release time of the network resource conform to the linear correlation relationship, that is, the values of the classification identification bit and the time identification bit and the recommended priority are in the same linear relationship. For example: keeping the forward linear correlation relationship between the recommendation priority and the classification identification bit consistent, wherein 0-46 bits are used for storing the latest work release time of the user, so that under the condition that 47 bits and 48 bits are the same, the size of 0-46 bits determines the sequence in the recommendation list, namely the latest work release time of the user is arranged from large to small, namely the larger the release time of the network resource to be pushed is, the closer the current time is, namely the shorter the release time of the network resource is; the smaller the release time of the network resource to be pushed is, the longer the release time of the network resource is from the current time, that is, the longer the release time of the network resource is. In the above example a, the last four bits correspond to the issue time of the network resource, and it can be seen that the inside of each partition (i.e. the time flag) is also sorted from large to small according to time.
When the value of the time identifier and the issue time of the network resource conform to a negative correlation relationship, the larger the issue time of the network resource is, the smaller the value of the time identifier is.
In the recommendation sorting, if the recommendation priority of the category is higher than the recommendation priority of the release time, in an embodiment, the categories may be sorted according to the recommendation priority of the category first, and then sorted according to the release time. The following description will be given by taking the value of the classification flag and the recommended priority of the category as a positive correlation. For example: in the binary bit sequence of eight network resources in example a, the recommended priority of the partition of the second category "10" is lower than the recommended priority of the partition of the first category, i.e., "11". Then the issue time is updated (i.e., the issue time of the network resource is shorter) even if the last four bits "0011" in data 100011 of the "10" partition are larger than the last four bits of the 110010,110001,110000 data of the "11" partition, but it is ranked behind all the data of the "11" partition because it belongs to the "10" partition. That is, the final recommendation ranks 110010,110001,110000,100011.
Similarly, the linear relationship of the negative correlation may also be classified such that the recommended priority is higher than the priority of the release time, and the difference between the positive correlation and the positive correlation is that the positive correlation is sorted from large to small according to the value, and the negative correlation is sorted from small to large, so that the description of the negative correlation is omitted here.
By the embodiment of the disclosure, when determining the network resource to be pushed, the recommended sequence of the network resource can be determined according to the value of the binary bit sequence of the network resource, and then which network resource to be pushed is finally determined, and it is not necessary to determine which network resource to be pushed by performing state transition and switching among a plurality of index lists as in the background art.
In an embodiment, as described in the background art, in a scenario where a network resource to be pushed is obtained by page turning, the embodiment of the present disclosure may be implemented such that, when a value of a recommended priority and a value of a classification flag conform to a positive correlation, and a value of a time flag and an issue time of the network resource also conform to the positive correlation, a server receives a page turning request from a client, where the page turning request carries a maximum value of a binary sequence of the network resource to be pushed in a next page after page turning, and then determines, according to the classification flag and the value of the time flag included in the binary sequence, that a network resource whose value of the binary sequence is less than or equal to the maximum value is the network resource to be pushed. Therefore, when the page is turned, the value upper limit of the binary bit sequence in the next page to be turned can be determined by taking the maximum value as a reference according to the page turning request, so that the content of the previous page is prevented from being repeatedly displayed during page turning, and the network resources to be recommended in the next page to be turned can also be accurately determined by taking the maximum value as the value upper limit. In addition, the network resource to be pushed can be determined according to the maximum value of the binary sequence without judging which index list the network resource to be pushed belongs to, so that switching among the lists is avoided.
In one embodiment, the maintenance of the binary bit sequence may also be simple and easy, for example, for each network resource, when the category to which the network resource belongs changes, the changed category of the network resource is obtained, and the value of the classification flag bit in the binary bit sequence of the network resource is configured to be the value corresponding to the changed category. For example: according to the binary bit sequence of the eight network resources in the example A, the state of '11' is changed into the state of '01', and the two bits of 47 and 48 are modified to be changed from '11' to '01'. And then updating the binary bit sequence, and then determining the network resource to be pushed according to the updated binary bit sequence when recommending. Therefore, when the category of the network resource changes, the index list to which the network resource is transferred is not considered at all, and only the value of the corresponding classification identification bit in the binary bit sequence needs to be changed, so that the development and maintenance complexity is reduced.
Of course, when the network resource to be pushed is conditionally restricted, filtering of the network resource may be implemented based on the binary bit sequence.
The filtering execution time can comprise the following two modes:
mode 1: before step 202, filtering out network resources to be pushed which do not meet the conditions according to the value of the binary bit sequence; the conditions include the type of the network resource and the issue time of the network resource, for example, the binary bit sequence (110011, 110010,110001, 110000), (100011, 100001), (010010), (000011) of 8 network resources in example a, assuming that the last four bit values less than or equal to "0010" are all non-conforming, the network resources corresponding to the non-conforming binary bit sequence values of 110010,110001,110000,100001,010010 are filtered out first, and the network resources corresponding to the remaining binary bit sequence values of 110011,100011,000011 are determined according to the value size of the binary bit sequence.
Mode 2: after step 202, filtering out network resources to be pushed which do not meet the conditions according to the value of the binary bit sequence; the conditions include a type of the network resource and a release time of the network resource. And pushing the rest network resources to be pushed to the client.
Therefore, through the filtering conditions, the network resource content provider or the user using the network resources can configure the filtering conditions according to the requirements of the user, so that the network resources can be pushed in combination with the actual requirements.
In one embodiment, when the recommended priority and the value of the classification flag conform to a positive correlation, and the value of the time flag and the distribution time of the network resource conform to the positive correlation, the network resource that does not conform to the condition is filtered, and the method includes the steps of:
(1) Acquiring current time;
(2) Determining a minimum time boundary value of the network resource to be pushed according to the current time;
(3) And filtering out the network resources to be pushed, wherein the value of the time identification bit is smaller than the minimum time boundary value.
For example: if the distribution time length of the network resource to be pushed exceeds 24 hours, it can be determined that the filtered time value before 24 hours is calculated according to the current time in the page turning loading process (i.e. the current time minus 24 hours), the minimum time boundary value of the network resource to be pushed can be determined by the value, and when the value of the binary bit sequence of page turning exceeds the minimum time boundary value, the network resource to be pushed is filtered, for example, the maximum boundary values of four partitions in example a are respectively: "111111", "101111", "011111", "001111", and assuming that the last four bit values less than or equal to "0010" are all values that have been issued for a period of time that exceeds 24 hours, the minimum time boundary values for the four partitions are: "110011", "100011", "010011", "000011", so the binary sequence of the network resource whose respective partition satisfies the condition takes the following values: [111111,110011] [101111,100011] [011111,010011] [001111,000011], then the effect after hiding the outdated data of the four partitions: (110011), (100011), (), (000011), it can be seen that all the data of partition "01" is expired. When 2 pieces of data less than or equal to the maximum boundary data are obtained by page turning the maximum boundary value "011111" of the "01" partition, the binary bit sequence of the "010010" network resource, which actually obtains the two network resources of 010010 and 000011, can be found in the business logic and filtered out, and only 000011 is reserved.
Therefore, the network resources to be pushed which do not meet the conditions can be filtered according to the minimum boundary value of the network resources to be pushed.
Similarly, the linear relationship of the negative correlation may also determine the network resource to be pushed according to the minimum boundary value, and the difference from the positive correlation lies in that the positive correlation is that the larger the value of the binary bit sequence is, the higher the recommendation priority is, and the negative correlation is that the smaller the value of the binary bit sequence is, the higher the recommendation priority is, that is, the smaller the value of the time identifier is, the shorter the issued time is from the current time, for example, the minimum time boundary value may be determined according to the reciprocal of the current time during the negative correlation, and the network resource to be pushed whose time identifier is greater than the minimum boundary value is filtered. Therefore, the negative correlation case will not be described in detail herein.
As shown in fig. 3, in order to facilitate systematic understanding of the technical method provided by the embodiment of the present disclosure, fig. 3 is a flowchart of the method for determining resources to be pushed, and it should be noted that the following steps are specifically included when the value size of the time flag and the issue time of the network resource conform to the forward linear correlation relationship according to the recommendation priority and the value size of the classification flag conform to the forward linear correlation relationship:
in this example, it is assumed that only 10 user avatars are reserved in each page of the attention page, and each user avatar corresponds to one newly released network resource.
Step 301: and the client sends a request for entering the attention page to the server.
Step 302: the server receives the request and obtains the binary bit sequence of all network resources.
Step 303: and determining a minimum time boundary value of the network resource to be pushed according to the current time, and filtering the network resource to be pushed of which the value of the time identification bit is smaller than the minimum time boundary value.
Step 304: and determining the network resources with the value arranged in the first ten according to the value size of the binary bit sequence and recommending the remaining network resources to be pushed to the client.
Step 305: and the client displays the user head portraits of the users corresponding to the top ten network resources.
Step 306: and the client sends a page turning request to the server after detecting the page turning operation of the user.
Step 307: and the server receives a page turning request, wherein the page turning request carries the maximum value of the binary bit sequence of the network resource to be pushed.
For example, the terminal determines the value of the binary bit sequence of the 10 th bit, and then the value is determined as the maximum value of the binary bit sequence of the network resource to be pushed carried in the page turning request.
Step 308: the server side determines the network resource to be pushed which is larger than the maximum value according to the maximum value of the binary bit sequence of the network resource to be pushed, determines the minimum time boundary value of the network resource to be pushed according to the current time, filters the network resource to be pushed which is smaller than the minimum time boundary value, and determines the network resource ranked in the top ten according to the value size of the binary bit sequence and recommends the network resource to the client side.
It should be noted that, the server determines the minimum boundary value of the network resource to be pushed according to the current time, and may be before the step of determining the network resource to be pushed with the maximum value according to the maximum value of the binary bit sequence of the network resource to be pushed by the server, or after the step, the sequence thereof is not limited.
Based on the same inventive concept, the method for determining the network resource to be pushed disclosed above may also be implemented by a device for determining the network resource to be pushed. The effect of the device is similar to that of the method, and is not repeated herein.
Fig. 4 is a schematic structural diagram of a device for determining network resources to be pushed according to an embodiment of the present disclosure.
As shown in fig. 4, the apparatus 400 for determining a to-be-pushed network resource of the present disclosure may include an obtaining module 401 and a determining module 402.
An obtaining module 401 configured to obtain a binary bit sequence of a network resource; the binary bit sequence comprises a classification identification bit and a time identification bit, wherein the value of the classification identification bit represents the category of the network resource, and the value of the time identification bit represents the release time of the network resource;
a determining module 402 configured to determine the network resource to be pushed according to the classification identification bit and the time identification bit contained in the binary bit sequence.
In one embodiment, the values of the classification identification bits correspond to the categories of the network resources one to one; wherein each category has a different recommendation priority; moreover, the value of the recommended priority and the value of the classification identification bit accord with a linear correlation relationship; the linear correlation comprises a positive correlation or a negative correlation;
the value of the time identification bit corresponds to the release time of the network resource one by one; the value size of the time identification bit and the release time of the network resource accord with the linear correlation relationship;
the determining module 401 is configured to determine the network resource to be pushed according to the value of the binary bit sequence of the network resource.
In one embodiment, the apparatus further comprises:
an obtaining category module 403, configured to, for each network resource, obtain a category of the network resource after change when the category of the network resource changes;
a configuration module 404 configured to configure a value of the class identifier bit in the binary bit sequence of the network resource to a value corresponding to the changed class.
In an embodiment, when the recommended priority and the value of the classification flag conform to a positive correlation, and the value of the time flag and the distribution time of the network resource conform to the positive correlation, before the binary bit sequence of the network resource is obtained, the apparatus further includes:
a receiving module 405 configured to receive a page turning request of a client; the page turning request carries the maximum value of the binary bit sequence of the network resource to be pushed in the next page after page turning;
the determining module 401 is configured to determine, according to values of the classification flag and the time flag included in the binary bit sequence, a network resource whose value of the binary bit sequence is smaller than or equal to the maximum value is a network resource to be pushed.
In one embodiment, before determining the network resource to be pushed according to the classification identification bit and the time identification bit contained in the binary bit sequence, the apparatus further includes:
the first filtering module 406 is configured to filter out network resources to be pushed that do not meet the condition according to the value of the binary bit sequence; the conditions include a type of the network resource and a release time of the network resource. In one embodiment, after determining the network resource to be pushed according to the classification identification bit and the time identification bit contained in the binary bit sequence, the apparatus further includes:
the second filtering module 407 is configured to filter out network resources to be pushed that do not meet the condition according to the value of the binary bit sequence; the condition comprises the type of the network resource and the release time of the network resource;
and a pushing module 408 configured to push the remaining network resources to be pushed to the client.
In an embodiment, when the recommended priority and the value of the classification flag conform to a forward linear correlation, and the value of the time flag and the release time of the network resource conform to the forward linear correlation, the first filtering module 406 or the second filtering module 407 is configured to obtain the current time, determine a minimum time boundary value of the network resource to be pushed according to the current time, and filter out the network resource to be pushed whose value of the time flag is smaller than the minimum time boundary value.
Having described the method and apparatus for determining resources to be pushed according to exemplary embodiments of the present disclosure, a computing device according to another exemplary embodiment of the present disclosure is described next.
As will be appreciated by one skilled in the art, aspects of the present disclosure may be embodied as a system, method or program product. Accordingly, various aspects of the present disclosure may be embodied in the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.) or an embodiment combining hardware and software aspects that may all generally be referred to herein as a "circuit," module "or" system.
In some possible implementations, a computing device according to the present disclosure may include at least one processor, and at least one memory. Wherein the memory stores program code which, when executed by the processor, causes the processor to perform the steps of the method for determining resources to be pushed according to various exemplary embodiments of the present disclosure described above in this specification. For example, the processor may perform steps 201-202 as shown in FIG. 2.
The computing device 130 according to this embodiment of the disclosure is described below with reference to fig. 5. The computing device 130 shown in fig. 5 is only one example and should not impose any limitations on the functionality or scope of use of embodiments of the disclosure.
As shown in FIG. 5, computing device 130 is embodied in the form of a general purpose computing device. Components of computing device 130 may include, but are not limited to: the at least one processor 131, the at least one memory 132, and a bus 133 that couples various system components including the memory 132 and the processor 131.
The memory 132 may include readable media in the form of volatile memory, such as Random Access Memory (RAM) 1321 and/or cache memory 1322, and may further include Read Only Memory (ROM) 1323.
In some possible embodiments, various aspects of the determination method of resources to be pushed provided by the present disclosure may also be implemented in the form of a program product including program code for causing a computer device to perform the steps in a method of training a recognition model according to various exemplary embodiments of the present disclosure described above in this specification when the program product is run on the computer device, for example, the computer device may perform the steps 201-202 as shown in fig. 2.
The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
The program product for determination of resources to be pushed of embodiments of the present disclosure may employ a portable compact disk read-only memory (CD-ROM) and include program code, and may be run on a computing device. However, the program product of the present disclosure is not limited thereto, and in this document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A readable signal medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations for the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In situations involving remote computing devices, the remote computing devices may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to external computing devices (e.g., through the internet using an internet service provider).
It should be noted that although several modules of the apparatus are mentioned in the above detailed description, such division is merely exemplary and not mandatory. Indeed, the features and functionality of two or more of the modules described above may be embodied in one module, in accordance with embodiments of the present disclosure. Conversely, the features and functions of one module described above may be further divided into embodiments by a plurality of modules.
Further, while the operations of the disclosed methods are depicted in the drawings in a particular order, this does not require or imply that these operations must be performed in this particular order, or that all of the illustrated operations must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions.
As will be appreciated by one skilled in the art, embodiments of the present disclosure may be provided as a method, system, or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and so forth) having computer-usable program code embodied therein.
The present disclosure is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to the present disclosure. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It will be apparent to those skilled in the art that various changes and modifications can be made in the present disclosure without departing from the spirit and scope of the disclosure. Thus, it is intended that the present disclosure also encompass such modifications and variations as fall within the scope of the claims and their equivalents.
Claims (11)
1. A method for determining resources to be pushed, the method comprising:
aiming at each network resource, when the category of the network resource changes, acquiring the changed category of the network resource;
configuring the value of the classification identification bit in the binary bit sequence of the network resource to a value corresponding to the changed class;
the values of the classification identification bits correspond to the categories of the network resources one by one; each category has a different recommendation priority; moreover, the value size of the recommended priority and the classification identification bit accords with a positive correlation;
the value of the time identification bit corresponds to the release time of the network resource one by one; the value size of the time identification bit and the release time of the network resource accord with a positive correlation relationship;
receiving a page turning request of a client; the page turning request carries the maximum value of the binary bit sequence of the network resource to be pushed in the next page after page turning;
acquiring a binary bit sequence of the network resource; the binary bit sequence comprises a classification identification bit and a time identification bit, wherein the classification identification bit represents the category to which the network resource belongs, and the time identification bit represents the release time of the network resource;
determining the network resource to be pushed according to the classification identification bit and the time identification bit contained in the binary bit sequence, specifically comprising:
and determining the network resource of which the value of the binary bit sequence is less than or equal to the maximum value as the network resource to be pushed according to the values of the classification identification bits and the time identification bits contained in the binary bit sequence.
2. The method according to claim 1, wherein before determining the network resource to be pushed according to the classification flag and the time flag included in the binary bit sequence, the method further comprises:
filtering out network resources to be pushed which do not meet the conditions according to the value of the binary bit sequence; the condition includes a publication time of the network resource.
3. The method according to claim 1, wherein after determining the network resource to be pushed according to the classification flag and the time flag included in the binary bit sequence, the method further comprises:
filtering out network resources to be pushed which do not meet the conditions according to the value of the binary bit sequence; the condition comprises a release time of the network resource;
and pushing the rest network resources to be pushed to the client.
4. The method according to claim 2 or 3, wherein when the value size of the time identifier and the release time of the network resource satisfy the positive correlation, the filtering out the network resource that does not satisfy the condition according to the value of the binary bit sequence includes:
acquiring current time;
determining a minimum time boundary value of the network resource to be pushed according to the current time;
and filtering out the network resources to be pushed, wherein the value of the time identification bits is smaller than the minimum time boundary value.
5. An apparatus for determining resources to be pushed, the apparatus comprising:
the acquisition type module is configured to acquire the changed type of the network resource when the type of the network resource changes for each network resource;
a configuration module configured to configure a value of a classification identification bit in a binary bit sequence of the network resource to a value corresponding to the changed class;
the values of the classification identification bits correspond to the categories of the network resources one by one; each category has a different recommendation priority; moreover, the value size of the recommended priority and the classification identification bit accords with a positive correlation;
the value of the time identification bit corresponds to the release time of the network resource one by one; the value size of the time identification bit and the release time of the network resource accord with a positive correlation;
the receiving module is configured to receive a page turning request of a client; the page turning request carries the maximum value of the binary bit sequence of the network resource to be pushed in the next page after page turning;
an acquisition module configured to acquire a sequence of binary bits of a network resource; the binary bit sequence comprises a classification identification bit and a time identification bit, wherein the classification identification bit represents the category to which the network resource belongs, and the time identification bit represents the release time of the network resource;
a determining module configured to determine a network resource to be pushed according to a classification flag and a time flag included in the binary bit sequence, and specifically configured to:
and determining the network resource of which the value of the binary bit sequence is less than or equal to the maximum value as the network resource to be pushed according to the values of the classification identification bits and the time identification bits contained in the binary bit sequence.
6. The apparatus of claim 5, wherein before determining the network resource to be pushed according to the classification flag and the time flag included in the binary bit sequence, the apparatus further comprises:
the first filtering module is configured to filter out network resources to be pushed which do not meet the conditions according to the value of the binary bit sequence; the condition includes a publication time of the network resource.
7. The apparatus of claim 5, wherein after determining the network resource to be pushed according to the classification flag and the time flag included in the binary bit sequence, the apparatus further comprises:
the second filtering module is configured to filter out network resources to be pushed which do not meet the conditions according to the value of the binary bit sequence; the condition comprises a release time of the network resource;
and the pushing module is configured to push the remaining network resources to be pushed to the client.
8. The apparatus according to claim 6, wherein when the value of the time identifier and the release time of the network resource are in accordance with the positive correlation;
the first filtering module is configured to acquire current time, determine a minimum time boundary value of the network resource to be pushed according to the current time, and filter out the network resource to be pushed of which the value of the time identification bit is smaller than the minimum time boundary value.
9. The apparatus according to claim 7, wherein when the value of the time identifier and the release time of the network resource conform to the positive correlation;
the second filtering module is configured to acquire current time, determine a minimum time boundary value of the network resource to be pushed according to the current time, and filter out the network resource to be pushed of which the value of the time identification bit is smaller than the minimum time boundary value.
10. An electronic device, comprising:
a processor;
a memory for storing the processor-executable instructions;
wherein the processor is configured to execute the instructions to implement the method of determining resources to be pushed according to any of claims 1-4.
11. A computer storage medium storing computer-executable instructions, the computer-executable instructions configured to perform the method for determining resources to be pushed according to any one of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910995634.8A CN110795667B (en) | 2019-10-18 | 2019-10-18 | Method, device, equipment and storage medium for determining resources to be pushed |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910995634.8A CN110795667B (en) | 2019-10-18 | 2019-10-18 | Method, device, equipment and storage medium for determining resources to be pushed |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110795667A CN110795667A (en) | 2020-02-14 |
| CN110795667B true CN110795667B (en) | 2023-02-28 |
Family
ID=69440409
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910995634.8A Active CN110795667B (en) | 2019-10-18 | 2019-10-18 | Method, device, equipment and storage medium for determining resources to be pushed |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110795667B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102685026A (en) * | 2011-03-11 | 2012-09-19 | 北京千橡网景科技发展有限公司 | Method and device for user to reduce possibility of missing friend trends |
| CN105550346A (en) * | 2015-12-25 | 2016-05-04 | 北京奇虎科技有限公司 | Information management method and device |
| CN107818166A (en) * | 2017-11-07 | 2018-03-20 | 暴风集团股份有限公司 | A kind of information recommends method, apparatus, server and system |
| CN109067897A (en) * | 2018-08-24 | 2018-12-21 | 优视科技新加坡有限公司 | Information push method and its device, equipment/terminal/server, computer-readable medium |
| CN109753607A (en) * | 2019-01-08 | 2019-05-14 | 北京俩俩科技有限公司 | A kind of method and system displaying user information stream |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9621600B2 (en) * | 2013-02-26 | 2017-04-11 | PortAura Group | Method and system for providing recommendations using location information |
| CN109728997A (en) * | 2018-12-06 | 2019-05-07 | 珠海格力电器股份有限公司 | The sort method of information push, system, calculates equipment and medium at device |
| CN110275723A (en) * | 2019-06-25 | 2019-09-24 | 北京字节跳动网络技术有限公司 | Obtain method, apparatus, electronic equipment and the readable medium of resource |
-
2019
- 2019-10-18 CN CN201910995634.8A patent/CN110795667B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102685026A (en) * | 2011-03-11 | 2012-09-19 | 北京千橡网景科技发展有限公司 | Method and device for user to reduce possibility of missing friend trends |
| CN105550346A (en) * | 2015-12-25 | 2016-05-04 | 北京奇虎科技有限公司 | Information management method and device |
| CN107818166A (en) * | 2017-11-07 | 2018-03-20 | 暴风集团股份有限公司 | A kind of information recommends method, apparatus, server and system |
| CN109067897A (en) * | 2018-08-24 | 2018-12-21 | 优视科技新加坡有限公司 | Information push method and its device, equipment/terminal/server, computer-readable medium |
| CN109753607A (en) * | 2019-01-08 | 2019-05-14 | 北京俩俩科技有限公司 | A kind of method and system displaying user information stream |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110795667A (en) | 2020-02-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110489306A (en) | A kind of alarm threshold value determines method, apparatus, computer equipment and storage medium | |
| US9280370B2 (en) | System structure management device, system structure management method, and program | |
| CN111694646A (en) | Resource scheduling method and device, electronic equipment and computer readable storage medium | |
| CN109840142A (en) | Thread control method, device, electronic equipment and storage medium based on cloud monitoring | |
| CN109597810B (en) | Task segmentation method, device, medium and electronic equipment | |
| CN110290228B (en) | Internet protocol IP address allocation method and device | |
| CN111831752A (en) | Distributed database space arrangement method, device, equipment and storage medium | |
| US10620950B2 (en) | Message parsing in a distributed stream processing system | |
| CN113419841B (en) | Message scheduling method and device, electronic equipment and computer readable medium | |
| CN110795667B (en) | Method, device, equipment and storage medium for determining resources to be pushed | |
| CN112363815A (en) | Redis cluster processing method and device, electronic equipment and computer readable storage medium | |
| CN114070889B (en) | Configuration method, traffic forwarding device, storage medium, and program product | |
| CN111683140B (en) | Method and apparatus for distributing messages | |
| CN115793911A (en) | Data processing method and device, electronic equipment and storage medium | |
| CN114827157A (en) | Cluster task processing method, device and system, electronic equipment and readable medium | |
| CN114049065A (en) | Data processing method, device and system | |
| CN111581049A (en) | Method, device, equipment and storage medium for monitoring running state of distributed system | |
| CN112204527A (en) | Method and system for processing engineering data in a multi-engineering system environment | |
| CN113835733B (en) | Cloud application updating method and device, electronic equipment and storage medium | |
| CN112738567B (en) | Platform content processing method and device, electronic equipment and storage medium | |
| CN111144509B (en) | Method, device and computer for classifying system application programs | |
| CN115098074A (en) | Interface creating method, device, equipment, storage medium and computer program product | |
| CN115705326A (en) | Real-time data storage method and device and terminal equipment | |
| CN113515592A (en) | Text prediction method and device, electronic equipment and storage medium | |
| CN117742931A (en) | Method and device for determining big data cluster deployment scheme, clusters and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |