WO2019095416A1

WO2019095416A1 - Information pushing method and apparatus, and terminal device and storage medium

Info

Publication number: WO2019095416A1
Application number: PCT/CN2017/112539
Authority: WO
Inventors: 闫保行
Original assignee: 平安科技（深圳）有限公司
Priority date: 2017-11-16
Filing date: 2017-11-23
Publication date: 2019-05-23
Also published as: CN107749861A

Abstract

Disclosed are an information pushing method and apparatus, and a terminal device and a storage medium. The information pushing method comprises: acquiring an information generation instruction, wherein the information generation instruction comprises an information template ID and a user ID; acquiring, based on the information template ID and the user ID, information to be pushed, wherein the information to be pushed comprises a long link and information content; using a long link-to-short link algorithm to convert the long link so as to acquire a short link; acquiring target push information based on the short link and the information content; and sending the target push information to a client corresponding to the user ID. The information pushing method solves the problem of the current poor user experience of acquiring a customer resource by means of pushing information, enhances the user experience and saves on sending costs.

Description

Information push method, device, terminal device and storage medium

This patent application is based on the Chinese Patent Application No. 201711134066.X filed on November 16, 2017, entitled "Information Pushing Method, Apparatus, Terminal Equipment and Storage Medium", and requires priority.

Technical field

The present application relates to the field of communications technologies, and in particular, to an information push method, apparatus, terminal device, and storage medium.

Background technique

With the development of the information age, most of the financial institutions such as banks, securities, insurance, and other service organizations use SMS to push information to obtain customer resources (referred to as SMS recipients), and the information pushed includes information content and information links. For the method of receiving a short message, if the information link is a long link, the information pushed is too long, which exceeds the maximum number of words of the short message, so that the information may be split into two pieces of information and sent to the user, which affects the user experience. Moreover, when a piece of information is split into two pieces of information, the amount of information sent is too large, which not only increases the transmission cost, but also may cause an overload problem, causing an abnormality in the server.

Summary of the invention

The embodiment of the present application provides an information push method, device, terminal device, and storage medium to solve the problem that the information sent may be too large when there is a long link in the currently transmitted information.

In a first aspect, an embodiment of the present application provides an information pushing method, including:

Obtaining an information generating instruction, where the information generating instruction includes an information template ID and a user ID;

Obtaining to-be-push information based on the information template ID and the user ID, where the to-be-push information includes a long link and information content;

Converting the long link by using a long chain to short chain algorithm to obtain a short link;

Obtaining target push information based on the short link and the information content;

The target push information is sent to a client corresponding to the user ID.

In a second aspect, an embodiment of the present application provides an information pushing apparatus, including:

An information generating instruction module, configured to acquire an information generating instruction, where the information generating instruction includes an information template ID and User ID;

The to-be-push information acquisition module is configured to obtain information to be pushed based on the information template ID and the user ID, where the to-be-push information includes a long link and an information content;

a short link obtaining module, configured to convert the long link by using a long chain to short chain algorithm to obtain a short link;

a target push information obtaining module, configured to acquire target push information based on the short link and the information content;

The target push information sending module is configured to send the target push information to a client corresponding to the user ID.

In a third aspect, an embodiment of the present application provides a terminal device, including a memory, a processor, and computer readable instructions stored in the memory and executable on the processor, where the processor executes the computer The following steps are implemented when reading the instruction:

The target push information is sent to a client corresponding to the user ID.

In a fourth aspect, an embodiment of the present application provides a computer readable storage medium, where the computer readable storage medium stores computer readable instructions, and when the computer readable instructions are executed by a processor, the following steps are implemented:

The target push information is sent to a client corresponding to the user ID.

In the information pushing method, device, terminal device and storage medium provided by the embodiment of the present application, an information generating instruction is first acquired, where the information generating instruction includes an information template ID and a user ID, so as to acquire the user profile based on the information template ID and the user ID. Corresponding to push information, the information to be pushed includes information content and a long link. The information template is retrieved according to the instruction generated by the information, and the process does not need manual editing, which saves time and makes the information pushing more efficient. Then use the long-chain to short-chain algorithm to convert long links and get short links. Finally, the target push information is sent to the client corresponding to the user ID. When the information push method, the device, the terminal device, and the storage medium perform information push, the information is not required to be sent to the user because the link length is longer than the number of the short message limit word, which is beneficial to reducing the amount of information sent and saving the hair. Send the cost.

DRAWINGS

In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings used in the description of the embodiments of the present application will be briefly described below. It is obvious that the drawings in the following description are only some embodiments of the present application. Other drawings may also be obtained from those of ordinary skill in the art based on these drawings without the inventive labor.

FIG. 1 is a flowchart of a method for pushing information provided in Embodiment 1 of the present application.

FIG. 2 is a specific schematic diagram of step S20 of FIG. 1.

FIG. 3 is a specific schematic diagram of step S30 of FIG. 1.

FIG. 4 is a flowchart of a method for pushing information provided in Embodiment 1 of the present application.

FIG. 5 is a flowchart of a method for pushing information provided in Embodiment 1 of the present application.

FIG. 6 is a flowchart of an information pushing method provided in Embodiment 1 of the present application.

FIG. 7 is a schematic block diagram of an information pushing apparatus provided in Embodiment 2 of the present application.

FIG. 8 is a schematic diagram of a terminal device provided in Embodiment 4 of the present application.

Detailed ways

The technical solutions in the embodiments of the present application are clearly and completely described in the following with reference to the drawings in the embodiments of the present application. It is obvious that the described embodiments are a part of the embodiments of the present application, and not all of the embodiments. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments of the present application without departing from the inventive scope are the scope of the present application.

Example 1

Fig. 1 is a flow chart showing a method of pushing information in the embodiment. The information pushing method can be applied to a terminal device of a financial institution such as a bank, a securities, an insurance, or another institution, and can obtain customer resources by pushing information to a client such as a mobile phone corresponding to the client. By using the information push method to push information to the client, the problem of excessive information transmission can be effectively avoided, and the user experience is better improved. It can be understood that the terminal device includes but is not limited to the server in this embodiment. As shown in FIG. 1, the information pushing method includes the following steps:

S10: Acquire an information generation instruction, where the information generation instruction includes an information template ID and a user ID.

The information generation instruction is an instruction for the terminal device to generate information. The information template ID is an identifier for uniquely identifying the information template. The user ID is an identifier for uniquely identifying the target user, and the user ID may be the mobile phone number of the target user. The target user refers to the user corresponding to the information to be pushed. Specifically, sending different services to the target user The information template needs to be developed for different service types, and the information template is stored in the server, and each information template corresponds to an information template ID.

S20: Acquire the information to be pushed based on the information template ID and the user ID, where the information to be pushed includes long links and information content.

The information to be pushed refers to information that has not been processed before the information is pushed. The information to be pushed includes information content and at least one long link. The long link refers to the webpage address of the service corresponding to the information to be pushed, such as the webpage address corresponding to different types of loans in the bank. The information content refers to the information content of the information to be pushed for a specific service. In this embodiment, the long link and the information content in the to-be-pushed information may be obtained according to the information template ID and the user ID in the information generation instruction.

As shown in FIG. 2, in step S20, the information to be pushed is obtained based on the information template ID and the user ID, and the information to be pushed includes the long link and the information content, and specifically includes the following steps:

S21: Acquire an information template based on the information template ID.

The information template refers to a template for generating information according to a corresponding service configuration, and the information template is pre-stored in a database and associated with a unique information template ID, so as to obtain a corresponding information template based on the template ID query. In this embodiment, the information template includes but is not limited to a user information module, a link module, and an information content module. The user information module is associated with user information for populating different user information. The link module is a module for storing a web page address of a corresponding service. The information content module is a module for storing information content, that is, information content for a specific service. It can be understood that the link module and the information content module in each information template match, that is, the long link in the link module can be linked to the webpage address related to the information content in the information content module. That is, the information content module in the information template is pre-filled with the information content, and the link module pre-populates the long link.

In this embodiment, the database pre-stores information templates corresponding to different service types, and each information template corresponds to an information template ID, so that when the subsequent push information is sent to the target user, the information template ID in the information generation instruction is directly invoked accordingly. Information templates save time and increase efficiency.

S22: Acquire user information corresponding to the user ID based on the user ID.

The user information corresponding to the user ID includes, but is not limited to, the user's name, gender, mobile phone number, ID number, and the like. The user information is pre-stored in the database. When the terminal device needs to push the information, different user information may be separately retrieved from the database based on different user IDs, so that the user information is used to form the information to be pushed.

In this embodiment, the user completes the registration on the application (ie, APP) on the mobile terminal such as the mobile phone or the tablet, so that the server corresponding to the application can obtain the corresponding user identifier (ie, the user ID). The user ID (ie, the user ID) may be a user's mobile phone number or ID number, etc., which can uniquely identify the user's identity. After obtaining the information filled in by the user, the terminal uploads the user information to the server, so that the server stores the user information in a database such as MySQL and Oracle, and associates each user information with a user identifier (user ID). . Based on the user identifier (ie, user ID), the user information acquisition process is simple and convenient.

S23: Acquire the information to be pushed based on the information template and the user information.

In this embodiment, the information template obtained in step S21 carries the long link and the information content, and the user information acquired in step S22 is filled in the user information module in the information template acquired in step S21, that is, the information template can be obtained. The information is pushed such that the information to be pushed carries long links and information content. The process of obtaining the information to be pushed does not require manual intervention, saving time.

S30: Convert long links by long chain to short chain algorithm to obtain short links.

The long-chain to short-chain algorithm is an algorithm that converts long links into short links. The short link is to convert the web address corresponding to the long link to obtain a shorter web address. In step S30, the long-chain to short-chain algorithm is used to convert the long link into a short link, so as to avoid that the character string of the long-term link is too long, and the character of the push information exceeds the limit, and the information is often split into two pieces and sent to the target. The phenomenon of the user appears, thereby saving the transmission cost and contributing to the improvement of the user experience.

As shown in FIG. 3, in step S30, a long-chain to short-chain algorithm is used to convert a long link to obtain a short link, which specifically includes the following steps:

S31: splicing the long link with the preset key value to obtain the original byte string.

The original byte string is a byte string obtained by splicing a long link with a preset key value. The preset key value is a custom byte string including, but not limited to, an abbreviation of the user name or a lowercase full spell of the user name. Specifically, the splicing of the long link and the preset key value specifically refers to directly combining the long link with the preset key value, that is, adding the byte string corresponding to the long link and the byte string corresponding to the preset key value. The original byte string is obtained, and the splicing method is simple and easy to implement.

S32: Encrypt the original byte string by using an information-digest algorithm to obtain a target byte string.

The message-digest algorithm (MD) algorithm is a function of changing an arbitrarily long input information string into a fixed-length output string, and is generally used for generating information digest, key encryption, and the like. In this embodiment, the fifth version of the MD algorithm, that is, the MD5 algorithm, is adopted, and the MD5 has the characteristics of high security, so that user information is not easily leaked and user privacy is protected. The target byte string refers to converting a raw byte string having no fixed length into a fixed length (128 bit binary) byte string, that is, a target byte string, by using an information-digest algorithm.

Specifically, since MD5 processes the input information in 512-bit (ie, 512-bit binary) packets, each packet is further divided into 16 32-bit sub-packets. Therefore, in step S22, the original byte string is encrypted by using MD5 to obtain the target byte string, which specifically includes the following steps:

S321: Divide the length of the original byte string by 512 to obtain the current remainder.

S322: Determine whether the current remainder is 448.

S323: If the current remainder is not 448, determine the number of bytes to be padded based on the current remainder, and fill the original byte string with a number of 0s corresponding to the number of bytes to be padded to obtain an intermediate byte string. Then, a 64-bit binary representation padding byte (in bits) is appended to the intermediate byte string to obtain the updated intermediate byte string. The updated intermediate byte string is (N+1)*512. Is a multiple of 512. The padding byte is a fixed byte set in advance.

S324: If the current remainder is 448, the original byte string is directly used as the updated intermediate byte string without padding.

S325: Perform a four-round loop operation on the intermediate byte string to obtain a target byte string.

There are four 32-bit integer parameters called the Chaining Variable in MD5. In this embodiment, it is set to: A=0x01234567, B=0x89abcdef, C=0xfedcba98, D=0x76543210. When these four link variables are set, they begin to enter the four-round loop operation of the MD5 algorithm. The number of loops is the number of 512-bit information packets in the message, N+1 times.

Further, the operation of the four-round loop operation includes subdividing each 512 bits into 16 groups of 32 bits each; copying the above four link variables into the other four variables (a, b, c, d) , ie A to a, B to b, C to c, D to d. The main loop has four rounds, and the operation of each round is very similar. Perform 16 operations per round, perform a logical operation on each of the three variables a, b, c, and d, and then add the result to the fourth variable (a subgroup and a constant in the text) ), then four more cycles, get the new four link variables A, B, C and D, cascading them in the order of ABCD and outputting the MD5 value of the 128-bit binary (16 bytes), ie the target word Section string. Specifically, the calculation result of each operation is cyclically shifted right by 4 bits, and the next operation is performed. After each round of cycles, add A, B, C, and D to a, b, c, and d, respectively, and go to the next cycle.

Specifically, the logical operation formula of each round of logical operation is as follows: the first round of logical operation formula is F(x, y, z)=(x&y)|((~x)&z); the second round of logical operation formula is G (x, y, z)=(x&z)|(y&(~z)); The third round of logical operation formula is H(x, y, z)=x∧y∧z; the fourth round of logical operation formula is I (X, Y, Z) = y ∧ (x | (~ z)). Among them, the symbol & represents the AND operation, the symbol ~ represents the non-operation, and the symbol ∧ represents the exclusive OR operation. The AND, NAND, and XOR operations are a basic logic operation in a computer. The operation rule is: 00&0=0,0&1=0, 1&0=0, 1&1=1, that is, both bits are “1” at the same time, the result is “1”, otherwise it is 0. The operation rule for taking the non-operation is ～0=1, ～1=0; that is, the result of “0” is “1”, and the result of non-“1” is “0”. The operation rule of the exclusive OR operation is 0^0=0, 0^1=1, 1^0=1, 1^1=0; that is, the two bits are the same as “1” and the difference is “0”.

In this embodiment, the operation of the four-round loop operation can be expressed by the following formula: FF(a, b, c, d, M _j , s, ti), indicating a=b+((a+F(b,c,d) ) +M _j +ti)<<<s)); GG(a,b,c,d,M _j ,s,ti), indicating a=b+((a+G(b,c,d)+M _j + ti) <<<s); HH (a, b, c, d, M _j , s, ti), indicating a = b + ((a + H (b, c, d) + M _j + ti) <<<s);II(a,b,c,d,M _j ,s,ti), indicating a=b+((a+I(b,c,d)+M _j +ti)<<<s ). Where M _j represents the jth group of the 16 groups, "<<<s" represents the left shift of the s bit, and ti represents the constant in the ith step, which is an integer of 2 ³² *abs(sin(i)) In part, the value of i is 1-64, and the unit of i is radians. In this embodiment, in each round of the loop, the s value will be sequentially cycled according to the preset array s (the amount of displacement of the cyclic movement) in the order of the array until the end of each round of the loop. Understandably, the s array in each round is different. In the first round of the cycle, s={7,12,17,22}, in the second round, s={5,9,14,20 }, in the third round of the cycle, s={4,11,16,23}, in the fourth round of the cycle, s={6,10,15,21}. Because the security of the MD5 encryption algorithm is extremely high, the push information including the user information sent in this embodiment is more reliable, and it is not easy to disclose the user's personal information to ensure the personal interests of the user.

S33: Perform character conversion on the target byte string to obtain a target string.

Among them, the target string refers to a string that converts the target byte string (128-bit binary) into hexadecimal. Since the processing of strings in the computer is generally processing hex strings, the target byte string (that is, the MD5 value of 128-bit binary) is converted into a hexadecimal string (that is, a 32-bit target character). string.

Specifically, the process of converting the target byte string into the target string is as follows: a 16-byte (128-bit) target byte string is looped out and each byte taken is converted to obtain a hexadecimal character. Since each byte represents an 8-bit binary, it is necessary to first convert the upper four bits of each byte, then convert the lower four bits of each byte, and finally convert each byte. Character output to get the target string. The specific conversion formula for converting each byte to a hexadecimal character is hexDigits[byte0>>>4&0xf], hexDigits[byte0&0xf], the symbol >>> represents the right shift of the loop, the symbol & represents the bitwise AND operation, hexDigits[ ] (hexadecimal) is an algorithm that converts a string of bytes into a hexadecimal string. In this embodiment, the target byte string is converted into a hexadecimal target string, which can effectively avoid the garbled phenomenon of the target byte string acquired based on the MD5, thereby effectively improving the subsequent processing speed and improving efficiency.

S34: Bitwise dividing the target string to obtain an eight-digit hexadecimal number.

The bitwise division of the target character string specifically refers to dividing the target character string (32-bit hexadecimal) obtained in step S32 into equal lengths, that is, dividing the target character string into groups of eight to obtain 4 groups of string groups, Each set of string groups contains eight hexadecimal numbers, which is easy to calculate.

S35: Perform bitwise AND operation on the eight-digit hexadecimal number and the first preset value in hexadecimal to obtain the first subscript value.

The first preset value is a custom hexadecimal number. In this embodiment, the first preset value is a hexadecimal number 0x3FFFFFFF, and the four sets of eight-digit hexadecimal numbers obtained in step S34 are respectively bit-wise-operated with the first preset value, that is, 0x3FFFFFFF, because The obtained operation result is the effective length of 32 bits. Therefore, it is necessary to select the lower 30 bits of the result of the operation, that is, remove the first two bits to obtain the first subscript value. Specifically, bitwise AND operation is a basic logical operation method in a computer, and the symbol is represented as &, and its operation rule is: 00&0=0, 00&1=0, 1&0=0, 1&1=1; that is, two bits are simultaneously 1", the result is "1", otherwise it is 0.

S36: Perform a bitwise AND operation on the first subscript value and the second preset value in hexadecimal to obtain a second subscript value.

The second preset value is a custom hexadecimal number. Further, the first subscript value obtained by step S35 and the second preset value are subjected to bitwise AND operation. In this embodiment, the second preset value is a hexadecimal number 0x0000003D, and the first subscript value and the 0x0000003D are bitwise ANDed to obtain a second subscript value.

S37: Obtain a character corresponding to the second subscript value from the preset character array to form a short link.

Among them, the preset character array is a pre-defined character array containing characters for generating short links. In this embodiment, the preset character array includes but is not limited to uppercase English characters, lowercase English letters, and Arabic numerals (0 to 9). The index of the preset character array is obtained by the second subscript value obtained in step S36. Based on the index of the preset character array, the characters corresponding to the second subscript value are cyclically selected from the preset character array, and the extracted characters are added each time, and then moved to the right by 5 bits to enter the next loop. , get candidate short links. Randomly pick a short link from the candidate links to get the short links you need. Specifically, based on the index of the preset character array, the characters in the preset character array are taken out 6 times to obtain 6 characters, that is, a candidate short link is obtained, and since there are 4 loop operations in step S324, each loop is obtained. A candidate short link will eventually get 4 candidate short links. Finally, one candidate short link is randomly selected from the four candidate short links as the final short link.

Specifically, the method used to obtain the index of the preset character array by using the second subscript value obtained in step S36 is an Index function. The Index function returns a value in a table or region or a reference to a value. The Index function has two forms: an array form and a reference form. The array form usually returns a numeric value (in this embodiment, the index of the default character array is returned in numeric form) or an array of values; the reference form usually returns a reference.

Specifically, when the short link is selected in the candidate short link, the server determines whether the candidate short link is the same as the short link stored in the server, and if the candidate short link is the same as the short link stored by the server, the candidate can be directly rejected. The short link, in the candidate short links in which the remaining short links of the remaining servers are stored, a candidate short link is randomly selected as the final short link, and the process of selecting the short link can effectively avoid the problem of repetition, so that the pushed information has Uniqueness and pertinence.

S40: Acquire target push information based on short links and information content.

The short link is the short link corresponding to the long link in the information to be pushed acquired in step S30, and the information content is the information content for the specific service in the information template acquired in step S20, and the information content is filled into the information template. In the information content module, the short link is filled into the link module in the information template, that is, the target push information is acquired, and the target push information is stored in the cache server.

The cache server stores the target push information by using a buffer storage method including but not limited to the embodiment. Buffer storage is a technology that increases the speed of content access by storing network content that needs frequent access in a system that is closer to the user and faster to access. A cache server is a server that stores frequently accessed content, enabling users to access information faster and improve the user experience.

S50: Send the target push information to the client corresponding to the user ID.

The client (client) or client refers to a terminal that corresponds to the server and provides local services to the client. In this embodiment, the user ID includes but is not limited to the mobile phone number of the target user, and correspondingly, the client corresponding to the user ID is the mobile phone. That is, in step S50, the server sends the target push information acquired in step S40 to the client (ie, the mobile phone) of the user according to the mobile phone number of the user, so that the client displays the target push information.

The manner in which the server sends the target push information to the client includes, but is not limited to, a timed transmission method, which can be sent at a fixed time on a fixed date of the week, and reads the transmission time and marks the transmission time. Use the Date method to read the send time to return the date and time of the day. Understandably, each time a server sends a target push message, its sending time is marked, so that the target push information is time-series.

In this embodiment, the information generation instruction is obtained, where the information generation instruction includes an information template ID and a user ID, so as to acquire information to be pushed corresponding to the user based on the information template ID and the user ID, where the information to be pushed includes information content and Long link. The information template is retrieved according to the instruction generated by the information, and the process does not need manual editing, which saves time and makes the information pushing more efficient. Then use the long-chain to short-chain algorithm to convert long links and get short links. Finally, the target push information is periodically sent to the client corresponding to the user ID and the transmission time is acquired, so that the target push information is more sequential. When the information push method is used for information push, it is avoided that the information is segmented and sent to the user because the link length is longer than the number of the short message limit word, which is beneficial to reducing the amount of information sent and saving the transmission cost.

In a specific embodiment, as shown in FIG. 4, after step S50, the information pushing method further includes the following steps:

S61: Acquire response information sent by the client.

Specifically, when the server sends the target push information to the client corresponding to the user ID, the client automatically sends the response information to the server when receiving the target push information, so that the server knows whether the client receives the letter. Information, and based on the response information to determine whether the target push information needs to be resent to the client. In this embodiment, the server reads the current system time and records when receiving the response information, so that the response information sent by the server includes the current system time.

S62: Determine whether the current response time of the received response information exceeds a preset response time.

The preset response time is the response time originally set by the system. The current response time is the difference between the system time acquired when the server receives the response information and the system time (ie, the transmission time) for transmitting the target push information, that is, the system time acquired in step S61 and the server sending target push acquired in step S40. The difference in the current time read by the message.

S63: If the current response time exceeds the preset response time, the target push information is resent to the client corresponding to the user ID.

In this embodiment, when the server sends the target push information to the client corresponding to the user ID row, the server caches the sent target push information in the server, and records the system time (ie, the sending time) of transmitting the target push information. In order to calculate the current response time, when the current response time exceeds the preset response time or when the response information has not been received before the preset response time, the target push information of the server buffer storage is directly sent to the client, saving time and improving efficiency. .

In a specific implementation manner, in the information pushing method, after step S30 and before step S40, the method further includes the step of: marking the short link so that the short link carries the short-chain identifier. Specifically, the short link acquired in step S30 is marked, so that the short link has a mapping relationship with the corresponding long link, and the short link carrying the short chain identifier is associated with the corresponding long link and stored in the database, and is created in the database. a link information table in which a short link, a long link, a short chain identifier, and a long link content having a mapping relationship are stored, so that the database can be quickly and easily searched according to the short link to obtain a corresponding long link based on the link information table. content. In this embodiment, the long link content includes, but is not limited to, webpage content of a service type corresponding to the long link.

In this embodiment, after the step S50, the information pushing method further includes a step S70: sending the webpage content corresponding to the target pushing information to the client. As shown in FIG. 5, step S70 specifically includes the following steps:

S71: Receive an access request sent by the client, where the access request includes a short-chain identifier.

Specifically, after step S50, the client displays the target push information sent by the server, and the target push information includes a short link and the information content. When the user views the target push information through the client, the short link may be clicked to view the information. At this time, the client receives the access request input by the short link clicked by the user, and sends the access request to the server, so that the server obtains the access request sent by the client. The access request includes a short chain identifier to find a corresponding long link based on the short chain identifier.

S72: Search for the corresponding long link based on the short-chain identifier, and obtain the content of the webpage corresponding to the long link.

Specifically, the server searches for the corresponding long link in the database according to the short-chain identifier carried by the short link. The database stores therein a link information table including, but not limited to, a long link, a short link, a short chain identifier, and web content corresponding to the long link (ie, long link content). It can be understood that the short link identifier is used to find the corresponding long link, and then the corresponding web page content is found according to the long link. The process does not need to convert the short link into a long link through the conversion method, and only needs to find the corresponding directly through the short chain identifier. Long links save time and improve user experience.

S73: Send the webpage content to the client.

The webpage content refers to webpage content corresponding to the long link. The server can find the corresponding long link in the database based on the short-chain identifier, and then find the corresponding webpage content according to the long link and send it to the client. The server pre-associates the webpage content corresponding to the long link associated with the short-chain identifier, so that it is more convenient to find the corresponding webpage content through the long link.

In this embodiment, the server receives the access request sent by the client, and returns the web content of the long link corresponding to the short link to the client, and the client receives the webpage content sent by the server and displays it on the client. Among them, the content of the webpage is specifically H5 (Hypertext Markup Language, referred to as HTML5) interface, which is convenient for users to view. Hypertext Markup Language is an application under the standard universal markup language. "Hypertext" means that the page can contain images, links, and even non-text elements such as music and programs. The structure of the hypertext markup language includes a "header" portion, and a "body" portion, wherein the "header" portion provides information about the web page (ie, the title, preamble, description, etc. of the web page). The "subject" portion provides the specific content of the web page.

In a specific implementation, as shown in FIG. 6, the information pushing method further includes the following steps:

S81: The current cache time and the current cache number of the target push information cached by the statistics server.

The current cache time of the target push information refers to the time when the server caches the target push information that has been sent, which is specifically the difference between the system time of the server and the sending of the target push time (ie, the sending time). The current number of caches is the amount of all sent target push information currently cached by the server. In this embodiment, the terminal device has a script for collecting the current cache time and the current cache number, and setting the script to run periodically to automatically count the current cache time and the current cache number, so that the process does not require manual intervention and improves work efficiency. .

Specifically, the server also determines whether the current cache time exceeds a preset cache time. The preset cache time is a preset cache time of the system. The server records the sending time of the target push information every time a target push information is sent, and then determines the current cache time according to the system time of the server and the sending time, and then determines whether the current cache time exceeds the preset cache time. If the pre-defined reservation cache time is 3 months and the current cache time of the target push information is 2 months, the preset cache time is not exceeded. In this embodiment, the current cache time exceeds the preset cache time as a judgment condition for deleting the target push information of the cache, so as to reduce the number of caches and avoid caching. The amount is too large, causing the server to be abnormal.

Specifically, the server also determines whether the current number of caches exceeds a preset number of caches. The preset cache amount refers to the number of caches preset by the system. The current cache count refers to the amount of all sent target push information currently cached by the server. In this embodiment, the current cache number exceeds the preset cache number as another judgment condition for deleting the target push information of the cache, which can effectively avoid the problem that the server crashes due to the overload of the cache number.

S82: If the current cache time exceeds the preset cache time, and/or the current cache number exceeds the preset cache quantity, the target push information is deleted.

There are three cases in which the target push information is deleted in step S82. First, if the current cache time exceeds the preset cache time and the current cache number exceeds the preset cache number, the target push information is deleted. Second, if the current cache time does not exceed the preset cache time and the current cache number exceeds the preset cache number, the target push information is deleted. Third, if the current cache time exceeds the preset cache time but the current cache number does not exceed the preset cache number, the target push information is deleted.

In this embodiment, the current cache time is A, the preset cache time B, the current cache number is C, the preset cache number D, A>B=0, A<B=1, C<D=1, C> D=0. When (A>B)&&(C>D) or (A<B)&&(C>D) or (A>B)&&(C<D), the target push information is deleted to save the storage space of the server. The symbol && is a logical AND operation, and the operation rule is 0&&0=0, 0&&1=0, 1&&0=0, 1&&1=1, that is, when the operation result output is 0, the target push information needs to be deleted. Since each target push information sent by the server carries a time stamp (that is, the record has a transmission time), the target push information at the time can be deleted according to the time stamp, so as to save the storage space of the server.

In this embodiment, the information generation instruction is obtained, where the information generation instruction includes an information template ID and a user ID, so as to acquire information to be pushed corresponding to the user based on the information template ID and the user ID, where the information to be pushed includes information content and Long link. The information template is retrieved according to the information generation instruction, and the process does not need manual editing, which saves time and makes the information push more efficient. Then use the long-chain to short-chain algorithm to convert the long link and obtain the short link. When the target push information sent by the server is avoided, the information needs to be sent to the user segmentally because the link is too long. Quantity, saving on sending costs and improving user experience. Finally, the target push information is sent to the client corresponding to the user ID, and the current cache time and the current cache number are obtained, and the current cache time and the current cache number are compared with the preset cache time and the preset cache number respectively, based on The comparison result deletes the useless target push information, so as to save the storage space of the server and reduce the load of the server, thereby effectively avoiding the server crash caused by the server overload and improving the performance of the server.

It should be understood that the size of the sequence of the steps in the above embodiments does not mean that the order of execution is performed. The order of execution of each process should be determined by its function and internal logic, and should not be construed as limiting the implementation process of the embodiments of the present application.

Example 2

Fig. 7 is a block diagram showing the principle of the information pushing apparatus corresponding to the information pushing method in the first embodiment. As shown in FIG. 7, the information pushing apparatus includes an information generating instruction module 10, a to-be-pushed information acquiring module 20, a short link acquiring module 30, a target pushing information acquiring module 40, a target pushing information transmitting module 50, a short link labeling module 90, and Web content sending module 70. The information generation instruction module 10, the to-be-pushed information acquisition module 20, the short link acquisition module 30, the target push information acquisition module 40, the target push information sending module 50, the short link labeling module 90, and the webpage content sending module 70. The implementation functions are in one-to-one correspondence with the steps corresponding to the information pushing method in the embodiment. To avoid redundancy, the present embodiment is not described in detail.

The information generation instruction module 10 is configured to acquire an information generation instruction, where the information generation instruction includes an information template ID and a user ID.

The to-be-push information acquiring module 20 is configured to obtain the to-be-pushed information based on the information template ID and the user ID, and the to-be-pushed information includes a long link and an information content.

The short link obtaining module 30 is configured to convert the long link by using a long chain to short chain algorithm to obtain a short link.

The target push information obtaining module 40 is configured to acquire target push information based on the short link and the information content.

The target push information sending module 50 is configured to send the target push information to the client corresponding to the user ID.

Short link labeling module 90 for labeling short links so that short links carry short chain identifiers

The webpage content sending module 70 is configured to send the webpage content corresponding to the target push information to the client.

Preferably, the to-be-pushed information acquisition module 20 includes an information template acquisition unit 21, a user information acquisition unit 22, and a to-be-pushed information acquisition unit 23.

The information template obtaining unit 21 is configured to acquire an information template based on the information template ID.

The user information obtaining unit 22 is configured to acquire the user information corresponding to the user ID based on the user ID based on the information template ID.

The to-be-push information acquiring unit 23 is configured to obtain information to be pushed based on the information template and the user information.

Preferably, the short link acquisition module 30 includes a raw byte string acquisition unit 31, a target byte string acquisition unit 32, a target character string acquisition unit 33, an eight-digit hexadecimal number acquisition unit 34, and a first subscript value acquisition unit. 35. A second subscript value acquisition unit 36 and a short link acquisition unit 37.

The original byte string obtaining unit 31 is configured to splicing the long link with the preset key value to obtain the original byte string.

The target byte string obtaining unit 32 is configured to perform encryption processing on the original byte string by using an information-digest algorithm to obtain a target byte string.

The target string obtaining unit 33 is configured to perform character conversion on the target byte string to obtain a target character string.

The eight-digit hexadecimal number obtaining unit 34 is configured to bit-divide the target character string to obtain an eight-digit hexadecimal number.

The first subscript value obtaining unit 35 is configured to perform bitwise AND operation on the eight-digit hexadecimal number and the first preset value in hexadecimal to obtain the first subscript value.

The second subscript value obtaining unit 36 is configured to perform a bitwise AND operation on the first subscript value and the second preset value in hexadecimal to obtain a second subscript value.

The short link obtaining unit 37 is configured to obtain a character corresponding to the second subscript value from the character array to form a short link.

Preferably, the webpage content transmitting module 70 includes an access request accepting unit 71, a webpage content obtaining unit 72, and a webpage content transmitting unit 73.

The access request receiving unit 71 is configured to receive an access request sent by the client, where the access request includes a short-chain identifier.

The webpage content obtaining unit 72 is configured to search for a corresponding long link based on the short-chain identifier, and obtain webpage content corresponding to the long link.

The webpage content sending unit 73 is configured to search for a corresponding long link based on the short-chain identifier, and obtain webpage content corresponding to the long-link.

Preferably, the information pushing apparatus further includes a response information acquiring unit 61, a response time judging unit 62, and a target information resending unit 63.

The response information obtaining unit 61 is configured to obtain response information sent by the client.

The response time judging unit 62 judges whether or not the current response time of the reception response information exceeds the preset response time.

The target information resending unit 63 is configured to resend the target push information to the client corresponding to the user ID, for the current response time exceeding the preset response time.

Preferably, the information pushing device further includes a statistic unit 81 and a target push information processing unit 82.

The statistic unit 81 is configured to count the current cache time and the current cache number of the target push information cached by the server.

The target push information processing unit 82 is configured to delete the target push information when the current cache time exceeds the preset cache time, and/or the current cache number exceeds the preset cache amount.

Example 3

The embodiment provides a computer readable storage medium. The computer readable storage medium stores computer readable instructions. When the computer readable instructions are executed by the processor, the information pushing method in Embodiment 1 is implemented. Let me repeat. Alternatively, the functions of the modules/units of the information pushing apparatus in Embodiment 2 are implemented when the computer readable instructions are executed by the processor. To avoid repetition, details are not described herein again.

Example 4

FIG. 8 is a schematic diagram of a terminal device according to an embodiment of the present application. As shown in FIG. 8, the terminal device 100 of this embodiment includes a processor 101, a memory 102, and computer readable instructions 103 stored in the memory 102 and executable on the processor 101. When the processor 101 executes the computer readable instructions 103, the steps in the above embodiments of the various information pushing methods are implemented, such as steps S10 to S50 shown in FIG. Alternatively, the processor 101 implements the functions of the modules/units of the information pushing apparatus in the second embodiment described above when the computer readable instructions 103 are executed.

Illustratively, computer readable instructions 103 may be partitioned into one or more modules/units, one or more modules/units being stored in memory 102 and executed by processor 101 to complete the application. The one or more modules/units may be a series of computer readable instruction segments capable of performing a particular function for describing the execution of computer readable instructions 103 in the terminal device 100. For example, the computer readable instruction 103 may be divided into an information generation instruction module 10, a to-be-pushed information acquisition module 20, a short link acquisition module 30, a target push information acquisition module 40, and a target push information transmission module 50, as shown in FIG. The short link labeling module 90 and the webpage content sending module 70, the specific functions of each module are as described in the second embodiment, and are not described herein.

The terminal device 100 can be a computing device such as a desktop computer, a notebook, a palmtop computer, and a cloud server. The terminal device may include, but is not limited to, the processor 101 and the memory 102. It will be understood by those skilled in the art that FIG. 8 is only an example of the terminal device 100, and does not constitute a limitation of the terminal device 100, and may include more or less components than those illustrated, or combine some components or different components. For example, the terminal device may further include an input/output device, a network access device, a bus, and the like.

The processor 101 may be a central processing unit (CPU), or may be other general-purpose processors, a digital signal processor (DSP), an application specific integrated circuit (ASIC), Field-Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware components, etc. The general purpose processor may be a microprocessor or the processor or any conventional processor or the like.

The memory 102 may be an internal storage unit of the terminal device 100, such as a hard disk or a memory of the terminal device 100. The memory 102 may also be an external storage device of the terminal device 100, such as a plug-in hard disk equipped on the terminal device 100, a smart memory card (SMC), a Secure Digital (SD) card, and a flash memory card (Flash). Card) and so on. Further, the memory 102 may also include both an internal storage unit of the terminal device 100 and an external storage device. The memory 102 is used to store computer readable instructions as well as other programs and data required by the terminal device. The memory 102 can also be used to temporarily store data that has been or will be output.

It will be apparent to those skilled in the art that for the convenience and brevity of the description, only the above function lists are The division of the element and the module is exemplified. In the actual application, the function distribution may be completed by different functional units and modules according to requirements, that is, the internal structure of the device is divided into different functional units or modules to complete the above description. All or part of the function.

In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above integrated unit can be implemented in the form of hardware or in the form of a software functional unit.

The integrated modules/units, if implemented in the form of software functional units and sold or used as separate products, may be stored in a computer readable storage medium. Based on such understanding, the present application implements all or part of the processes in the foregoing embodiments, and may also be implemented by computer readable instructions, which may be stored in a computer readable storage medium. The computer readable instructions, when executed by a processor, may implement the steps of the various method embodiments described above. Wherein, the computer readable instructions comprise computer readable instruction code, which may be in the form of source code, an object code form, an executable file or some intermediate form or the like. The computer readable medium can include any entity or device capable of carrying the computer readable instruction code, a recording medium, a USB flash drive, a removable hard drive, a magnetic disk, an optical disk, a computer memory, a read only memory (ROM, Read-Only) Memory), random access memory (RAM), electrical carrier signals, telecommunications signals, and software distribution media. It should be noted that the content contained in the computer readable medium may be appropriately increased or decreased according to the requirements of legislation and patent practice in a jurisdiction, for example, in some jurisdictions, according to legislation and patent practice, computer readable media It does not include electrical carrier signals and telecommunication signals.

The above-mentioned embodiments are only used to explain the technical solutions of the present application, and are not limited thereto; although the present application has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that they can still implement the foregoing embodiments. The technical solutions described in the examples are modified or equivalently replaced with some of the technical features; and the modifications or substitutions do not deviate from the spirit and scope of the technical solutions of the embodiments of the present application, and should be included in Within the scope of protection of this application.

Claims

An information pushing method, comprising:

Obtaining an information generating instruction, where the information generating instruction includes an information template ID and a user ID;

Obtaining to-be-push information based on the information template ID and the user ID, where the to-be-push information includes a long link and information content;

Converting the long link by using a long chain to short chain algorithm to obtain a short link;

Obtaining target push information based on the short link and the information content;

The target push information is sent to a client corresponding to the user ID.
The information pushing method according to claim 1, wherein the obtaining the information to be pushed based on the information template ID and the user ID comprises:

Obtaining an information template based on the information template ID;

Obtaining user information corresponding to the user ID based on the user ID;

And obtaining information to be pushed based on the information template and the user information.
The information pushing method according to claim 1, wherein the long chain to short chain algorithm is used to convert the long link to obtain a short link, including:

Splicing the long link with a preset key value to obtain a raw byte string;

Encrypting the original byte string by using an information-summary algorithm to obtain a target byte string;

Performing character conversion on the target byte string to obtain a target character string;

Dividing the target string bit by bit to obtain an eight-digit hexadecimal number;

Performing a bitwise AND operation on the eight-digit hexadecimal number and the first preset value in hexadecimal to obtain a first subscript value;

Performing bitwise AND operation on the first subscript value and the second preset value in hexadecimal to obtain a second subscript value;

The character corresponding to the second subscript value is obtained from a preset character array to form the short link.
The information push method according to claim 1, wherein the long link to short chain algorithm is used to convert the long link to obtain a short link, and then the method further comprises: marking the short link to enable The short link carries a short chain identifier;

The sending the target push information to the client corresponding to the user ID, and further comprising: sending the webpage content corresponding to the target push information to the client;

Sending, to the client, the webpage content corresponding to the target push information, including:

Receiving an access request sent by the client, where the access request includes the short-chain identifier;

Searching for a corresponding long link based on the short-chain identifier, and acquiring webpage content corresponding to the long link;

Sending the webpage content to the client.
The information pushing method according to claim 1, wherein the transmitting the target push information to the client corresponding to the user ID, and further comprising:

Obtaining response information sent by the client;

Determining whether the current response time of receiving the response information exceeds a preset response time;

If the current response time exceeds the preset response time, the target push information is resent to the client corresponding to the user ID.
The information pushing method according to claim 1, wherein the information pushing method further comprises:

Counting a current cache time and a current cache amount of the target push information cached by the server;

If the current cache time exceeds a preset cache time, and/or the current cache number exceeds a preset cache amount, the target push information is deleted.
An information pushing device, comprising:

An information generating instruction module, configured to acquire an information generating instruction, where the information generating instruction includes an information template ID and a user ID;

The to-be-push information acquisition module is configured to obtain information to be pushed based on the information template ID and the user ID, where the to-be-push information includes a long link and an information content;

a short link obtaining module, configured to convert the long link by using a long chain to short chain algorithm to obtain a short link;

a target push information obtaining module, configured to acquire target push information based on the short link and the information content;

The target push information sending module is configured to send the target push information to a client corresponding to the user ID.
The information push method apparatus according to claim 7, further comprising:

a statistical unit, configured to count a current cache time and a current cache quantity of the target push information cached by the server;

The target push information processing unit is configured to delete the target push information when the current cache time exceeds a preset cache time, and/or the current cache number exceeds the preset cache amount.
A terminal device comprising a memory, a processor, and computer readable instructions stored in the memory and operable on the processor, wherein the processor executes the computer readable instructions as follows step:

Obtaining an information generating instruction, where the information generating instruction includes an information template ID and a user ID;

Obtaining to-be-push information based on the information template ID and the user ID, where the to-be-push information includes a long link and information content;

Converting the long link by using a long chain to short chain algorithm to obtain a short link;

Obtaining target push information based on the short link and the information content;

The target push information is sent to a client corresponding to the user ID.
The terminal device according to claim 9, wherein the obtaining the information to be pushed based on the information template ID and the user ID comprises:

Obtaining an information template based on the information template ID;

Obtaining user information corresponding to the user ID based on the user ID;

And obtaining information to be pushed based on the information template and the user information.
The terminal device according to claim 9, wherein the long chain to short chain algorithm is used to convert the long link to obtain a short link, including:

Splicing the long link with a preset key value to obtain a raw byte string;

Encrypting the original byte string by using an information-summary algorithm to obtain a target byte string;

Performing character conversion on the target byte string to obtain a target character string;

Dividing the target string bit by bit to obtain an eight-digit hexadecimal number;

Performing a bitwise AND operation on the eight-digit hexadecimal number and the first preset value in hexadecimal to obtain a first subscript value;

Performing bitwise AND operation on the first subscript value and the second preset value in hexadecimal to obtain a second subscript value;

The character corresponding to the second subscript value is obtained from a preset character array to form the short link.
The terminal device according to claim 9, wherein the long chain to short chain algorithm is used to convert the long link to obtain a short link, and further comprising: marking the short link to make the The short link carries a short chain identifier;

The sending the target push information to the client corresponding to the user ID, and further comprising: sending the webpage content corresponding to the target push information to the client;

Sending, to the client, the webpage content corresponding to the target push information, including:

Receiving an access request sent by the client, where the access request includes the short-chain identifier;

Searching for a corresponding long link based on the short-chain identifier, and acquiring webpage content corresponding to the long link;

Sending the webpage content to the client.
The terminal device according to claim 9, wherein the transmitting the target push information to a client corresponding to the user ID, and further comprising:

Obtaining response information sent by the client;

Determining whether the current response time of receiving the response information exceeds a preset response time;

If the current response time exceeds the preset response time, the target push information is resent to the client corresponding to the user ID.
The terminal device according to claim 9, wherein said processor further implements the following steps when said computer readable instructions are executed:

Counting a current cache time and a current cache amount of the target push information cached by the server;

If the current cache time exceeds a preset cache time, and/or the current cache number exceeds a preset cache amount, the target push information is deleted.
A computer readable storage medium storing computer readable instructions, wherein the computer readable instructions, when executed by a processor, implement the following steps:

Obtaining an information generating instruction, where the information generating instruction includes an information template ID and a user ID;

Obtaining to-be-push information based on the information template ID and the user ID, where the to-be-push information includes a long link and information content;

Converting the long link by using a long chain to short chain algorithm to obtain a short link;

Obtaining target push information based on the short link and the information content;

The target push information is sent to a client corresponding to the user ID.
The computer readable storage medium according to claim 15, wherein the obtaining the information to be pushed based on the information template ID and the user ID comprises:

Obtaining an information template based on the information template ID;

Obtaining user information corresponding to the user ID based on the user ID;

And obtaining information to be pushed based on the information template and the user information.
The computer readable storage medium of claim 15, wherein the converting the long link by using a long chain to short chain algorithm to obtain a short link comprises:

Splicing the long link with a preset key value to obtain a raw byte string;

Encrypting the original byte string by using an information-summary algorithm to obtain a target byte string;

Performing character conversion on the target byte string to obtain a target character string;

Dividing the target string bit by bit to obtain an eight-digit hexadecimal number;

Performing a bitwise AND operation on the eight-digit hexadecimal number and the first preset value in hexadecimal to obtain a first subscript value;

Performing bitwise AND operation on the first subscript value and the second preset value in hexadecimal to obtain a second subscript value;

The character corresponding to the second subscript value is obtained from a preset character array to form the short link.
The computer readable storage medium according to claim 15, wherein the converting the long link by using a long chain to short chain algorithm to obtain a short link, further comprising: marking the short link, So that the short link carries a short chain identifier;

The sending the target push information to the client corresponding to the user ID, and further comprising: sending the webpage content corresponding to the target push information to the client;

Sending, to the client, the webpage content corresponding to the target push information, including:

Receiving an access request sent by the client, where the access request includes the short-chain identifier;

Searching for a corresponding long link based on the short-chain identifier, and acquiring webpage content corresponding to the long link;

Sending the webpage content to the client.
The computer readable storage medium according to claim 15, wherein the transmitting the target push information to a client corresponding to the user ID, further comprising:

Obtaining response information sent by the client;

Determining whether the current response time of receiving the response information exceeds a preset response time;

If the current response time exceeds the preset response time, the target push information is resent to the client corresponding to the user ID.
The computer readable storage medium of claim 15 wherein said computer readable instructions are further executed by the processor to:

Counting a current cache time and a current cache amount of the target push information cached by the server;

If the current cache time exceeds a preset cache time, and/or the current cache number exceeds a preset cache amount, the target push information is deleted.