CN112988407B - Data processing method and device, electronic equipment and computer readable storage medium - Google Patents
Data processing method and device, electronic equipment and computer readable storage medium Download PDFInfo
- Publication number
- CN112988407B CN112988407B CN201911291699.0A CN201911291699A CN112988407B CN 112988407 B CN112988407 B CN 112988407B CN 201911291699 A CN201911291699 A CN 201911291699A CN 112988407 B CN112988407 B CN 112988407B
- Authority
- CN
- China
- Prior art keywords
- processed
- resource information
- information
- resource
- data processing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 32
- 238000012545 processing Methods 0.000 claims abstract description 67
- 238000000034 method Methods 0.000 claims abstract description 10
- 238000004590 computer program Methods 0.000 claims description 8
- 239000004744 fabric Substances 0.000 claims description 6
- 230000008569 process Effects 0.000 claims description 5
- 230000008520 organization Effects 0.000 description 57
- 238000010586 diagram Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/544—Buffers; Shared memory; Pipes
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the application provides a data processing method and device, electronic equipment and a computer readable storage medium, and relates to the technical field of data processing. In the embodiment of the present application, first, resource information to be processed is acquired. And secondly, putting the resource information to be processed into a shared structural body, and judging whether a parent resource corresponding to the resource information to be processed exists in the shared structural body. And then, marking the resource information to be processed as a push-able state when the parent resource corresponding to the resource information to be processed does not exist. By the method, the data processing efficiency can be improved.
Description
Technical Field
The present invention relates to the field of data processing technologies, and in particular, to a data processing method and apparatus, an electronic device, and a computer readable storage medium.
Background
The resources under the security platform have the concepts of parent resources and child resources. When the shared resource is pushed between the security platforms, the parent resource is preferably pushed first and then the child resource is preferably pushed, so that errors caused by the fact that the parent resource cannot be found when the platform processes the information of the child resource are avoided. When the multithreading processing resource is pushed, it cannot be confirmed that the thread which starts processing first is completed. In order to ensure the pushing sequence, the prior implementation scheme generally classifies resources, and before pushing, organizations, cameras and alarm sources/voice outputs are distinguished. All organizations are pushed by single threads (so as to avoid organization level pushing errors), after all organizations are pushed, cameras are pushed by multiple threads, and when all cameras are pushed, alarm sources/voice outputs are pushed.
In the prior art, in the above-mentioned mode of processing organizations specifically as a class of resources, the push sequence needs to be ensured due to the hierarchical relationship among the organizations, so that only single thread push can be performed. When the organization number is large, the performance of the resource pushing is reduced greatly, so that the problem of low data processing efficiency exists.
Disclosure of Invention
In view of the foregoing, it is an object of the present application to provide a data processing method and apparatus, an electronic device, and a computer readable storage medium, which improve the problems in the prior art.
In order to achieve the above purpose, the embodiment of the present application adopts the following technical scheme:
a data processing method, comprising:
acquiring resource information to be processed;
putting the resource information to be processed into a shared structure body, and judging whether a parent resource corresponding to the resource information to be processed exists in the shared structure body;
and if the parent resource corresponding to the resource information to be processed does not exist, marking the resource information to be processed as a push-able state.
In a preferred option of the embodiment of the present application, the shared fabric includes a processing node and a processing chain corresponding to the processing node, and the step of marking the resource information to be processed as a pushable state includes:
and pointing the state chain corresponding to the resource information to be processed to a processing node, and adding the resource information to be processed into the processing chain.
In a preferred option of the embodiment of the present application, the data processing method further includes:
and pushing the at least one piece of resource information marked as the pushable state.
In a preferred option of the embodiment of the present application, the step of pushing the at least one resource information marked as a pushable state includes:
and pushing at least one piece of resource information included in the processing chain.
In a preferred option of the embodiment of the present application, the data processing method further includes:
and deleting the node corresponding to the processed resource information from the shared structure body after the pushing process is completed.
In a preferred option of the embodiment of the present application, the data processing method further includes:
and if the parent resource corresponding to the resource information to be processed exists, marking the resource information to be processed as a non-pushable state.
In a preferred option of the embodiment of the present application, the shared fabric includes a waiting node and a waiting chain corresponding to the waiting node, and the step of marking the resource information to be processed as a non-pushable state includes:
and pointing the state chain corresponding to the resource information to be processed to a waiting node, and adding the resource information to be processed into the waiting chain.
The embodiment of the application also provides a data processing device, which comprises:
the information acquisition module is used for acquiring the resource information to be processed;
the judging module is used for placing the resource information to be processed into a shared structural body and judging whether a parent resource corresponding to the resource information to be processed exists in the shared structural body or not;
and the information marking module is used for marking the resource information to be processed as a push-able state when the parent resource corresponding to the resource information to be processed does not exist.
The embodiment of the application also provides electronic equipment, which comprises a memory and a processor, wherein the processor is used for executing an executable computer program stored in the memory so as to realize the data processing method.
The embodiment of the application also provides a computer readable storage medium, on which a computer program is stored, which when executed implements the steps of the data processing method described above.
According to the data processing method and device, the electronic equipment and the computer readable storage medium, the resource information to be processed of the corresponding parent resource does not exist in the shared structure body is marked as the pushable state, so that the resource information to be processed is uniformly processed, only the parent-child constraint relation among the resource information is considered, and the problem of low data processing efficiency caused by independent processing of organization information in the prior art is avoided.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the embodiments will be briefly described below, it being understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered limiting the scope, and that other related drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a block diagram of an electronic device according to an embodiment of the present application.
Fig. 2 is a flow chart of a data processing method according to an embodiment of the present application.
Fig. 3 is another flow chart of a data processing method according to an embodiment of the present application.
Fig. 4 is a block diagram of a data processing apparatus according to an embodiment of the present application.
Icon: 10-an electronic device; 12-memory; 14-a processor; 100-a data processing device; 110-an information acquisition module; 120-judging module; 130-information tagging module.
Detailed Description
For the purposes of making the objects, technical solutions and advantages of the embodiments of the present application more clear, the technical solutions of the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is apparent that the described embodiments are some embodiments of the present application, but not all embodiments. The components of the embodiments of the present application, which are generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations.
Thus, the following detailed description of the embodiments of the present application, as provided in the accompanying drawings, is not intended to limit the scope of the application, as claimed, but is merely representative of selected embodiments of the application. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the present disclosure.
It should be noted that: like reference numerals and letters denote like items in the following figures, and thus once an item is defined in one figure, no further definition or explanation thereof is necessary in the following figures.
As shown in fig. 1, an embodiment of the present application provides an electronic device 10. The electronic device 10 may include, among other things, a memory 12, a processor 14, and a data processing apparatus 100.
In detail, the memory 12 and the processor 14 are directly or indirectly electrically connected to each other to realize data transmission or interaction. For example, electrical connection may be made to each other via one or more communication buses or signal lines. The data processing device 100 comprises at least one software functional module which may be stored in the memory 12 in the form of software or firmware (firmware). The processor 14 is configured to execute executable computer programs stored in the memory 12, for example, software functional modules and computer programs included in the data processing apparatus 100, so as to implement a data processing method.
The Memory 12 may be, but is not limited to, a random access Memory (Random Access Memory, RAM), a Read Only Memory (ROM), a programmable Read Only Memory (Programmable Read-Only Memory, PROM), an erasable Read Only Memory (Erasable Programmable Read-Only Memory, EPROM), an electrically erasable Read Only Memory (Electric Erasable Programmable Read-Only Memory, EEPROM), etc.
The processor 14 may be an integrated circuit chip having signal processing capabilities. The processor 14 may be a general-purpose processor including a central processing unit (Central Processing Unit, CPU), a network processor (Network Processor, NP), a System on Chip (SoC), etc.
It is to be understood that the configuration shown in fig. 1 is illustrative only, and that the electronic device 10 may also include more or fewer components than shown in fig. 1, or have a different configuration than shown in fig. 1.
With reference to fig. 2, an embodiment of the present application further provides a data processing method applicable to the electronic device 10. The method steps defined by the flow related to the data processing method may be implemented by the electronic device 10, and the specific flow shown in fig. 2 will be described in detail below.
Step S110, obtaining the resource information to be processed.
In this embodiment of the present application, the resource information to be processed may have multiple acquisition manners, for example, may be obtained through data input by a user.
Step S120, putting the resource information to be processed into a shared structure, and determining whether a parent resource corresponding to the resource information to be processed exists in the shared structure, if not, executing step S130.
In this embodiment of the present application, after the resource information to be processed is obtained in step S110, the resource information to be processed may be put into a shared structure body, and it is determined whether there is a parent resource corresponding to the resource information to be processed in the shared structure body.
And step S130, marking the resource information to be processed as a push-able state.
In this embodiment of the present application, after determining, in step S120, whether there is a parent resource corresponding to the resource information to be processed in the shared structure, when there is no parent resource corresponding to the resource information to be processed, the resource information to be processed may be marked as a pushable state.
By the method, the resource information to be processed, which does not have the corresponding parent resource in the shared structure body, is marked as the push-able state, so that the resource information to be processed is uniformly processed, only the parent-child constraint relation among the resource information is considered, and the problem of low data processing efficiency caused by independent processing of organization information in the prior art is avoided.
For step S110, it should be noted that the specific kind of the resource information is not limited, and may be set according to the actual application requirement.
For example, in an alternative example, the resource information may include organization information. The organization information is a virtual resource type, which is equivalent to a folder, and is convenient for managing the resource information. For example, the name of the first organization information is B city C district D street and the code is 3301000000132000. The name of the second organization information is city B, district C, street D, way E, and the code is 33010000001320000001. The name of the third organization information is B city C region, and the code is 330100000013. Thus, the second organization information is a child resource of the first organization information, and the third organization information is a parent resource of the first organization information.
For another example, in another alternative example, the resource information may include camera information. For example, the name of the first camera information is the first camera of the D street in B city, C district, and the code is 3301000000132000a. The name of the second camera information is the second camera of the street E in the B city, C, D, and the code is 33010000001320000001a. The name of the third camera information is the third camera in the C area of B and the code is 330100000013A. Moreover, it should be noted that the camera information may be a sub-resource of the organization information, and the first camera information may be a sub-resource of the first organization information, which indicates that the first camera is located in a B city C district D street corresponding to the first organization information. The second camera information may be a sub-resource of the second organization information, which indicates that the second camera is located on a B city C district D street E road corresponding to the second organization information. The third camera information may be a sub-resource of the third organization information, which indicates that the third camera is located in B city C area corresponding to the third organization information. The first camera information, the second camera information and the third camera information may be sub-resources of the third organization, which indicates that the first camera, the second camera and the third camera are located in B city C area corresponding to the third organization information.
For another example, in another alternative, the resource information may include alert source information. The alarm source information is a resource type which is virtualized and can represent the position where the alarm signal is sent. For example, the first alert source information may represent a B city C district D street first alert signal, encoded as 3301000000132000B. The second alert source information may represent a B city C district D street E second alert signal encoded as 33010000001320000001B. The third alert source information may represent a third alert signal in B city, C region, encoded 330100000013B. Moreover, it should be noted that the alert source information may be a sub-resource of the camera information, and the first alert source information may be a sub-resource of the first camera information, which indicates that the first alert signal is sent from a street in B city C district D. The second alert source information may be a sub-resource of the second camera information indicating that the second alert signal was sent from street E in district B, city C. The third alert source information may be a sub-resource of the third camera information indicating that the third alert signal was sent from B city C. The first, second and third alert source information may be sub-resources of the third camera information, indicating that the first, second and third alert signals are issued from B-C region.
As another example, in another alternative, the resource information may include voice information. For example, the first voice information may represent a B city C district D street first voice signal, the code being 3301000000132000C. The second voice information may represent a B city C district D street E second voice signal encoded 33010000001320000001C. The third speech information may represent a B city C region third speech signal encoded 330100000013C. Furthermore, it should be noted that the voice information may be a sub-resource of the camera information, and the first voice information may be a sub-resource of the first camera information, which indicates that the first voice signal is sent from a street in B city, C district, D. The second voice information may be a sub-resource of the second camera information, indicating that the second alert signal was issued from street E in district C of city B. The third voice information may be a sub-resource of the third camera information, indicating that the third alert signal is sent from B city C. The first voice information, the second voice information and the third voice information may be sub-resources of the third camera information, indicating that the first alarm signal, the second alarm signal and the third alarm signal are sent from B city C.
That is, the camera information may be a sub-resource of the organization information, and the alert source information and the voice information may be sub-resources of the camera information.
In step S120, it should be noted that, in the prior art, the organization information is specially processed as a type of resource information, and because there is a hierarchical relationship between the organization information, in order to ensure the pushing sequence, only single-thread pushing is performed. When the amount of organization information is large, the performance of resource pushing is much degraded. In the prior art, the scheme has low expandability, when the resource types with father-son relationship are redefined in the protocol, the processing logic of newly added resource information needs to be reset, and when the types of the resource information needing batch pushing are more, the resource pushing performance is also reduced. The scheme in the prior art is not high enough in concurrency, when one organization information is pushed, all camera information under the organization information can be actually pushed, but the scheme in the prior art needs to wait for pushing all the organization information and then pushing the camera information.
The embodiment of the application provides a method capable of multithreading pushing resource information and guaranteeing pushing sequence, which comprises the steps of designing a new data structure, expressing constraint relation of parent-child resources in a memory, and recording whether the resources are in a state capable of being pushed. Judging according to the relation between the resource information, changing the state of the resource information in real time, realizing high-concurrency resource information pushing, and simultaneously ensuring that the parent resource is pushed first and then the child resource is pushed. The type of the resource information is not concerned in the data structure, and only the father-son constraint relation among the resource information is concerned, so that the subsequent expansion is convenient. The embodiment of the application designs a new data structure (hereinafter referred to as a shared structure body) and can show the parent-child relationship between the resource information and the state of the resource (whether pushing can be performed). Before pushing the resource information, the resource information is put into a shared structure body in the memory, and then taken out from the shared structure body for processing.
The specific manner of determining whether the parent resource corresponding to the resource information to be processed exists in the shared structure body is not limited, and the setting can be performed according to actual application requirements.
For example, in an alternative example, step S120 may include the sub-steps of:
first, the encoding of all resource information in the shared fabric is acquired. And secondly, comparing the codes of the parent resources corresponding to the resource information to be processed with the codes of all the resource information, and judging whether the parent resources corresponding to the resource information to be processed exist.
Further, after determining whether the parent resource corresponding to the resource information to be processed exists in the shared structure in step S120, the resource information to be processed may be marked as a pushable state when the parent resource corresponding to the resource information to be processed does not exist.
Optionally, the specific way of marking the resource information to be processed as the pushable state is not limited, and may be set according to actual application requirements.
For example, in an alternative example, the shared fabric includes a processing node and a processing chain corresponding to the processing node, and step S130 may include the following sub-steps:
and pointing the state chain corresponding to the resource information to be processed to a processing node, and adding the resource information to be processed into the processing chain.
It should be noted that, for each piece of resource information to be processed, the resource information to be processed may correspond to a state chain, and the state chain may include a parent chain, a child chain, a sibling chain, and shared resource information corresponding to the resource information to be processed. The shared resource information may include the resource information to be processed and the codes of the corresponding parent resource, child resource and sibling resource.
Further, after the marking of the resource information to be processed is completed, the data processing method may further comprise the sub-steps of:
and pushing the at least one piece of resource information marked as the pushable state.
That is, in the embodiment of the present application, unified pushing may be performed on the resource information, and resource information in a pushable state may be processed concurrently.
Optionally, the specific manner of pushing the at least one resource information marked as the pushable state is not limited, and may be set according to actual application requirements.
For example, in an alternative example, the step of pushing the at least one resource information marked as a pushable state may comprise the sub-steps of:
and pushing at least one piece of resource information included in the processing chain.
When the pushing is started, the node corresponding to the resource information may be pushed on the processing chain concurrently. For example, the processing chain may include organization information 1 (a province), organization information 2 (a province B city), organization information 3 (a province B city C city), organization information 4 (a province B city D region), organization information 5 (a province B city E region), camera information 1 (a province B city D region camera 01), camera information 2 (a province B city D region camera 02), camera information 3 (a province B city D region camera 03), alert source information 1 (a province B city D region camera 01 alert source 01), alert source information 2 (a province B city D region camera 01 alert source 02), voice information 1 (a province B city D region camera 01 voice 01), and voice information 2 (a province B city D region camera 01 voice 02).
The organization information 2 and the organization information 3 are sub-resources of the organization information 1, the organization information 2 and the organization information 3 are brother resources, the organization information 4 and the organization information 5 are sub-resources of the organization information 2, and the organization information 4 and the organization information 5 are brother resources. Camera information 1, camera information 2, and camera information 3 are child resources of organization information 4, and camera information 1, camera information 2, and camera information 3 are sibling resources to each other. The alarm source information 1 and the alarm source information 2 are sub-resources of the camera information 1, and the alarm source information 1 and the alarm source information 2 are brother resources. Voice information 1 and voice information 2 are child resources of camera information 1, and voice information 1 and voice information 2 are sibling resources to each other.
When the pushing processing of the resource information included in the processing chain is started, the organization information 1 is processed, the organization information 1 is in a processing state, and the rest of the resource information is in a waiting state. After the processing of the organization information 1 is completed, the sub-resources of the organization information 1, namely the organization information 2 and the organization information 3, are changed to the processing state to start the processing. After the processing of the organization information 2 is completed, the sub-resources of the organization information 2, namely the organization information 4 and the organization information 5, are changed to the processing state to start the processing, and the processing of the organization information 3 is not required to be waited for, so that the multithreading processing can be performed.
Further, the data processing method may further comprise the sub-steps of:
and deleting the node corresponding to the processed resource information from the shared structure body after the pushing process is completed.
That is, after the push is completed, the node corresponding to the processed resource information may be deleted from the shared structure. When deleting the node corresponding to the resource information, judging whether the resource information has the sub-resource according to the sub-link in the state chain corresponding to the resource information, if so, moving all the nodes corresponding to the sub-resource and the brother resource of the sub-resource from the waiting chain to the processing chain, and then continuing to process the nodes on the processing chain concurrently.
Further, after determining, in step S120, whether there is a parent resource corresponding to the resource information to be processed in the shared structure, when there is a parent resource corresponding to the resource information to be processed, in conjunction with fig. 3, the data processing method may further include step S140.
And step S140, marking the resource information to be processed as a non-pushable state.
Optionally, the specific manner of marking the resource information to be processed as the non-pushable state is not limited, and may be set according to actual application requirements.
For example, in an alternative example, the shared fabric includes a waiting node and a waiting chain corresponding to the waiting node, and the step of marking the resource information to be processed as a non-pushable state may include the following substeps:
and pointing the state chain corresponding to the resource information to be processed to a waiting node, and adding the resource information to be processed into the waiting chain.
It should be noted that, when the parent resource corresponding to the resource information to be processed exists in the shared structure body, the parent chain in the state chain corresponding to the resource information to be processed may point to the node where the parent resource is located, and the state chain points to the waiting node, so as to mark that the resource is temporarily not pushable. If the parent resource does not have a corresponding child resource, a child chain in the state chain corresponding to the parent resource may be directed to the current node, and if the parent resource has a corresponding child resource, a sibling chain in the state chain corresponding to the parent resource may be directed to the current node.
With reference to fig. 4, an embodiment of the present invention further provides a data processing apparatus 100, which may be applied to the electronic device 10 described above. The data processing apparatus 100 may include an information acquisition module 110, a judgment module 120, and an information marking module 130.
The information obtaining module 110 is configured to obtain resource information to be processed. In this embodiment, the information obtaining module 110 may be used to perform step S110 shown in fig. 2, and the related content of the information obtaining module 110 may refer to the foregoing detailed description of step S110.
The judging module 120 is configured to put the resource information to be processed into a shared structure body, and judge whether a parent resource corresponding to the resource information to be processed exists in the shared structure body. In this embodiment, the determining module 120 may be configured to perform step S120 shown in fig. 2, and the related content of the determining module 120 may refer to the foregoing detailed description of step S120.
The information marking module 130 is configured to mark the resource information to be processed as a pushable state when the parent resource corresponding to the resource information to be processed does not exist. In this embodiment, the information marking module 130 may be used to perform step S130 shown in fig. 2, and the related content of the information marking module 130 may refer to the foregoing detailed description of step S130.
In an embodiment of the present application, corresponding to the above-mentioned data processing method, there is also provided a computer readable storage medium, in which a computer program is stored, which executes the steps of the above-mentioned data processing method when running.
The steps executed when the computer program runs are not described in detail herein, and reference may be made to the explanation of the data processing method.
In summary, according to the data processing method and apparatus, the electronic device, and the computer readable storage medium provided in the embodiments of the present application, the resource information to be processed, where no corresponding parent resource exists in the shared structure, is marked as a pushable state, so that the resource information to be processed is uniformly processed, and only the parent-child constraint relationship between the resource information is considered, so that the problem of low efficiency of data processing caused by separately processing the organization information in the prior art is avoided.
The foregoing description is only of the preferred embodiments of the present application and is not intended to limit the same, but rather, various modifications and variations may be made by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principles of the present application should be included in the protection scope of the present application.
Claims (8)
1. A method of data processing, comprising:
acquiring resource information to be processed;
putting the resource information to be processed into a shared structure body, and judging whether a parent resource corresponding to the resource information to be processed exists in the shared structure body;
if the parent resource corresponding to the resource information to be processed does not exist, marking the resource information to be processed as a pushable state, and pushing at least one piece of resource information marked as the pushable state;
the shared structure body comprises a processing node and a processing chain corresponding to the processing node, and the step of marking the resource information to be processed as a pushable state comprises the following steps:
and pointing the state chain corresponding to the resource information to be processed to a processing node, and adding the resource information to be processed into the processing chain.
2. The data processing method according to claim 1, wherein the step of performing push processing on at least one resource information marked as a push-able state includes:
and pushing at least one piece of resource information included in the processing chain.
3. The data processing method according to claim 1, wherein the data processing method further comprises:
and deleting the node corresponding to the processed resource information from the shared structure body after the pushing process is completed.
4. The data processing method according to claim 1, wherein the data processing method further comprises:
and if the parent resource corresponding to the resource information to be processed exists, marking the resource information to be processed as a non-pushable state.
5. The data processing method according to claim 4, wherein the shared fabric includes a waiting node and a waiting chain corresponding to the waiting node, and the step of marking the resource information to be processed as a non-pushable state includes:
and pointing the state chain corresponding to the resource information to be processed to a waiting node, and adding the resource information to be processed into the waiting chain.
6. A data processing apparatus, comprising:
the information acquisition module is used for acquiring the resource information to be processed;
the judging module is used for placing the resource information to be processed into a shared structural body and judging whether a parent resource corresponding to the resource information to be processed exists in the shared structural body or not;
the information marking module is used for marking the resource information to be processed as a pushable state when the parent resource corresponding to the resource information to be processed does not exist, and pushing at least one piece of resource information marked as the pushable state;
the shared structure body comprises a processing node and a processing chain corresponding to the processing node, and the information marking module is specifically used for:
and pointing the state chain corresponding to the resource information to be processed to a processing node, and adding the resource information to be processed into the processing chain.
7. An electronic device comprising a memory and a processor for executing an executable computer program stored in the memory to implement the data processing method of any of claims 1-5.
8. A computer-readable storage medium, on which a computer program is stored, which program, when executed, carries out the steps of the data processing method according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911291699.0A CN112988407B (en) | 2019-12-16 | 2019-12-16 | Data processing method and device, electronic equipment and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911291699.0A CN112988407B (en) | 2019-12-16 | 2019-12-16 | Data processing method and device, electronic equipment and computer readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112988407A CN112988407A (en) | 2021-06-18 |
| CN112988407B true CN112988407B (en) | 2024-04-05 |
Family
ID=76343105
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911291699.0A Active CN112988407B (en) | 2019-12-16 | 2019-12-16 | Data processing method and device, electronic equipment and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112988407B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115314458A (en) * | 2022-07-05 | 2022-11-08 | 深圳手回科技集团有限公司 | Message pushing method and device, electronic equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102902573A (en) * | 2012-09-20 | 2013-01-30 | 北京搜狐新媒体信息技术有限公司 | Task processing method and device based on shared resources |
| CN110191143A (en) * | 2018-12-13 | 2019-08-30 | 浙江宇视科技有限公司 | A kind of resource issuing method, apparatus and system |
| CN110321210A (en) * | 2019-06-28 | 2019-10-11 | 京东数字科技控股有限公司 | Data processing method, device, computer-readable medium and electronic equipment |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10298512B2 (en) * | 2015-06-26 | 2019-05-21 | Vmware, Inc. | System and method for performing resource allocation for a host computer cluster |
-
2019
- 2019-12-16 CN CN201911291699.0A patent/CN112988407B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102902573A (en) * | 2012-09-20 | 2013-01-30 | 北京搜狐新媒体信息技术有限公司 | Task processing method and device based on shared resources |
| CN110191143A (en) * | 2018-12-13 | 2019-08-30 | 浙江宇视科技有限公司 | A kind of resource issuing method, apparatus and system |
| CN110321210A (en) * | 2019-06-28 | 2019-10-11 | 京东数字科技控股有限公司 | Data processing method, device, computer-readable medium and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112988407A (en) | 2021-06-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108984388B (en) | Method and terminal equipment for generating automatic test case | |
| CN111639287A (en) | Page processing method and device, terminal equipment and readable storage medium | |
| CN110471746B (en) | Distributed transaction callback method, device and system | |
| CN105528257B (en) | Single-process data processing method and device | |
| CN111291292A (en) | Page rendering method and device, terminal equipment and storage medium | |
| CN110636124B (en) | VPP cluster management method and device, electronic equipment and storage medium | |
| CN110609755A (en) | Message processing method, device, equipment and medium for cross-block chain node | |
| CN104750585A (en) | Terminal detecting method and terminal detecting device | |
| CN112988407B (en) | Data processing method and device, electronic equipment and computer readable storage medium | |
| CN112084068A (en) | Database remote backup method and device and cloud server | |
| CN111694677A (en) | Message queue management method, device, terminal and computer-readable storage medium | |
| CN113658351B (en) | Method and device for producing product, electronic equipment and storage medium | |
| CN111240850A (en) | Function calling method and device, electronic equipment and storage medium | |
| CN111190607B (en) | Task plugin processing method and device, task scheduling server and storage medium | |
| CN113127155A (en) | Embedded software modeling method and device | |
| CN111135559B (en) | Game data processing method and device, electronic equipment and storage medium | |
| CN113691972A (en) | Service configuration method and device of android system | |
| CN106959806B (en) | Page identity obtaining method and device | |
| CN115202662A (en) | Code checking method under weak memory order architecture and corresponding equipment | |
| CN111240956A (en) | Memory leakage monitoring method and device, electronic equipment and computer storage medium | |
| CN110908644A (en) | Configuration method and device of state node, computer equipment and storage medium | |
| CN113946380B (en) | Picture loading method and device and video processing equipment | |
| CN110597607B (en) | Execution method and device of asynchronous application program, storage medium and electronic equipment | |
| CN110740048B (en) | Network request processing method and device based on iOS network | |
| CN114996214A (en) | Data processing method, device, equipment and medium based on ktr file |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |