CN115098760A

CN115098760A - Data processing method and device, electronic equipment and storage medium

Info

Publication number: CN115098760A
Application number: CN202210753252.6A
Authority: CN
Inventors: 宁振航
Original assignee: Beijing Dajia Internet Information Technology Co Ltd
Current assignee: Beijing Dajia Internet Information Technology Co Ltd
Priority date: 2022-06-29
Filing date: 2022-06-29
Publication date: 2022-09-23

Abstract

The disclosure relates to a data processing method, a data processing device, an electronic device and a storage medium, and relates to the technical field of computers. The method and the device can solve the problem that the server is crashed due to the fact that the capacity of the server cannot be expanded in time in the related technology. The method comprises the following steps: acquiring a plurality of resources stored in a first memory and the access times of each resource in the first memory; one resource corresponds to one event searched by the user; updating the access times of each resource in the second memory according to the plurality of resources and the access times of each resource in the first memory; the maximum storage quantity of the second storage resource is larger than the maximum storage quantity of the first storage resource; under the condition that the target resource exists in the resources stored in the second memory, determining that the event corresponding to the target resource is a hot event, and generating alarm information for prompting capacity expansion; the number of times that the target resource is accessed in the second memory is greater than a preset threshold.

Description

Data processing method and device, electronic equipment and storage medium

Technical Field

The present disclosure relates to the field of computer technologies, and in particular, to a data processing method and apparatus, an electronic device, and a storage medium.

Background

With the rapid development and popularization of networks, various social networking platforms have become important channels for vast network users to acquire information. For example, when a news event is generated, netizens typically search a large number of related topics on the social networking platform to obtain information about the news event.

However, when the number of people concerned by a news event increases suddenly, the server of the social networking platform is overloaded quickly, and the operation and maintenance personnel cannot expand the capacity in time, so that the server of the social networking platform is crashed.

Disclosure of Invention

The present disclosure provides a data processing method, an apparatus, an electronic device, and a storage medium, so as to solve a problem in the related art that a server is crashed due to an inability to timely expand a capacity of the server. The technical scheme of the disclosure is as follows:

according to a first aspect of an embodiment of the present disclosure, there is provided a data processing method, including: acquiring a plurality of resources stored in a first memory and the access times of each resource in the first memory; a resource corresponds to an event accessed by a user; updating the access times of each resource in the second memory according to the plurality of resources and the access times of each resource in the first memory; the maximum storage quantity of the second memory storage resource is larger than the maximum storage quantity of the first memory storage resource; under the condition that the target resource exists in the resources stored in the second memory, determining that the event corresponding to the target resource is a hot event, and generating alarm information for prompting capacity expansion; the number of times of access of the target resource in the second memory is greater than or equal to a preset threshold value.

Optionally, updating the number of times of access of each resource in the second storage according to the plurality of resources and the number of times of access of each resource in the first storage includes: under the condition that the first resource exists in the second memory, updating the sum of the access times of the first resource in the first memory and the historical access times of the first resource in the second memory into the access times of the first resource in the second memory; the first resource is any one of a plurality of resources; and updating the access times of the first resource in the first memory to the access times of the first resource in the second memory under the condition that the first resource does not exist in the second memory.

Optionally, the obtaining of the multiple resources stored in the first memory and the number of times of access of each resource in the first memory includes: and acquiring a plurality of resources stored in the first memory and the access times of each resource in the first memory according to a first preset period.

Optionally, the obtaining of the multiple resources stored in the first memory and the number of times of access of each resource in the first memory includes: and under the condition that the quantity of the resources stored in the first memory reaches the maximum storage quantity of the storage resources of the first memory, acquiring a plurality of resources stored in the first memory and the access times of each resource in the first memory.

Optionally, the method further includes: and judging whether the target resource exists in the resources stored in the second memory according to a second preset period.

Optionally, the method further includes: receiving an access request sent by a user account, and acquiring a second resource from the access request; the second resource is stored in the first memory and a number of accesses of the second resource to the first memory is determined.

Optionally, determining the number of times of access of the second resource in the first memory includes: adding 1 to the number of times of access of the second resource in the first memory under the condition that the second resource exists in the first memory; and under the condition that the second resource does not exist in the first memory, if the quantity of the resources stored in the first memory does not reach the maximum storage quantity of the resources stored in the first memory, storing the second resource into the first memory, and starting to record the access times of the second resource in the first memory.

Optionally, the method further comprises: under the condition that the second resource does not exist in the first memory, if the number of the resources stored in the first memory reaches the maximum storage number of the resources stored in the first memory, after the third resource in the first memory is deleted, the second resource is stored in the first memory, and the access times of the second resource in the first memory are recorded; the third resource is the resource with the minimum access times in the first memory.

Optionally, deleting the third resource in the first memory, including: and constructing a small root heap according to the access times of each resource in the first memory, and deleting the tail end node of the small root heap.

According to a second aspect of the embodiments of the present disclosure, there is provided a data processing apparatus including an acquisition unit, an update unit, a determination unit, and a generation unit; an acquisition unit configured to acquire a plurality of resources stored in the first memory and the number of times each resource has been accessed in the first memory; a resource corresponds to an event accessed by a user; the updating unit is used for updating the access times of each resource in the second memory according to the plurality of resources and the access times of each resource in the first memory; the maximum storage quantity of the second storage resource is larger than the maximum storage quantity of the first storage resource; the determining unit is used for determining that an event corresponding to the target resource is a hot event under the condition that the target resource exists in the resources stored in the second memory, and the access frequency of the target resource in the second memory is greater than or equal to a preset threshold value; and the generating unit is used for generating alarm information for prompting capacity expansion after the determining unit determines that the event corresponding to the target resource is the hot event.

Optionally, the updating unit is specifically configured to: under the condition that the first resource exists in the second memory, updating the sum of the access times of the first resource in the first memory and the historical access times of the first resource in the second memory into the access times of the first resource in the second memory; the first resource is any one of a plurality of resources; and under the condition that the first resource does not exist in the second memory, updating the number of times of access of the first resource in the first memory to the number of times of access of the first resource in the second memory.

Optionally, the obtaining unit is specifically configured to: and acquiring a plurality of resources stored in the first memory and the access times of each resource in the first memory according to a first preset period.

Optionally, the obtaining unit is specifically configured to: and under the condition that the quantity of the resources stored in the first memory reaches the maximum storage quantity of the storage resources of the first memory, acquiring a plurality of resources stored in the first memory and the access times of each resource in the first memory.

Optionally, the determining unit is further configured to: and judging whether the target resource exists in the resources stored in the second memory according to a second preset period.

Optionally, the determining unit is further configured to: receiving an access request sent by a user account, and acquiring a second resource from the access request; the second resource is stored in the first memory and a number of accesses of the second resource in the first memory is determined.

Optionally, the determining unit is specifically configured to: adding 1 to the number of times of access of the second resource in the first memory under the condition that the second resource exists in the first memory; and under the condition that the second resource does not exist in the first memory, if the quantity of the resources stored in the first memory does not reach the maximum storage quantity of the resources stored in the first memory, storing the second resource into the first memory, and starting to record the access times of the second resource in the first memory.

Optionally, the updating unit is further configured to: under the condition that the second resource does not exist in the first memory, if the number of the resources stored in the first memory reaches the maximum storage number of the resources stored in the first memory, after the third resource in the first memory is deleted, the second resource is stored in the first memory, and the access times of the second resource in the first memory are recorded; the third resource is the resource with the minimum access times in the first memory.

Optionally, the updating unit is specifically configured to: and constructing a small root heap according to the access times of each resource in the first memory, and deleting the tail end node of the small root heap.

According to a third aspect of an embodiment of the present disclosure, there is provided an electronic apparatus including: a processor, a memory for storing processor-executable instructions; wherein the processor is configured to execute the instructions to implement the data processing method of the first aspect.

According to a fourth aspect of embodiments of the present disclosure, there is provided a computer-readable storage medium having stored thereon instructions which, when executed by a processor of an electronic device, enable the electronic device to perform the data processing method of the first aspect as described above.

According to a fifth aspect of embodiments of the present disclosure, there is provided a computer program product comprising computer instructions which, when executed by a processor, implement the data processing method as described in the first aspect above.

The technical scheme provided by the disclosure at least brings the following beneficial effects: in the disclosure, a plurality of resources stored in a first memory and the number of times of access of each resource in the first memory are firstly acquired; since one resource corresponds to one event accessed by the user, the access condition of each event recorded in the first storage can be clarified. Further, updating the access times of each resource in the second memory according to the plurality of resources and the access times of each resource in the first memory; because the maximum storage quantity of the second storage resource is larger than that of the first storage resource, the searching situation of each event can be more comprehensively known. Under the condition that the target resource exists in the resources stored in the second memory, determining that the event corresponding to the target resource is a hot event, and generating alarm information for prompting capacity expansion; the number of times of access of the target resource in the second memory is greater than a preset threshold, so that an event corresponding to the target resource can be a hot event. Because the hot event can be successfully determined and the alarm information for prompting expansion is generated, operation and maintenance personnel can be timely reminded to expand the capacity of the server, and the server crash caused by sudden increase of the access amount is avoided.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and, together with the description, serve to explain the principles of the disclosure and are not to be construed as limiting the disclosure.

FIG. 1 is a block diagram of a data processing system in accordance with an exemplary embodiment;

FIG. 2 is one of the flow diagrams of a data processing method shown in accordance with an exemplary embodiment;

FIG. 3 is a second flowchart illustrating a data processing method according to an exemplary embodiment;

FIG. 4 is a third flowchart illustration of a data processing method according to an exemplary embodiment;

FIG. 5 is a fourth flowchart illustrating a method of data processing in accordance with an exemplary embodiment;

FIG. 6 is a fifth flowchart illustrating a method of data processing in accordance with an exemplary embodiment;

FIG. 7 is a block diagram illustrating a data processing apparatus in accordance with an exemplary embodiment;

fig. 8 is a schematic structural diagram of an electronic device according to an exemplary embodiment.

Detailed Description

In order to make the technical solutions of the present disclosure better understood by those of ordinary skill in the art, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings.

It should be noted that the terms "first," "second," and the like in the description and claims of the present disclosure and in the above-described drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the disclosure described herein are capable of operation in sequences other than those illustrated or otherwise described herein. The implementations described in the exemplary embodiments below are not intended to represent all implementations consistent with the present disclosure. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present disclosure, as detailed in the appended claims.

In addition, in the description of the embodiments of the present disclosure, "/" indicates an OR meaning, for example, A/B may indicate A or B, unless otherwise specified. "and/or" herein is merely an association describing an associated object, and means that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, in the description of the embodiments of the present disclosure, "a plurality" means two or more than two.

It should be noted that, the user information (including but not limited to user device information, user personal information, user behavior information, etc.) and data (including but not limited to program code, etc.) referred to in the present disclosure are information and data authorized by the user or sufficiently authorized by each party.

Before explaining the embodiments of the present disclosure in detail, some related arts to which the embodiments of the present disclosure relate will be described.

However, when the number of people concerned about a news event increases suddenly, the server of the social networking platform is overloaded quickly, and the operation and maintenance personnel cannot expand the capacity in time, so that the server of the social networking platform is crashed.

In practical application, some related technologies usually find that the server is overloaded, and then the operation and maintenance personnel expand the capacity of the server, so that not only is the capacity of the server not expanded timely enough, but also the server is down easily.

Other related technologies usually deploy a large number of servers in advance to deal with any burst traffic and guarantee the normal operation of the servers. However, the deployment cost is high, and the traffic is usually at a stable level, that is, the traffic accessed by the user tends to be stable in general, and does not need a large number of servers to carry, which causes a problem of wasting server resources and increasing the deployment cost of the servers.

Therefore, the related art does not have a proper scheme to solve the problem of server crash caused by the fact that the capacity of the server cannot be expanded in time.

The data processing method provided by the embodiment of the disclosure is used for solving the problem that the server is crashed because the capacity of the server cannot be expanded in time in the related technology. The data processing method provided by the embodiment of the disclosure can be applied to a data processing system, and fig. 1 shows a schematic structural diagram of the data processing system. As shown in fig. 1, the data processing system 10 includes a data processing apparatus 11 and an electronic device 12. The data processing device 11 is connected to an electronic apparatus 12. The data processing device 11 and the electronic device 12 may be connected in a wired manner or in a wireless manner, which is not limited in the embodiment of the present invention.

The data processing device 11 includes a first memory and a second memory, and in practical applications, the data processing device 11 may be a server of various social networking platforms. The first memory may be a Random Access Memory (RAM), and the first memory may also be a memory of a server of various social networking platforms. The second storage may be a read-only memory (ROM), and the first storage may also be a hard disk of a server of various social networking platforms. In practical applications, the number of the first memories and the number of the second memories are not limited in the embodiments of the present disclosure.

The data processing device 11 is configured to obtain the plurality of resources stored in the first memory and the number of times each resource has been accessed in the first memory, and update the number of times each resource has been accessed in the second memory according to the plurality of resources and the number of times each resource has been accessed in the first memory. The data processing device 11 is further configured to, when a target resource exists in the resources stored in the second memory, determine that an event corresponding to the target resource is a hot event, and generate alarm information for prompting capacity expansion.

The assets in the embodiments of the present disclosure can be various multimedia assets including, but not limited to, video, audio, pictures, text, and the like.

The data processing means 11 may be implemented in various electronic devices 12 that can process multimedia resources. The electronic device 12 at least comprises a multimedia resource storage device, a multimedia resource transmission device and a multimedia resource playing device.

In different application scenarios, the data processing apparatus 11 and the electronic device 12 may be independent devices or may be integrated in the same device, which is not specifically limited in this embodiment of the present invention.

When the data processing device 11 and the electronic device 12 are integrated in the same device, the data transmission mode between the data processing device 11 and the electronic device 12 is data transmission between internal modules of the device. In this case, the data transfer flow between the two is the same as the "data transfer flow between the data processing device 11 and the electronic device 12 when they are independent of each other".

In the following embodiments provided in the embodiments of the present disclosure, the data processing device 11 and the electronic device 12 are set independently of each other as an example for explanation.

Fig. 2 is a flow diagram illustrating a data processing method according to some example embodiments. In some embodiments, the data processing method may be applied to the data processing apparatus and the electronic device shown in fig. 1, and may also be applied to other similar devices.

As shown in fig. 2, a data processing method provided by the embodiment of the present disclosure includes the following steps S201 to S204.

S201, the data processing device acquires a plurality of resources stored in the first memory and the access times of each resource in the first memory.

Wherein one resource corresponds to one event accessed by the user.

As a possible implementation manner, the data processing apparatus acquires the plurality of resources stored in the first memory and the number of times each resource is accessed in the first memory according to a first preset period.

It should be noted that the first preset period is set in the data processing device by the operation and maintenance staff in advance. In practical application, in order to ensure that the data processing device can timely acquire the plurality of resources stored in the first memory and the access times of each resource in the first memory, the first preset period cannot be too long, and generally the first preset period needs to be less than or equal to a first preset threshold set by an operation and maintenance worker.

The resource may be a keyword (key) in search content input by the user on the terminal. In practical application, after a user inputs search content on a terminal, the terminal sends the search content to a server, the server determines an event corresponding to the search according to a keyword in the search content, and sends event information to the terminal for the user to check, and the event can be news, news and the like. Events may be carried in the form of various multimedia assets, such as video, audio, pictures, text, and the like.

As shown in table one, a storage condition of the first memory is shown. The first memory stores N resources and the access times of the resources in the first memory.

Watch 1

(Resource)	Number of accesses
		Resource 1	500
Resource 2	700
		Resource 3	1000
……	……
		Resource N	200

Illustratively, the data processing apparatus executes the fetch task every 1 second to fetch the plurality of resources stored in the first memory and the number of times each resource is accessed in the first memory.

It can be understood that, the data processing device executes the acquiring task according to the preset period, which can ensure that the data processing device can acquire the plurality of resources stored in the first memory and the access times of each resource in the first memory in time.

As another possible implementation manner, in a case where the number of resources stored in the first memory reaches the maximum storage number of the first memory storage resources, the data processing apparatus acquires the plurality of resources stored in the first memory and the number of times each resource is accessed in the first memory.

It should be noted that the maximum storage amount of the storage resource of the first storage is preset by the operation and maintenance personnel according to the actual situation of the first storage. When the amount of resources stored in the first memory reaches the maximum storage amount of the first memory storage resources, the first memory feeds back to the data processing apparatus to notify the data processing apparatus that the storage amount of the first memory has reached a peak. And after the data processing device is informed of receiving the feedback of the first memory, acquiring the plurality of resources stored in the first memory and the access times of each resource in the first memory.

Illustratively, the maximum storage amount of the first memory storage resources is 1000, and when the number of the resources stored in the first memory reaches 1000, the data processing apparatus acquires 1000 resources stored in the first memory and the number of times of access of each resource in the first memory.

It can be understood that, when the number of the resources stored in the first memory reaches the maximum storage number of the storage resources of the first memory, the data processing apparatus acquires the plurality of resources stored in the first memory and the number of times of access of each resource in the first memory, so that the acquisition timing of the data processing apparatus is more appropriate to ensure that the data processing apparatus can acquire the plurality of resources stored in the first memory and the number of times of access of each resource in the first memory in time.

S202, the data processing device updates the access times of each resource in the second storage according to the plurality of resources and the access times of each resource in the first storage.

Wherein the maximum storage amount of the second memory storage resource is greater than the maximum storage amount of the first memory storage resource.

As a possible implementation manner, the data processing apparatus stores the plurality of resources and the number of times of access of each resource in the first memory to the second memory to update the number of times of access of each resource in the second memory.

It should be noted that, before the data processing apparatus stores the plurality of resources and the number of times of access of each resource in the first memory in the second memory, some resources and the number of times of access of the resources in the second memory may be stored in the second memory, and these resources may be the same as or different from the plurality of resources transmitted by the data processing apparatus, and the resources stored in the second memory in the present disclosure are not limited. The second memory may also not have any resources stored therein before the data processing apparatus stores the plurality of resources and the number of accesses of each resource in the first memory to the second memory.

The updated resource and the access times in the second storage may be a superposition of the resource and the access times in the first storage and the original resource and the access times in the second storage, or may be a weighting, and the embodiment of the present disclosure is not limited herein.

In practical applications, the second storage is deployed with an open source database, for example, a remote dictionary service (Redis) database. The second memory may be used as an open source memory data store for the database, cache, stream engine, and message broker. The maximum storage amount of the second storage resource is larger than that of the first storage resource, and the first storage cannot record a large amount of resources generally.

For the detailed description of this step, reference may be made to the following steps S2021 to S2023, which are not described herein again.

S203, in a case that the target resource exists in the resources stored in the second memory, the data processing apparatus determines that the event corresponding to the target resource is a hot event.

And the access times of the target resource in the second memory are greater than or equal to a preset threshold value.

As a possible implementation manner, the data processing apparatus traverses the access times of the resources in the second storage, and compares the access times of the resources currently traversed to the second storage with a preset threshold. And if the access times are larger than a preset threshold value, determining the current traversal resources as target resources until the traversal is completed. Further, the data processing device determines an event corresponding to the target resource according to the target resource and the mapping relation including the resource and the event, and determines the event corresponding to the target resource as a hot event.

It should be noted that the preset threshold is set in the data processing device by the operation and maintenance staff in advance. In practical applications, the operation and maintenance personnel usually set specific thresholds according to the carrying capacity of the server.

As shown in Table II, a second memory update storage scenario is shown. The second memory stores M resources and the access times of the resources in the second memory.

Watch 2

(Resource)	Number of accesses
		Resource 1	5500
Resource 2	7800
		Resource 3	11000
……	……
		Resource N	2200
……	……
		Resource M	3000

For example, if the preset threshold is 10000, the data processing apparatus determines that the resource 3 is the target resource because the access time of the resource 3 is 11000, which is greater than the preset threshold 10000.

As shown in Table three, a mapping relationship of resources to events is shown. Wherein one resource corresponds to one event searched by the user.

Watch III

(Resource)	Event(s)
		Resource 1	Event 1
Resource 2	Event 2
		Resource 3	Event 3
……	……
		Resource N	Event N
……	……
		Resource M	Event M

For example, if the target resource is resource 3, the data processing apparatus determines that the event corresponding to resource 3 is event 3 according to the mapping relationship shown in table three, and determines event 3 as a hot event.

And S204, generating alarm information for prompting capacity expansion by the data processing device.

As a possible implementation manner, after determining that the event is a hot event, the data processing apparatus generates alarm information for prompting capacity expansion.

For example, after determining that the event is a hot event, the data processing apparatus sends a voice alarm prompt to prompt an operation and maintenance person to expand the capacity. Accordingly, after hearing the voice alarm prompt, the operation and maintenance personnel can start the standby server or expand the capacity of the existing server to deal with the sudden traffic which may occur.

The technical scheme provided by the embodiment of the disclosure at least has the following beneficial effects: the method comprises the steps of firstly acquiring a plurality of resources stored in a first memory and the access times of each resource in the first memory; since one resource corresponds to one event searched by the user, the search condition of each event recorded in the first memory can be clarified. Further, updating the access times of each resource in the second memory according to the plurality of resources and the access times of each resource in the first memory; because the maximum storage quantity of the second storage resource is larger than that of the first storage resource, the searching condition of each event can be more comprehensively known. Under the condition that the target resource exists in the resources stored in the second memory, determining that the event corresponding to the target resource is a hot event, and generating alarm information for prompting capacity expansion; the number of times of access of the target resource in the second memory is greater than a preset threshold, so that an event corresponding to the target resource can be a hot event. Because the hot event can be successfully determined and the alarm information for prompting expansion is generated, operation and maintenance personnel can be timely reminded to expand the capacity of the server, and the server crash caused by sudden increase of the access amount is avoided.

In one design, as shown in fig. 3, in order to update the number of times of accessing each resource in the second storage, the foregoing S202 provided in this embodiment of the disclosure specifically includes the following S2021 to S2023:

s2021, the data processing apparatus determines whether the first resource exists in the second memory.

The first resource is any one of a plurality of resources.

As a possible implementation manner, after acquiring the plurality of resources stored in the first storage and the number of times each resource has been accessed in the first storage, the data processing apparatus performs a query on any one resource in the first storage (i.e., the first resource) in the second storage, and determines that the resource exists in the second storage if the same resource is queried, and otherwise determines that the resource does not exist in the second storage.

Illustratively, if the resources stored in the first memory are resource 1, resource 2, resource 3, and resource 4, the resources stored in the second memory are resource 1, resource 2, resource 3, resource 5, resource 6, and resource 7. The data processing device judges whether the second memory has the resource 1, the resource 2, the resource 3 and the resource 4 respectively, and finally determines that the second memory has the resource 1, the resource 2 and the resource 3 and does not have the resource 4.

S2022, if the first resource exists in the second memory, the data processing apparatus updates the sum of the number of times the first resource has been accessed in the first memory and the number of times the first resource has been historically accessed in the second memory to the number of times the first resource has been accessed in the second memory.

As a possible implementation manner, in a case where the first resource exists in the second memory, the data processing apparatus calculates the sum of the access times of the first resource, in a case where the first resource exists in the first memory, and the historical access times of the first resource in the second memory, and updates the calculated sum of the access times to the access times of the first resource in the second memory.

Illustratively, as shown in table four, the resources stored in the first memory are resource 1, resource 2, resource 3, and resource 4, and the number of accesses in the first memory is 100, 200, 300, and 400, respectively.

Watch four

(Resource)	Number of accesses
		Resource 1	100
Resource 2	200
		Resource 3	300
Resource 4	400

As shown in table five, the resources stored in the second memory are resource 1, resource 2, resource 3, resource 5, resource 6, and resource 7, and the historical access times in the second memory are 200, 100, 800, 400, 600, and 1000, respectively.

Watch five

(Resource)	Number of accesses
		Resource 1	200
Resource 2	100
		Resource 3	800
Resource 5	400
		Resource 6	600
Resource 7	1000

The resource 1, the resource 2, and the resource 3 are first resources existing in the second memory, and the data processing apparatus updates the number of accesses of the resource 1 to 300(100+200 equals 300) in the second memory, updates the number of accesses of the resource 2 to 300(200+100 equals 300) in the second memory, and updates the number of accesses of the resource 3 to 1100(800+300 equals 1100) in the second memory.

S2023, if the first resource does not exist in the second memory, the data processing apparatus updates the number of times of access of the first resource in the first memory to the number of times of access of the first resource in the second memory.

As a possible implementation manner, in a case where the first resource does not exist in the second memory, the data processing apparatus adds the first resource and the number of times of access of the first resource in the first memory to the second memory.

Exemplarily, referring to the above table four and table five, the resource 4 is the first resource which does not exist in the second memory, the data processing apparatus adds the resource 4 to the second memory, and determines the number of accesses of the resource 4 in the second memory as 400.

As shown in table six, the updated storage condition of the second memory based on table four and table five is shown. Note that, the data processing apparatus does not update the resource existing in the second memory and not existing in the first memory.

Watch six

(Resource)	Number of accesses
		Resource 1	300
Resource 2	300
		Resource 3	1100
Resource 4	400
		Resource 5	400
Resource 6	600
		Resource 7	1000

It is understood that the data processing apparatus specifies the update policy of the first resource by determining whether the first resource exists in the second memory. Specifically, when the first resource exists in the second storage, the historical access frequency of the first resource in the second storage is also taken as a consideration factor, so that the updated access frequency of the first resource in the second storage is more accurate. And under the condition that the first resource does not exist in the second memory, directly updating the access times of the first resource in the first memory to the access times of the first resource in the second memory, so that the updated access times of the first resource in the second memory are not missed.

In one design, as shown in fig. 4, to determine whether a target resource exists in the resources stored in the second memory, the data processing method provided by the embodiment of the disclosure further includes S301 described below.

S301, the data processing device judges whether the target resource exists in the resources stored in the second memory according to a second preset period.

And the number of times of accessing the target resource in the second memory is greater than a preset threshold value.

As a possible implementation manner, the data processing apparatus traverses the access times of the resources in the second memory according to a second preset period, and compares the access times of the currently traversed resources with a preset threshold. And if the access times are larger than a preset threshold value, determining the current traversal resources as target resources until the traversal is completed. Further, the data processing device determines an event corresponding to the target resource according to the target resource and the mapping relation including the resource and the event, and determines the event corresponding to the target resource as a hot event.

It should be noted that the preset threshold is set in the data processing device by the operation and maintenance staff in advance. In practical applications, the operation and maintenance personnel usually set specific thresholds according to the carrying capacity of the server. The second preset period is set in the data processing device by operation and maintenance personnel in advance. In practical application, in order to ensure that the data processing apparatus can timely determine whether the target resource exists in the resources stored in the second memory, the second preset period cannot be too long, and generally the second preset period needs to be less than or equal to a second preset threshold set by an operation and maintenance worker. The second preset period may be the same as or different from the first preset period, which is not limited in this disclosure.

Illustratively, the data processing apparatus executes the judgment task every 1 second to judge whether the target resource exists among the resources stored in the second memory.

It can be understood that the data processing device executes the judgment task according to the preset period, which can ensure that the data processing device can judge whether the target resource exists in the resources stored in the second memory in time.

In one design, as shown in fig. 5, in order for the first memory to record a plurality of resources and the number of times each resource is accessed in the first memory, the data processing method provided by the embodiment of the disclosure further includes the following S401-S404.

S401, the data processing device receives an access request sent by a user account.

In practice, each time a user account is searched, an access request is sent to the data processing device. Accordingly, the data processing device receives an access request sent by the user account.

It should be noted that the access request includes an Identity (ID) of the user account, a resource, a search time, and the like.

S402, the data processing device acquires the second resource from the access request.

As a possible implementation manner, each time the data processing apparatus receives an access request sent by one user account, the data processing apparatus acquires the second resource from the access request.

Note that the second resource is a resource included in the access request.

S403, the data processing apparatus stores the second resource in the first memory.

As a possible implementation manner, each time the data processing apparatus acquires one second resource, the data processing apparatus stores the second resource in the first memory.

S404, the data processing device determines the access times of the second resource in the first memory.

As a possible implementation, the data processing apparatus determines the number of accesses of a second resource in the first memory every time the data processing apparatus stores a second resource in the first memory.

It is understood that, each time the data processing device receives an access request sent by one user account, the data processing device obtains one second resource from the access request to record the search condition of each user account. Further, the data processing device stores the acquired second resources in the first memory, and determines the number of times of access of the second resources in the first memory, so as to record each second resource and the number of times of access of the second resource in the first memory.

In one design, as shown in fig. 6, in order to determine the number of times the second resource is accessed in the first memory, the foregoing S404 provided in this embodiment of the disclosure specifically includes the following S4041-S4046:

s4041, the data processing apparatus determines whether the second resource exists in the first memory. In the case where the second resource exists in the first memory, S4042 is performed; in case the second resource is not present in the first memory, S4043-S4046 are performed.

As a possible implementation manner, each time the data processing apparatus acquires a second resource, the data processing apparatus performs an inquiry in the first storage, and if the same resource is inquired, it is determined that the resource exists in the first storage, otherwise, it is determined that the resource does not exist in the first storage.

Illustratively, the resources stored in the first memory are resource 1, resource 2, resource 3, and resource 4, and if the resource acquired by the data processing apparatus is resource 1, the data processing apparatus determines that the second resource exists in the first memory. If the resource acquired by the data processing apparatus is resource 5, the data processing apparatus determines that the second resource does not exist in the first memory.

S4042, if the second resource exists in the first memory, the data processing apparatus adds 1 to the number of times of access of the second resource in the first memory.

As a possible implementation, in the case where the second resource exists in the first memory, the data processing apparatus adds 1 to the number of accesses of the second resource originally in the first memory.

Illustratively, the resources stored in the first memory are resource 1, resource 2, resource 3, and resource 4, where the number of accesses originally made by resource 1 in the first memory is 500. If the resource acquired by the data processing apparatus is resource 1, the number of times the data processing apparatus accesses resource 1 in the first memory is updated to 501.

S4043, in a case where the second resource does not exist in the first memory, the data processing apparatus determines whether the number of resources stored in the first memory reaches the maximum storage number of the storage resources of the first memory.

As a possible implementation manner, in the case where the second resource does not exist in the first memory, the data processing apparatus acquires the number of resources currently stored in the first memory, and compares the number of resources currently stored with the maximum storage number of the storage resources of the first memory, and determines whether the number of resources stored in the first memory reaches the maximum storage number of the storage resources of the first memory.

S4044, if the number of the resources stored in the first memory does not reach the maximum storage number of the storage resources of the first memory, the data processing device stores the second resource in the first memory, and starts to record the access times of the second resource in the first memory.

As a possible implementation manner, if the number of resources stored in the first memory does not reach the maximum storage number of the storage resources of the first memory, the data processing apparatus stores the second resource in the first memory, and records the number of times of access of the second resource as 1.

S4045, in a case that the second resource does not exist in the first memory, if the number of resources stored in the first memory reaches the maximum storage number of the storage resources of the first memory, the data processing apparatus deletes the third resource in the first memory.

And the third resource is the resource with the minimum access times in the first memory.

As a possible implementation manner, if the number of resources stored in the first memory reaches the maximum storage number of the storage resources of the first memory, the data processing apparatus sorts the resources in the first memory in order from large to small according to the current access times of the resources in the first memory, so as to determine the resource with the smallest access time, and delete the resource.

As another possible implementation manner, if the number of resources stored in the first memory reaches the maximum storage number of the first memory storage resources, the data processing apparatus constructs a small root heap according to the size of the number of times each resource accesses the first memory, and deletes the end node of the small root heap.

It should be noted that the minor root heap, also called a minimum heap, is a sorted complete binary tree, where the data value of any non-terminal node is not greater than the values of its left child node and right child node. In the embodiment of the present disclosure, the data processing apparatus constructs a small stub in which the number of accesses to its end node is minimum, according to the size of the number of accesses to each resource in the first memory.

It can be understood that the data structure of the small stub is used, so that the data structure is simpler and clearer, and the storage efficiency is improved.

S4046, after deleting the third resource in the first memory, the data processing apparatus stores the second resource in the first memory, and starts to record the number of times of accessing the second resource in the first memory.

As a possible implementation manner, after deleting the third resource in the first memory, the data processing apparatus stores the second resource in the first memory, and records the number of times of access of the second resource in the first memory as 1.

It is to be understood that, after the number of resources stored in the first memory reaches the maximum storage number of the first memory storage resources, in order not to miss the second resource, the data processing apparatus deletes the resource with the smallest access number to reserve a space for storing the second resource. Therefore, the second resource can not be omitted, the resource with the minimum access frequency can be deleted, and the processing pressure of the data processing device is reduced.

The foregoing embodiments mainly introduce the solutions provided by the embodiments of the present disclosure from the perspective of apparatuses (devices). It is understood that, in order to implement the above method, the apparatus or device includes hardware structures and/or software modules for executing the respective method flows, and the hardware structures and/or software modules for executing the respective method flows may constitute an electronic device. Those of skill in the art will readily appreciate that the present disclosure can be implemented in hardware or a combination of hardware and computer software for implementing the exemplary algorithm steps described in connection with the embodiments disclosed herein. Whether a function is performed as hardware or computer software drives hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.

The present disclosure may perform functional module division on the apparatus or device according to the above method examples, for example, the apparatus or device may divide each functional module corresponding to each function, or may integrate two or more functions into one processing module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. It should be noted that, the division of the modules in the embodiments of the present disclosure is illustrative, and is only one division of logic functions, and there may be another division in actual implementation.

Fig. 7 is a schematic diagram illustrating a structure of a data processing apparatus according to an exemplary embodiment. Referring to fig. 7, a data processing apparatus 50 provided in the embodiment of the present disclosure includes an obtaining unit 501, an updating unit 502, a determining unit 503, and a generating unit 504.

An obtaining unit 501, configured to obtain a plurality of resources stored in a first memory and access times of each resource in the first memory; one resource corresponds to one event searched by the user; an updating unit 502, configured to update the number of times of access of each resource in the second memory according to the plurality of resources and the number of times of access of each resource in the first memory; the maximum storage quantity of the second storage resource is larger than the maximum storage quantity of the first storage resource; a determining unit 503, configured to determine, when a target resource exists in resources stored in the second memory, that an event corresponding to the target resource is a hot event, where an access frequency of the target resource in the second memory is greater than or equal to a preset threshold; a generating unit 504, configured to generate warning information for prompting capacity expansion after the determining unit 503 determines that the event corresponding to the target resource is a hot event.

Optionally, the updating unit 502 is specifically configured to: under the condition that the first resource exists in the second memory, updating the sum of the access times of the first resource in the first memory and the historical access times of the first resource in the second memory into the access times of the first resource in the second memory; the first resource is any one of a plurality of resources; and under the condition that the first resource does not exist in the second memory, updating the number of times of access of the first resource in the first memory to the number of times of access of the first resource in the second memory.

Optionally, the obtaining unit 501 is specifically configured to: and acquiring a plurality of resources stored in the first memory and the access times of each resource in the first memory according to a first preset period.

Optionally, the obtaining unit 501 is specifically configured to: and under the condition that the number of the resources stored in the first memory reaches the maximum storage number of the first memory storage resources, acquiring a plurality of resources stored in the first memory and the access times of each resource in the first memory.

Optionally, the determining unit 503 is further configured to: and judging whether the target resource exists in the resources stored in the second memory according to a second preset period.

Optionally, the determining unit 503 is further configured to: receiving an access request sent by a user account, and acquiring a second resource from the access request; the second resource is stored in the first memory and a number of accesses of the second resource in the first memory is determined.

Optionally, the determining unit 503 is specifically configured to: adding 1 to the number of times of access of the second resource in the first memory under the condition that the second resource exists in the first memory; and under the condition that the second resource does not exist in the first memory, if the quantity of the resources stored in the first memory does not reach the maximum storage quantity of the resources stored in the first memory, storing the second resource into the first memory, and starting to record the access times of the second resource in the first memory.

Optionally, the updating unit 502 is further configured to: under the condition that the second resource does not exist in the first memory, if the number of the resources stored in the first memory reaches the maximum storage number of the resources stored in the first memory, after the third resource in the first memory is deleted, the second resource is stored in the first memory, and the access times of the second resource in the first memory are recorded; the third resource is the resource with the minimum access times in the first memory.

Optionally, the updating unit 502 is specifically configured to: and constructing a small root heap according to the access times of each resource in the first memory, and deleting the tail end node of the small root heap.

Fig. 8 is a schematic structural diagram of an electronic device provided in the present disclosure. As shown in fig. 8, the electronic device 60 may include at least one processor 601 and a memory 602 for storing processor-executable instructions, wherein the processor 601 is configured to execute the instructions in the memory 602 to implement the data processing method in the above embodiment.

In addition, the electronic device 60 may also include a communication bus 603 and at least one communication interface 604.

Processor 601 may be a Central Processing Unit (CPU), a micro-processing unit, an ASIC, or one or more integrated circuits for controlling the execution of programs in accordance with the disclosed aspects.

Communication bus 603 may include a path that conveys information between the aforementioned components.

The communication interface 604 may be any device, such as a transceiver, for communicating with other devices or communication networks, such as an ethernet, a Radio Access Network (RAN), a Wireless Local Area Network (WLAN), etc.

The memory 602 may be, but is not limited to, a read-only memory (ROM) or other type of static storage device that may store static information and instructions, a Random Access Memory (RAM) or other type of dynamic storage device that may store information and instructions, an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disk storage, optical disk storage (including compact disc, laser disc, optical disc, digital versatile disc, blu-ray disc, etc.), magnetic disk storage media or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. The memory may be self-contained and coupled to the processor 601 via a bus. Memory may also be integrated with the processor 601.

The memory 602 is used for storing instructions for executing the disclosed solution, and is controlled by the processor 601. The processor 601 is configured to execute instructions stored in the memory 602 to implement the functions of the disclosed method.

As an example, in conjunction with fig. 7, the functions implemented by the acquisition unit 501, the update unit 502, the determination unit 503, and the generation unit 504 in the data processing apparatus 50 are the same as those of the processor 601 in fig. 8.

In particular implementations, processor 601 may include one or more CPUs such as CPU0 and CPU1 in fig. 8 as an example.

In particular implementations, electronic device 60 may include multiple processors, such as processor 601 and processor 607 of FIG. 8, for example, as an embodiment. Each of these processors may be a single-core (single-CPU) processor or a multi-core (multi-CPU) processor. A processor herein may refer to one or more devices, circuits, and/or processing cores for processing data (e.g., computer program instructions).

In particular implementations, electronic device 60 may also include an output device 605 and an input device 606, as one embodiment. Output device 605 is in communication with processor 601 and may display information in a variety of ways. For example, the output device 605 may be a Liquid Crystal Display (LCD), a Light Emitting Diode (LED) display device, a Cathode Ray Tube (CRT) display device, a projector (projector), or the like. The input device 606 is in communication with the processor 601 and can accept input from user objects in a variety of ways. For example, the input device 606 may be a mouse, keyboard, touch screen device, or sensing device, among others.

Those skilled in the art will appreciate that the configuration shown in fig. 8 does not constitute a limitation of the electronic device 60, and may include more or fewer components than those shown, or combine certain components, or employ a different arrangement of components.

In addition, the present disclosure also provides a computer-readable storage medium, wherein when the instructions in the computer-readable storage medium are executed by a processor of the electronic device, the electronic device is enabled to execute the data processing method provided by the above embodiment.

In addition, the present disclosure also provides a computer program product comprising computer instructions, which, when run on an electronic device, cause the electronic device to execute the data processing method provided in the above embodiments.

Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This disclosure is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.

Claims

1. A method of data processing, the method comprising:

acquiring a plurality of resources stored in a first memory and the access times of each resource in the first memory; a resource corresponds to an event accessed by a user;

updating the access times of each resource in a second memory according to the plurality of resources and the access times of each resource in the first memory; the maximum storage amount of the second memory storage resource is greater than the maximum storage amount of the first memory storage resource;

determining that an event corresponding to the target resource is a hot event under the condition that the target resource exists in the resources stored in the second memory, and generating alarm information for prompting capacity expansion; the number of times of access of the target resource in the second memory is greater than or equal to a preset threshold value.

2. The data processing method of claim 1, wherein updating the number of accesses of each resource in the second memory based on the plurality of resources and the number of accesses of each resource in the first memory comprises:

updating the sum of the number of times of access of the first resource in the first memory and the historical number of times of access of the first resource in the second memory to the number of times of access of the first resource in the second memory in the case that the first resource exists in the second memory; the first resource is any one of the plurality of resources.

3. The data processing method of claim 1, wherein the obtaining the plurality of resources stored in the first memory and the number of times each resource has access to the first memory comprises:

and acquiring a plurality of resources stored in the first memory and the access times of each resource in the first memory according to a first preset period.

4. The data processing method of claim 1, wherein the obtaining the plurality of resources stored in the first memory and the number of times each resource has access to the first memory comprises:

and acquiring a plurality of resources stored in the first memory and the access times of each resource in the first memory under the condition that the number of the resources stored in the first memory reaches the maximum storage number of the first memory storage resources.

5. The data processing method of claim 1, wherein the method further comprises:

and judging whether the target resource exists in the resources stored in the second memory according to a second preset period.

6. A data processing method according to any one of claims 1-5, characterized in that the method further comprises:

receiving an access request sent by a user account, and acquiring a second resource from the access request;

storing the second resource in the first memory and determining a number of accesses of the second resource in the first memory.

7. The data processing method of claim 6, wherein determining the number of accesses to the second resource in the first memory comprises:

if the second resource exists in the first memory, adding 1 to the number of times of access of the second resource in the first memory;

under the condition that the second resource does not exist in the first memory, if the number of the resources stored in the first memory does not reach the maximum storage number of the resources stored in the first memory, the second resource is stored in the first memory, and the access times of the second resource in the first memory are recorded.

8. The data processing method of claim 7, wherein the method further comprises:

under the condition that the second resource does not exist in the first memory, if the number of the resources stored in the first memory reaches the maximum storage number of the resources stored in the first memory, after a third resource in the first memory is deleted, the second resource is stored in the first memory, and the number of times of accessing the second resource in the first memory is recorded; the third resource is a resource with the minimum access times in the first memory.

9. The data processing method of claim 7, wherein the deleting the third resource from the first memory comprises:

and constructing a small root heap according to the access times of each resource in the first memory, and deleting the tail end node of the small root heap.

10. A data processing apparatus is characterized by comprising an acquisition unit, an updating unit, a determination unit and a generation unit;

the acquisition unit is used for acquiring a plurality of resources stored in a first memory and the access times of each resource in the first memory; a resource corresponds to an event accessed by a user;

the updating unit is used for updating the access times of each resource in the second memory according to the plurality of resources and the access times of each resource in the first memory; the maximum storage amount of the second memory storage resource is greater than the maximum storage amount of the first memory storage resource;

the determining unit is configured to determine that an event corresponding to the target resource is a hot event when the target resource exists in the resources stored in the second memory, where the number of times of access of the target resource in the second memory is greater than or equal to a preset threshold;

and the generating unit is used for generating alarm information for prompting capacity expansion after the determining unit determines that the event corresponding to the target resource is a hot event.

11. An electronic device, comprising: a processor, a memory for storing instructions executable by the processor; wherein the processor is configured to execute instructions to implement the data processing method of any one of claims 1-9.

12. A computer-readable storage medium having instructions stored thereon, wherein the instructions in the computer-readable storage medium, when executed by a processor of an electronic device, enable the electronic device to perform the data processing method of any one of claims 1-9.

13. A computer program product, characterized in that the computer program product comprises computer instructions which, when executed by a processor, implement the data processing method according to any one of claims 1-9.