User volume amplification method, server, product and storage medium
By receiving the application update request on the server side and matching it with the preset user ID information, the user type is determined and the user volume is achieved efficiently, which solves the problem of inefficient user volume in the prior art.
Patent Information
- Application Number
- CN202411998956.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-12-31
- Publication Date
- 2025-05-23
AI Technical Summary
In the prior art, front-end text, links, pictures and other configurations require programmers to manually write code, resulting in increased development time and extended project cycles, and inefficient users to increase volume.
By receiving the application's update request on the server side, obtaining user ID information, and matching it with the pre-stored preset user ID information, determining the user type, thereby responding to the update request and achieving efficient user increase.
It improves the efficiency of users' volume, reduces the development time and project cycle of programmers, and improves the response speed of rapid adjustment of front-end content.
Smart Images
Figure CN120029643A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of information technology, and in particular to a method, server, product, and storage medium for increasing user volume. Background Art
[0002] At present, every configuration of text, links, pictures, etc. on the front end requires programmers to develop codes. Programmers manually write codes to configure elements such as text, links, and pictures, which not only increases development time, but also prolongs the overall project cycle; when the front-end content needs to be adjusted quickly, such as modifying text, updating links, or replacing pictures, programmers need to write or modify codes, which may lead to slower response speed. As a result, the efficiency of user volume release becomes lower and lower.
[0003] Therefore, how to achieve efficient user growth is an urgent problem to be solved. Summary of the invention
[0004] The main technical problem solved by the present invention is how to achieve efficient user expansion.
[0005] According to the first aspect, an embodiment provides a method for increasing user volume, which is applied to a server, and the method includes:
[0006] Receive update requests from multiple applications;
[0007] Scaling based on the update request includes:
[0008] Obtaining user ID information of the multiple applications;
[0009] Matching the multiple user ID information with preset user ID information pre-stored in a dictionary table, and determining the user as a first user if the user ID information matches the preset user ID information; and determining the user as a second user if the user ID information does not match the preset user ID information; wherein the dictionary table is stored in a preset storage system of the server;
[0010] In response to the update request, the application of the first user is updated; and the update request of the application of the second user is rejected.
[0011] According to the second aspect, an embodiment provides a server, the server comprising:
[0012] A communication unit, configured to receive update requests sent by multiple applications; and obtain user ID information of the multiple applications;
[0013] A processing unit, used for matching the multiple user ID information with preset user ID information pre-stored in a dictionary table, and determining the user as a first user when the user ID information matches the preset user ID information; and determining the user as a second user when the user ID information does not match the preset user ID information; wherein the dictionary table is stored in a preset storage system of the server; in response to the update request, updating the application of the first user; and rejecting the update request of the application of the second user.
[0014] According to a third aspect, an embodiment provides a product, including:
[0015] Memory for storing computer programs;
[0016] A processor is used to implement the above-mentioned method of user volume expansion by executing the computer program stored in the memory.
[0017] According to the fourth aspect, an embodiment provides a computer-readable storage medium, on which a computer program is stored, and the computer program can be executed by a processor to implement the above-mentioned user volume release method.
[0018] According to a method for increasing the volume of users in the above embodiment, the present application increases the volume of multiple users according to the matching results of multiple user ID information and preset user ID information pre-stored in the dictionary table, thereby improving the efficiency of user volume increase. BRIEF DESCRIPTION OF THE DRAWINGS
[0019] Figure 1 A flowchart of a method for increasing user volume provided in this embodiment;
[0020] Figure 2 A schematic diagram of an original version of an application provided in this embodiment;
[0021] Figure 3 A schematic diagram of an upgraded version of an application provided in this embodiment;
[0022] Figure 4 A schematic diagram of another upgraded version of an application provided in this embodiment. DETAILED DESCRIPTION
[0023] The present invention is further described in detail below by specific embodiments in conjunction with the accompanying drawings. Wherein similar elements in different embodiments adopt associated similar element numbers. In the following embodiments, many detailed descriptions are for making the present application better understood. However, those skilled in the art can easily recognize that some features can be omitted in different situations, or can be replaced by other elements, materials, methods. In some cases, some operations related to the present application are not shown or described in the specification, this is to avoid the core part of the present application being overwhelmed by too much description, and for those skilled in the art, it is not necessary to describe these related operations in detail, and they can fully understand the related operations according to the description in the specification and the general technical knowledge in the art.
[0024] In addition, the features, operations or characteristics described in the specification can be combined in any appropriate manner to form various implementations. At the same time, the steps or actions in the method description can also be interchanged or adjusted in a manner that is obvious to those skilled in the art. Therefore, the various sequences in the specification and the drawings are only for the purpose of clearly describing a certain embodiment and are not meant to be a required sequence, unless otherwise specified that a certain sequence must be followed.
[0025] The serial numbers of the components in this document, such as "first", "second", etc., are only used to distinguish the objects described and do not have any order or technical meaning. The "connection" and "coupling" mentioned in this application, unless otherwise specified, include direct and indirect connections (couplings).
[0026] At present, every configuration of text, links, pictures, etc. on the front end requires programmers to develop code. Programmers manually write code to configure elements such as text, links, and pictures, which not only increases development time, but also prolongs the overall project cycle; when the front-end content needs to be adjusted quickly, such as modifying text, updating links, or replacing pictures, programmers need to write or modify code, which may lead to slower response speed. In this way, the update efficiency of the front end (application) becomes lower and lower.
[0027] Based on this, the solution of this application is proposed. In the embodiment of this application, after obtaining the update request sent by multiple applications, the user is released according to the update request; specifically, the release is performed according to the matching result of multiple user ID information and the preset user ID information pre-stored in the dictionary table; then, in response to the update request, the corresponding operation is performed on the user's application, that is, the application is updated or the original version of the application is maintained.
[0028] Embodiment 1:
[0029] Please refer to Figure 1 , Figure 11 is a flowchart of a method for increasing user volume provided in this embodiment. The method for increasing user volume specifically includes the following steps S101-S104:
[0030] Step S101: receiving update requests sent by multiple applications.
[0031] In the present application, the update request includes at least one of a request for adding a new function, a request for optimizing a function, and a request for reducing a function.
[0032] It should be noted that the present application is not limited to an application sending an update request to a server, but any front-end website can also send an update request to a server.
[0033] It should be noted that the new function can represent the introduction of new functions in an existing user interface (UI) or application. For example, the introduction of new interactive elements, pages or services in an application. This application does not make any limitation on this.
[0034] It should be noted that the optimization function can represent the optimization of any function, for example, the optimization of the loading function and the optimization of the rendering function. This application does not make any limitation on this.
[0035] Step S102: Obtain user ID information of multiple applications.
[0036] It should be noted that the user ID information can be any information that represents the identity of the user. For example, the user ID information can be A202310091513308722001952, where 1952, 952, 52, and 2 can all be random numbers, and this application does not make any restrictions on this. The random number is used to match the preset user ID information to achieve the weight of the user.
[0037] Step S103, matching multiple user ID information with preset user ID information pre-stored in a dictionary table, and determining the user as a first user when the user ID information matches the preset user ID information; and determining the user as a second user when the user ID information does not match the preset user ID information; wherein the dictionary table is stored in a preset storage system of the server.
[0038] It should be noted that the dictionary table can represent a data table structure, and the dictionary table can be used to store preset user ID information and volume switch status.
[0039] It should be noted that the pre-stored preset user ID information can be any information that characterizes the preset user identity. For example, the user ID information can be A202310091513308722001952, where 1952, 952, 52, and 2 can all be random numbers, and this application does not make any restrictions on this. The random number is used to match the user ID information to achieve the weight of the user.
[0040] Exemplarily, matching multiple user ID information with preset user ID information pre-stored in the dictionary table can be matching the random numbers corresponding to the multiple users with the random number corresponding to the preset user; if the random number corresponding to the user is the same as the random number corresponding to the preset user, it means that the user is the first user and the user can access the updated application; if the random number corresponding to the user is different from the random number corresponding to the preset user, it means that the user is the second user and the user can only access the non-updated application.
[0041] For example, assuming that the preset user ID information is A202310091513308722001952, which is fixed, then a single user with the same random number as the preset user ID information has the right to access the updated application; assuming that the random number of the preset user ID information is 1952, then each user with the same random number 1952 as the preset user ID information has the right to access the updated application; assuming that the random number of the preset user ID information is 952, then each user with the same random number 952 as the preset user ID information has the right to access the updated application; assuming that the random number of the preset user ID information is 52, then each user with the same random number 52 as the preset user ID information has the right to access the updated application; assuming that the random number of the preset user ID information is 2, then each user with the same random number 2 as the preset user ID information has the right to access the updated application.
[0042] It should be noted that the first user can access updated applications; the second user can only access non-updated applications.
[0043] It should be noted that the preset storage system can be any storage system. Exemplarily, the preset storage system can be a key-value storage system or a database management system. This application does not make any limitation on this.
[0044] In the present application, the dictionary table also includes the buffer time between two adjacent update requests; after receiving the update request sent by the application, the update request sent by the application can be received again after waiting for the buffer time.
[0045] It should be noted that the buffer time can represent any time. For example, the buffer time can be any time between 5 minutes and 10 minutes. For example, the buffer time can be 6 minutes or 8 minutes, and this application does not make any limitation on this.
[0046] In the embodiment of the present application, the server waits for the buffer time before receiving the update request sent by the application again, so that the pressure on the server can be effectively reduced, for example, the pressure on the CPU, memory or hard disk of the server.
[0047] Step S104: In response to the update request, the application of the first user is updated; and the update request of the application of the second user is rejected.
[0048] It should be noted that when the server updates the application of the first user, it sends update parameters to the application to be updated through the universal configuration interface stored in the dictionary table, so that the application of the first user can be quickly updated.
[0049] It should be noted that the application of the first user may be updated if the application has a new version, and the application is allowed to be updated to the new version. Alternatively, the server pushes the new version to the user, so that the user updates the application.
[0050] In the present application, the dictionary table also includes a volume expansion switch state. When the volume expansion switch state is on, the volume expansion is performed based on the update request; when the volume expansion switch state is off, the volume expansion operation based on the update request is not performed.
[0051] In this application, the preset user ID information and the volume switch status stored in the dictionary table are editable. The user ID information entered by the administrator is received, and the user ID information entered by the administrator is stored in the dictionary table as the preset user ID information; the volume switch status entered by the administrator is received, and the volume switch status set by the administrator is stored in the dictionary table.
[0052] It should be noted that since the preset user ID information and the volume switch status are editable, when the text, links, pictures, etc. of the application need to be reconfigured, the programmer does not need to redevelop the code, but can directly edit the preset user ID information and / or the volume switch status. In this way, system overhead can be saved.
[0053] In the present application, the preset user ID information pre-stored in the dictionary table includes multiple types of user ID information, each type of user ID information corresponds to an update version; different types of user ID information correspond to different update versions.
[0054] like Figure 2-4As shown, taking the application "Everyone uses it this way" as an example, the application has version 2.0, version 2.1 and version 2.2. Version 2.0 is the original version of the application, and versions 2.1 and 2.2 are both upgraded versions of the application; among them, version 2.0 of the application corresponds to a type of user ID information; version 2.1 of the application corresponds to a type of user ID information; and version 2.2 of the application corresponds to a type of user ID information.
[0055] In the present application, when updating the application of the first user, the application of the first user may be updated in response to an update request, based on the type of user ID information matched by the user ID information of the first user, according to the update version corresponding to the type.
[0056] Taking the application "Everyone uses it" as an example, assuming that the type of user ID information matched by the user ID information of the first user is the first type, then the application of the first user is updated according to the updated version corresponding to the type, that is, version 2.1; assuming that the type of user ID information matched by the user ID information of the first user is the second type, then the application of the first user is updated according to the updated version corresponding to the type, that is, version 2.2.
[0057] In the present application, when the user ID information cannot match the preset user ID information, the user is determined to be a third user; and the update request of the third user's application is ignored.
[0058] It should be noted that the user ID information cannot match the preset user ID information because the current user ID information is invalid or wrong, resulting in the user ID information being unable to match the preset user ID information.
[0059] For example, it is assumed that the preset user ID information is the preset user ID information corresponding to an application; and the user ID information is another application different from the above application. In this case, when the user ID information is matched with the preset user ID information, the user ID information will be determined as invalid information or wrong information, and the server will not count the user. In this way, the accuracy of user counting is improved.
[0060] In the present application, first usage data fed back by an application of a first user is received, and the first usage data is generated by the application of the first user after being updated and used for a preset period of time; second usage data fed back by an application of a second user is received, and the second usage data is generated by the application of the second user after being used for a preset period of time.
[0061] It should be noted that the preset duration can be any duration. For example, the preset duration can be any duration between 3 days and 7 days. For example, the preset duration can be 5 days, and this application does not make any limitation on this.
[0062] It should be noted that the server receives the first usage data fed back by the first user's application and the second usage data fed back by the second user's application in order to adjust the parameters in the dictionary table, such as modifying the preset user ID information, or modifying the volume switch status, so as to optimize the application and thereby improve the user experience.
[0063] The embodiment of the present application discloses a method for user volume release, which is applied to a server, and the method includes: receiving update requests sent by multiple applications; performing volume release based on the update requests, including: obtaining user ID information of multiple applications; matching multiple user ID information with preset user ID information pre-stored in a dictionary table, and determining the user as a first user when the user ID information matches the preset user ID information; determining the user as a second user when the user ID information does not match the preset user ID information; wherein the dictionary table is stored in a preset storage system of the server; updating the application of the first user in response to the update request; and rejecting the update request of the application of the second user. The present application releases multiple users based on the matching results of multiple user ID information and preset user ID information pre-stored in the dictionary table, and then updates or does not update the application based on the user's volume release results.
[0064] Embodiment 2:
[0065] The present application also discloses a server, which includes:
[0066] A communication unit, used to receive update requests sent by multiple applications; and obtain user ID information of multiple applications;
[0067] A processing unit, used for matching multiple user ID information with preset user ID information pre-stored in a dictionary table, and determining the user as a first user when the user ID information matches the preset user ID information; and determining the user as a second user when the user ID information does not match the preset user ID information; wherein the dictionary table is stored in a preset storage system of a server; in response to an update request, updating the application of the first user; and rejecting the update request of the application of the second user.
[0068] It should be noted that the present application is not limited to an application sending an update request to a server, but any front-end website can also send an update request to a server.
[0069] It should be noted that the new function can represent the introduction of new functions in an existing user interface (UI) or application. For example, the introduction of new interactive elements, pages or services in an application. This application does not make any limitation on this.
[0070] It should be noted that the optimization function can represent the optimization of any function, for example, the optimization of the loading function and the optimization of the rendering function. This application does not make any limitation on this.
[0071] It should be noted that the user ID information can be any information that represents the identity of the user. For example, the user ID information can be A202310091513308722001952, where 1952, 952, 52, and 2 can all be random numbers, and this application does not make any restrictions on this. The random number is used to match the preset user ID information to achieve the weight of the user.
[0072] It should be noted that the dictionary table can represent a data table structure, and the dictionary table can be used to store preset user ID information and volume switch status.
[0073] It should be noted that the pre-stored preset user ID information can be any information that characterizes the preset user identity. For example, the user ID information can be A202310091513308722001952, where 1952, 952, 52, and 2 can all be random numbers, and this application does not make any restrictions on this. The random number is used to match the user ID information to achieve the weight of the user.
[0074] Exemplarily, matching multiple user ID information with preset user ID information pre-stored in the dictionary table can be matching the random numbers corresponding to the multiple users with the random number corresponding to the preset user; if the random number corresponding to the user is the same as the random number corresponding to the preset user, it means that the user is the first user and the user can access the updated application; if the random number corresponding to the user is different from the random number corresponding to the preset user, it means that the user is the second user and the user can only access the non-updated application.
[0075] For example, assuming that the preset user ID information is A202310091513308722001952, which is fixed, then a single user with the same random number as the preset user ID information has the right to access the updated application; assuming that the random number of the preset user ID information is 1952, then each user with the same random number 1952 as the preset user ID information has the right to access the updated application; assuming that the random number of the preset user ID information is 952, then each user with the same random number 952 as the preset user ID information has the right to access the updated application; assuming that the random number of the preset user ID information is 52, then each user with the same random number 52 as the preset user ID information has the right to access the updated application; assuming that the random number of the preset user ID information is 2, then each user with the same random number 2 as the preset user ID information has the right to access the updated application.
[0076] It should be noted that the first user can access updated applications; the second user can only access non-updated applications.
[0077] It should be noted that the preset storage system can be any storage system. Exemplarily, the preset storage system can be a key-value storage system or a database management system. This application does not make any limitation on this.
[0078] It should be noted that the dictionary table also includes the buffer time between two adjacent update requests; after receiving an update request sent by an application, the update request sent by the application can be received again after waiting for the buffer time.
[0079] It should be noted that the buffer time can represent any time. For example, the buffer time can be any time between 5 minutes and 10 minutes. For example, the buffer time can be 6 minutes or 8 minutes, and this application does not make any limitation on this.
[0080] In the embodiment of the present application, the server waits for the buffer time before receiving the update request sent by the application again, so that the pressure on the server can be effectively reduced, for example, the pressure on the CPU, memory or hard disk of the server.
[0081] It should be noted that updating the application of the first user may be, for example, that the application has a new version, and here the application is allowed to be updated to the new version. Alternatively, the server pushes the new version to the user, so that the user updates the application.
[0082] In this application, the preset user ID information and the volume switch status stored in the dictionary table are editable. The user ID information entered by the administrator is received, and the user ID information entered by the administrator is stored in the dictionary table as the preset user ID information; the volume switch status entered by the administrator is received, and the volume switch status set by the administrator is stored in the dictionary table.
[0083] It should be noted that since the preset user ID information and the volume switch status are editable, when the text, links, pictures, etc. of the application need to be reconfigured, the programmer does not need to redevelop the code, but can directly edit the preset user ID information and / or the volume switch status. In this way, system overhead can be saved.
[0084] In the present application, the preset user ID information pre-stored in the dictionary table includes multiple types of user ID information, each type of user ID information corresponds to an update version; different types of user ID information correspond to different update versions.
[0085] In the present application, when updating the application of the first user, the application of the first user may be updated in response to an update request, based on the type of user ID information matched by the user ID information of the first user, according to the update version corresponding to the type.
[0086] In the present application, when the user ID information cannot match the preset user ID information, the user is determined to be a third user; and the update request of the third user's application is ignored.
[0087] It should be noted that the user ID information cannot match the preset user ID information because the current user ID information is invalid or wrong, resulting in the user ID information being unable to match the preset user ID information.
[0088] For example, it is assumed that the preset user ID information is the preset user ID information corresponding to an application; and the user ID information is another application different from the above application. In this case, when the user ID information is matched with the preset user ID information, the user ID information will be determined as invalid information or wrong information, and the server will not count the user. In this way, the accuracy of user counting is improved.
[0089] In the present application, first usage data fed back by an application of a first user is received, and the first usage data is generated by the application of the first user after being updated and used for a preset period of time; second usage data fed back by an application of a second user is received, and the second usage data is generated by the application of the second user after being used for a preset period of time.
[0090] It should be noted that the preset duration can be any duration. For example, the preset duration can be any duration between 3 days and 7 days. For example, the preset duration can be 5 days, and this application does not make any limitation on this.
[0091] It should be noted that the server receives the first usage data fed back by the first user's application and the second usage data fed back by the second user's application in order to adjust the parameters in the dictionary table, such as modifying the preset user ID information, or modifying the volume switch status, so as to optimize the application and thereby improve the user experience.
[0092] The embodiment of the present application discloses a server, which includes: a communication unit for receiving update requests sent by multiple applications; obtaining user ID information of multiple applications; a processing unit for matching multiple user ID information with preset user ID information pre-stored in a dictionary table, and determining the user as a first user when the user ID information matches the preset user ID information; determining the user as a second user when the user ID information does not match the preset user ID information; wherein the dictionary table is stored in a preset storage system of the server; in response to the update request, updating the application of the first user; and rejecting the update request of the application of the second user. The present application releases multiple users according to the matching results of multiple user ID information and preset user ID information pre-stored in the dictionary table. In this way, the efficiency of user release is improved.
[0093] Those skilled in the art will appreciate that all or part of the functions of the various methods in the above-mentioned embodiments can be implemented by hardware or by computer programs. When all or part of the functions in the above-mentioned embodiments are implemented by computer programs, the program can be stored in a computer-readable storage medium, and the storage medium can include: read-only memory, random access memory, disk, optical disk, hard disk, etc., and the program is executed by a computer to implement the above-mentioned functions. For example, the program is stored in the memory of the device, and when the program in the memory is executed by the processor, all or part of the above-mentioned functions can be implemented. In addition, when all or part of the functions in the above-mentioned embodiments are implemented by computer programs, the program can also be stored in a storage medium such as a server, another computer, disk, optical disk, flash disk or mobile hard disk, and can be downloaded or copied and saved in the memory of the local device, or the system of the local device is updated, and when the program in the memory is executed by the processor, all or part of the functions in the above-mentioned embodiments can be implemented.
[0094] The above specific examples are used to illustrate the present invention, which is only used to help understand the present invention and is not intended to limit the present invention. For those skilled in the art, according to the concept of the present invention, some simple deductions, modifications or substitutions can be made.
Claims
1. A method for increasing user volume, characterized in that: Applied to a server, the method comprises: Receive update requests from multiple applications; Scaling based on the update request includes: Obtaining user ID information of the multiple applications; Matching the multiple user ID information with preset user ID information pre-stored in a dictionary table, and determining the user as a first user if the user ID information matches the preset user ID information; and determining the user as a second user if the user ID information does not match the preset user ID information; wherein the dictionary table is stored in a preset storage system of the server; In response to the update request, the application of the first user is updated; and the update request of the application of the second user is rejected.
2. The method according to claim 1, characterized in that The dictionary table also includes a buffer time between two adjacent update requests; after receiving an update request sent by an application, the update request sent by the application can be received again only after waiting for the buffer time.
3. The method according to claim 1, characterized in that The dictionary table also includes a volume increase switch state; and the volume increase based on the update request includes: When the volume increase switch is in the on state, increasing the volume based on the update request; When the volume enlargement switch state is in the off state, the volume enlargement operation based on the update request is not performed.
4. The method according to claim 3, characterized in that The preset user ID information and the volume release switch status stored in the dictionary table are editable; the method further includes: receiving user ID information input by an administrator, and storing the user ID information input by the administrator as preset user ID information in the dictionary table; The volume increase switch state input by the administrator is received, and the volume increase switch state set by the administrator is stored in the dictionary table.
5. The method according to any one of claims 1 to 4, characterized in that The preset user ID information pre-stored in the dictionary table includes multiple types of user ID information, and each type of user ID information corresponds to an updated version; Different types of user ID information correspond to different update versions; The updating of the application of the first user in response to the update request includes: In response to the update request, based on the type of user ID information matched to the user ID information of the first user, the application of the first user is updated according to an update version corresponding to the type.
6. The method according to any one of claims 1 to 4, characterized in that The method further comprises: In the case that the user ID information cannot match the preset user ID information, the user is determined to be a third user; and the update request of the application program of the third user is ignored.
7. The method according to any one of claims 1 to 4, characterized in that The update request includes at least one of a request for adding a new function, a request for optimizing a function, and a request for reducing a function; the method further includes: receiving first usage data fed back by an application of the first user, where the first usage data is generated by the application of the first user after being updated and used for a preset time period; Second usage data fed back by the application of the second user is received, where the second usage data is generated after the application of the second user is used for a preset period of time.
8. A server, characterized in that: The server comprises: A communication unit, configured to receive update requests sent by multiple applications; and obtain user ID information of the multiple applications; A processing unit, used for matching the multiple user ID information with preset user ID information pre-stored in a dictionary table, and determining the user as a first user when the user ID information matches the preset user ID information; and determining the user as a second user when the user ID information does not match the preset user ID information; wherein the dictionary table is stored in a preset storage system of the server; in response to the update request, updating the application of the first user; and rejecting the update request of the application of the second user.
9. A product characterized by include: Memory for storing computer programs; A processor, configured to implement the method according to any one of claims 1 to 7 by executing the computer program stored in the memory.
10. A computer-readable storage medium, characterized in that: A computer program is stored on the medium, and the computer program can be executed by a processor to implement the method according to any one of claims 1 to 7.