CN116304079A - Timing-based profile data management method, apparatus, and readable storage medium - Google Patents
Timing-based profile data management method, apparatus, and readable storage medium Download PDFInfo
- Publication number
- CN116304079A CN116304079A CN202211730576.4A CN202211730576A CN116304079A CN 116304079 A CN116304079 A CN 116304079A CN 202211730576 A CN202211730576 A CN 202211730576A CN 116304079 A CN116304079 A CN 116304079A
- Authority
- CN
- China
- Prior art keywords
- data
- instruction
- determining
- node data
- type
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 45
- 238000013523 data management Methods 0.000 title claims abstract description 40
- 238000012545 processing Methods 0.000 claims abstract description 22
- 238000012217 deletion Methods 0.000 claims description 16
- 230000037430 deletion Effects 0.000 claims description 16
- 238000010586 diagram Methods 0.000 abstract description 18
- 238000013500 data storage Methods 0.000 abstract description 12
- 230000003068 static effect Effects 0.000 abstract description 9
- 230000004044 response Effects 0.000 abstract description 6
- 230000000875 corresponding effect Effects 0.000 description 85
- 238000004590 computer program Methods 0.000 description 7
- 230000008569 process Effects 0.000 description 6
- 238000004891 communication Methods 0.000 description 5
- 238000012986 modification Methods 0.000 description 5
- 230000004048 modification Effects 0.000 description 5
- 230000000694 effects Effects 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 230000009471 action Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 2
- 238000010223 real-time analysis Methods 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000002596 correlated effect Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/36—Creation of semantic tools, e.g. ontology or thesauri
- G06F16/367—Ontology
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/33—Querying
- G06F16/3331—Query processing
- G06F16/334—Query execution
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Animal Behavior & Ethology (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
Disclosed herein are a timing-based profile data management method, a timing-based profile data management apparatus, and a computer-readable storage medium, the method including: when receiving a database operation instruction, generating an instruction to be handled based on an operation type corresponding to the operation instruction; adding the to-be-handled instruction to a corresponding cache queue, wherein the cache queue comprises an adding queue, a deleting queue and a query queue; based on the time sequence information of the instructions to be handled, the instructions to be handled in the cache queue are processed, so that the technical problems that in the related art, the response time of a static diagram database is long and the efficiency is low when data query and data storage are executed are effectively solved, the parallel processing of different types of data is realized, mutual interference is avoided, conflicts are avoided, and the efficiency of data storage and map generation is improved.
Description
Technical Field
The present application relates to the field of data management, and more particularly, to a time-series-based profile data management method, a time-series-based profile data management apparatus, and a computer-readable storage medium.
Background
The knowledge graph is based on application and realization of a data network technology framework, and the realization is used for mapping the knowledge of the objective world from character string description to structural semantic description. Knowledge maps generally construct and manage knowledge structures in a certain domain based on entities and associations between entities, thereby realizing knowledge queries.
Analysis from multiple levels of network space to ensure network security requires analysis of network asset security, such as domain name network asset, network segment asset, internet service information leakage, etc., from various scene dimensions. A static graph database is typically used to analyze and traverse the knowledge graph. However, the static graph database only supports real-time analysis and traversal of the large graph, and the relative difference of the knowledge maps at different time points cannot be compared.
And further, the static diagram database has long response time and low efficiency when executing data query and data storage.
Disclosure of Invention
The embodiment of the application solves the technical problems of long response time and low efficiency of a static diagram database in the related technology when executing data query and data storage by providing the time sequence-based map data management method, the time sequence-based map data management device and the computer-readable storage medium, realizes the parallel processing of different types of data, does not interfere with each other, avoids conflict, and improves the efficiency of data storage and map generation.
The embodiment of the application provides a time sequence-based map data management method, which comprises the following steps:
when receiving a database operation instruction, generating an instruction to be handled based on an operation type corresponding to the operation instruction;
adding the to-be-handled instruction to a corresponding cache queue, wherein the cache queue comprises an adding queue, a deleting queue and a query queue;
and processing the instructions to be handled in the cache queue based on the time sequence information of the instructions to be handled.
Optionally, when receiving the database operation instruction, the step of generating the to-Do instruction based on the operation type corresponding to the operation instruction includes:
determining time sequence information corresponding to the operation instruction;
generating a queue identifier of the operation instruction based on the operation type and the time sequence information, wherein the operation type comprises an adding operation, a deleting operation and a query operation;
and associating the queue identifier with the operation instruction to generate the to-Do instruction.
Optionally, after the step of generating the to-Do instruction based on the operation type corresponding to the operation instruction when the database operation instruction is received, the method further includes:
when the operation type is adding data, determining data to be added corresponding to the operation instruction;
determining an identifier of the data to be added based on the data type and the scene type of the data to be added;
generating node data according to the data to be added, the time sequence information of the data to be added and the identifier, and associating the node data with the instructions to be handled.
Optionally, the step of processing the to-do instruction in the cache queue based on the timing information of the to-do instruction includes:
when the to-be-handled instruction is an adding instruction, determining the node data associated with the adding instruction;
determining a target map based on the scene information of the node data;
and determining the entity node data of which the data type is entity data in the node data, and establishing an entity table association for storing the entity node data and the time sequence information under the corresponding sub-scene according to the storage path corresponding to the identifier.
Optionally, after the step of determining that the data type is the entity node data of the entity data and establishing an entity table for storing the entity node data and the time sequence information in association under the corresponding sub-scenario according to the storage path corresponding to the identifier, the method further includes:
determining the data type as attribute node data of attribute data in the node data, and determining the entity node data corresponding to the attribute node data;
according to the storage path corresponding to the identifier of the attribute node data, establishing an attribute table in the corresponding sub-scene to store the attribute node data and the time sequence information in an associated mode;
and associating the attribute table with the entity node data.
Optionally, after the step of determining that the data type is the entity node data of the entity data and establishing an entity table for storing the entity node data and the time sequence information in association under the corresponding sub-scenario according to the storage path corresponding to the identifier, the method further includes:
determining the data type as relationship node data of relationship data in the node data, and determining the entity node data corresponding to the relationship node data;
establishing a relation table in the corresponding sub-scene to store the relation node data and the time sequence information in an associated mode according to a storage path corresponding to the identifier of the relation node data;
and associating the relation table with the entity node data.
Optionally, the step of processing the to-do instruction in the cache queue further includes:
when the instruction to be handled is a query instruction, determining a map address, a time node and a query type corresponding to the query instruction;
determining a target sub-scene according to the map address, and determining target data associated with the target sub-scene according to the query type;
and generating a corresponding message window according to the target data of which the time sequence information is matched with the time node, and outputting the message window to a client.
Optionally, the step of processing the to-do instruction in the cache queue further includes:
when the to-be-handled instruction is a deletion instruction, determining a map address and a deletion type corresponding to the query instruction;
determining a target sub-scene corresponding to the map address, and determining target data with a data type matched with the deletion type;
and releasing the association of the target data and the target sub-scene.
In addition, the present application also proposes a timing-based profile data management apparatus comprising a memory, a processor and a timing-based profile data management program stored on the memory and executable on the processor, the processor implementing the steps of the timing-based profile data management method as described above when executing the timing-based profile data management program.
Furthermore, the present application proposes a computer readable storage medium having stored thereon a timing-based profile data management program which, when executed by a processor, implements the steps of the timing-based profile data management method as described above.
One or more technical solutions provided in the embodiments of the present application at least have the following technical effects or advantages:
1. when receiving a database operation instruction, generating a to-be-handled instruction based on an operation type corresponding to the operation instruction; adding the to-be-handled instruction to a corresponding cache queue, wherein the cache queue comprises an adding queue, a deleting queue and a query queue; based on the time sequence information of the instructions to be handled, the instructions to be handled in the cache queue are processed, so that the technical problems that in the related art, the response time of a static diagram database is long and the efficiency is low when data query and data storage are executed are effectively solved, the parallel processing of different types of data is realized, mutual interference is avoided, conflicts are avoided, and the efficiency of data storage and map generation is improved.
Drawings
FIG. 1 is a flowchart of a first embodiment of a timing-based profile data management method according to the present application;
FIG. 2 is a schematic diagram of a partial flow chart in a second embodiment of a timing-based pattern data management method of the present application;
fig. 3 is a schematic diagram of a refinement flow of step S130 in a second embodiment of the timing-based map data management method of the present application;
fig. 4 is a schematic diagram of a hardware structure involved in an embodiment of the timing-based profile data management apparatus of the present application.
Detailed Description
In the related art, the static diagram database only supports real-time analysis and traversal of the large diagram, and the relative difference of the knowledge maps at different time points cannot be compared. And further, the static diagram database has long response time and low efficiency when executing data query and data storage. The main technical scheme adopted by the embodiment of the application is as follows: generating an instruction to be handled according to an operation type corresponding to the database operation instruction, and adding the instruction to be handled to a corresponding cache queue according to the operation type; and then sequentially processing the instructions to be handled in the cache queue according to the time sequence information. Thereby realizing the technical effect of improving the efficiency of data storage and map generation.
In order to better understand the above technical solution, exemplary embodiments of the present application will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present application are shown in the drawings, it should be understood that the present application may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
Example 1
An embodiment of the application discloses a timing-based map data management method, referring to fig. 1, the timing-based map data management method includes:
step S110, when a database operation instruction is received, generating a to-be-handled instruction based on an operation type corresponding to the operation instruction;
in this embodiment, when the user performs the click operation by using the terminal client and triggers the database operation action, the client sends a corresponding database operation instruction to the server. The instructions to be handled are executable instructions after being added to the cache queue.
Optionally, step S110 includes:
step S111, determining time sequence information corresponding to the operation instruction;
step S112, generating a queue identifier of the operation instruction based on the operation type and the time sequence information, wherein the operation type comprises an adding operation, a deleting operation and a query operation;
step S113, associating the queue identifier with the operation instruction to generate the to-Do instruction.
As an optional implementation manner, when receiving the database operation instruction, determining the time sequence information corresponding to the operation instruction, where the time sequence information is the time point when the client sends the operation instruction. Generating a queue identifier of the operation instruction according to the operation type and the time sequence information, associating the queue identifier with the operation instruction, and generating a corresponding to-be-handled instruction. The operation instructions comprise an adding operation, a deleting operation and a query operation.
Step S120, adding the to-be-handled instruction to a corresponding buffer queue, where the buffer queue includes an adding queue, a deleting queue, and a query queue;
as an optional implementation manner, according to the operation type corresponding to the to-be-handled instruction, the to-be-handled instruction is added to the corresponding cache queue, the to-be-handled instruction added with data is added to the adding queue, the to-be-handled instruction queried for data is added to the query queue, and the to-be-handled instruction deleted for data is added to the deleting queue.
Step S130, based on the timing information of the to-be-handled instruction, processes the to-be-handled instruction in the cache queue.
In this embodiment, the instructions to be handled in the cache queue are sequentially processed according to the timing information corresponding to the instructions to be handled. The to-be-handled instructions added to the cache queue first are processed preferentially according to the time point added to the cache queue according to the first-in first-out principle.
Optionally, step S130 includes:
step S131, when the to-be-handled instruction is a query instruction, determining a map address, a time node and a query type corresponding to the query instruction;
step S132, determining a target sub-scene according to the map address, and determining target data associated with the target sub-scene according to the query type;
step S133, according to the target data of the time node matching with the time sequence information, a corresponding message window is generated and output to the client.
As an optional implementation manner, when the instruction to be handled is a query instruction, determining a path address of a knowledge graph corresponding to the query instruction, a time node to be queried and a queried data type; the method for determining the path address is not unique, and can be the path address pointed by the query instruction directly, or can be the method for determining which sub-scenes possibly have the target field in a gray level matching mode according to the target field contained in the query instruction, and the path address of the sub-scene is used as the map address. Determining a target sub-scene according to the map address, determining corresponding entity data, relation data or attribute data under the sub-scene according to the query type, and determining the target data in the entity data, the relation data or the attribute data according to the query field contained in the query instruction. Determining target data corresponding to the time node included in the time sequence information and the query instruction, generating a corresponding message window according to the target data, and outputting the message window to the client.
Optionally, step S130 further includes:
step S134, when the to-be-handled instruction is a deletion instruction, determining a map address and a deletion type corresponding to the query instruction;
step S135, determining a target sub-scene corresponding to the map address, and determining target data with a data type matched with the deletion type;
step S136, disassociating the target data from the target sub-scene.
As an optional implementation manner, when the to-be-handled instruction is a deletion instruction, determining a path address of a sub-scene included in the deletion instruction and a data type of target data to be deleted; determining a target sub-scene according to the path address, determining to-be-deleted data which is associated with the sub-scene and has a data type matched with the deletion type, and determining target data of which the data content is matched with a target field contained in a deletion instruction in the to-be-deleted data; and (3) disassociating the target data from the sub-scene.
The technical scheme in the embodiment of the application at least has the following technical effects or advantages:
when receiving a database operation instruction, generating a to-be-handled instruction based on an operation type corresponding to the operation instruction; adding the to-be-handled instruction to a corresponding cache queue, wherein the cache queue comprises an adding queue, a deleting queue and a query queue; based on the time sequence information of the instructions to be handled, the instructions to be handled in the cache queue are processed, so that the technical problems that in the related art, the static diagram database has long response time and low efficiency when executing data query and data storage are effectively solved, and further, the parallel processing of different types of data is realized, mutual noninterference is avoided, the conflict is avoided, and the efficiency of data storage and map generation is improved.
Example two
Based on the first embodiment, a second embodiment of the present application provides a timing-based map data management method, referring to fig. 2, after step S110, further including:
step S211, when the operation type is adding data, determining data to be added corresponding to the operation instruction;
step S212, determining an identifier of the data to be added based on the data type and scene type of the data to be added;
step S213, generating node data according to the data to be added, the timing information of the data to be added, and the identifier, and associating the node data with the instructions to be handled.
In this embodiment, when data is added, the data to be added is received while the operation instruction is received, and at this time, the instruction to be handled is added to the cache queue, but the data to be added is not put to the cache queue in a following manner, so that the data processing pressure of the cache queue is reduced.
As an optional implementation manner, when the operation type is the added data, determining the data to be added corresponding to the operation instruction, generating an identifier of the data to be added based on a preset encryption mode according to the data type and the scene type of the data to be added, generating node data according to the data to be added, the time sequence information of the data to be added and the identifier, and associating the node data with the instructions to be handled. Meanwhile, the node data is stored in the reserved cache space, and the corresponding node data is cleared after the data adding action is completed.
Optionally, referring to fig. 3, step S130 further includes:
step S220, when the to-be-handled instruction is an adding instruction, determining the node data associated with the adding instruction;
step S230 of determining a target map based on the scene information of the node data;
step S240, determining the entity node data with the data type being entity data, and establishing an entity table for storing the entity node data and the time sequence information in association under the corresponding sub-scenario according to the storage path corresponding to the identifier.
In this embodiment, the add instruction is a to-be-handled instruction corresponding to an add data operation, and processes the add instruction in the buffer queue, and after determining the node data, the add instruction preferentially adds entity data in the node data, and then adds relationship data and attribute data corresponding to the entity data.
When the to-be-handled instruction is an adding instruction, determining node data associated with the to-be-handled instruction, determining a main scene and a sub scene, namely a target scene, according to a scene type corresponding to the node data, preferentially adding the node data with the data type being entity data, and establishing an entity table in the corresponding sub scene to store the entity node data and the time sequence information in an associated mode according to a storage path corresponding to the identifier.
Optionally, after step S240, the method includes:
step S251, determining that the data type is attribute node data of attribute data in the node data, and determining the entity node data corresponding to the attribute node data;
step S253, according to the storage path corresponding to the identifier of the attribute node data, establishing an attribute table in the corresponding sub-scene to store the attribute node data and the time sequence information in an associated mode;
step S253, associating the attribute table with the entity node data.
As an optional implementation manner, after determining the entity data, determining attribute node data with the data type being attribute data in the node data, and determining entity node data to which the attribute node data belongs; determining a corresponding storage path according to an identifier of the attribute node data, establishing an attribute table under a sub-scene corresponding to the storage path, and storing the attribute node data and the time sequence information in the attribute table in an associated mode; and establishing an association relation between the attribute table and the corresponding entity node data.
Optionally, after step S240, the method includes:
step S261, determining the data type as relationship node data of relationship data in the node data, and determining the entity node data corresponding to the relationship node data;
step S262, according to the storage path corresponding to the identifier of the relational node data, establishing a relational table in the corresponding sub-scene to store the relational node data and the time sequence information in a correlated way;
step S263, associating the relationship table with the entity node data.
As an optional implementation manner, after determining the entity data, determining the relationship node data with the data type being the relationship data in the node data, and determining the entity node data corresponding to the relationship node data; determining a corresponding storage path according to an identifier of the relational node data, establishing a relational table under a sub-scene corresponding to the storage path, and storing the relational node data and the time sequence information in the relational table in an associated mode; and establishing an association relation between the relation table and the corresponding entity node data.
The technical scheme in the embodiment of the application at least has the following technical effects or advantages:
when the operation type is the added data, determining the data to be added corresponding to the operation instruction; determining an identifier of the data to be added based on the data type and the scene type of the data to be added; generating node data according to the data to be added, the time sequence information of the data to be added and the identifier, and associating the node data with the instructions to be handled; when the adding instruction is processed, determining node data associated with the adding instruction, storing entity node data, and then processing attribute node data and relationship node data. Therefore, the technical problems of large calculated amount and large resources occupied by the adding process in the related technology when the data is added are effectively solved, the efficiency of the adding process is further improved, and the calculation power consumption of the adding process is reduced.
The application further provides a time-sequence-based map data management device, and referring to fig. 4, fig. 4 is a schematic structural diagram of the time-sequence-based map data management device of the hardware operation environment according to the embodiment of the application.
As shown in fig. 4, the timing-based profile data management apparatus may include: a processor 1001, such as a central processing unit (Central Processing Unit, CPU), a communication bus 1002, a user interface 1003, a network interface 1004, a memory 1005. Wherein the communication bus 1002 is used to enable connected communication between these components. The user interface 1003 may include a Display, an input unit such as a Keyboard (Keyboard), and the optional user interface 1003 may further include a standard wired interface, a wireless interface. The network interface 1004 may optionally include a standard wired interface, a WIreless interface (e.g., a WIreless-FIdelity (WI-FI) interface). The Memory 1005 may be a high-speed random access Memory (Random Access Memory, RAM) Memory or a stable nonvolatile Memory (NVM), such as a disk Memory. The memory 1005 may also optionally be a storage device separate from the processor 1001 described above.
It will be appreciated by those skilled in the art that the structure shown in fig. 4 does not constitute a limitation of the timing-based profile data management apparatus, and may include more or fewer components than shown, or certain components may be combined, or a different arrangement of components.
Optionally, the memory 1005 is electrically connected to the processor 1001, and the processor 1001 may be configured to control the operation of the memory 1005, and may also read data in the memory 1005 to implement timing-based profile data management.
Alternatively, as shown in fig. 4, an operating system, a data storage module, a network communication module, a user interface module, and a timing-based profile data management program may be included in the memory 1005 as one storage medium.
Optionally, in the timing-based profile data management apparatus shown in fig. 4, the network interface 1004 is mainly used for data communication with other apparatuses; the user interface 1003 is mainly used for data interaction with a user; the processor 1001, the memory 1005 in the timing-based profile data management apparatus of the present application may be provided in the timing-based profile data management apparatus.
As shown in fig. 4, the timing-based profile data management apparatus invokes a timing-based profile data management program stored in a memory 1005 through a processor 1001, and performs the related step operations of the timing-based profile data management method provided in the embodiment of the present application:
when receiving a database operation instruction, generating an instruction to be handled based on an operation type corresponding to the operation instruction;
adding the to-be-handled instruction to a corresponding cache queue, wherein the cache queue comprises an adding queue, a deleting queue and a query queue;
and processing the instructions to be handled in the cache queue based on the time sequence information of the instructions to be handled.
Optionally, the processor 1001 may call a timing-based profile data management program stored in the memory 1005, and further perform the following operations:
determining time sequence information corresponding to the operation instruction;
generating a queue identifier of the operation instruction based on the operation type and the time sequence information, wherein the operation type comprises an adding operation, a deleting operation and a query operation;
and associating the queue identifier with the operation instruction to generate the to-Do instruction.
Optionally, the processor 1001 may call a timing-based profile data management program stored in the memory 1005, and further perform the following operations:
when the operation type is adding data, determining data to be added corresponding to the operation instruction;
determining an identifier of the data to be added based on the data type and the scene type of the data to be added;
generating node data according to the data to be added, the time sequence information of the data to be added and the identifier, and associating the node data with the instructions to be handled.
Optionally, the processor 1001 may call a timing-based profile data management program stored in the memory 1005, and further perform the following operations:
when the to-be-handled instruction is an adding instruction, determining the node data associated with the adding instruction;
determining a target map based on the scene information of the node data;
and determining the entity node data of which the data type is entity data in the node data, and establishing an entity table association for storing the entity node data and the time sequence information under the corresponding sub-scene according to the storage path corresponding to the identifier.
Optionally, the processor 1001 may call a timing-based profile data management program stored in the memory 1005, and further perform the following operations:
determining the data type as attribute node data of attribute data in the node data, and determining the entity node data corresponding to the attribute node data;
according to the storage path corresponding to the identifier of the attribute node data, establishing an attribute table in the corresponding sub-scene to store the attribute node data and the time sequence information in an associated mode;
and associating the attribute table with the entity node data.
Optionally, the processor 1001 may call a timing-based profile data management program stored in the memory 1005, and further perform the following operations:
determining the data type as relationship node data of relationship data in the node data, and determining the entity node data corresponding to the relationship node data;
establishing a relation table in the corresponding sub-scene to store the relation node data and the time sequence information in an associated mode according to a storage path corresponding to the identifier of the relation node data;
and associating the relation table with the entity node data.
Optionally, the processor 1001 may call a timing-based profile data management program stored in the memory 1005, and further perform the following operations:
when the instruction to be handled is a query instruction, determining a map address, a time node and a query type corresponding to the query instruction;
determining a target sub-scene according to the map address, and determining target data associated with the target sub-scene according to the query type;
and generating a corresponding message window according to the target data of which the time sequence information is matched with the time node, and outputting the message window to a client.
Optionally, the processor 1001 may call a timing-based profile data management program stored in the memory 1005, and further perform the following operations:
when the to-be-handled instruction is a deletion instruction, determining a map address and a deletion type corresponding to the query instruction;
determining a target sub-scene corresponding to the map address, and determining target data with a data type matched with the deletion type;
disarming the target data and the target and the association of the target sub-scene.
In addition, the embodiment of the application further provides a computer readable storage medium, wherein the computer readable storage medium stores a time-sequence-based map data management program, and the time-sequence-based map data management program realizes the relevant steps of any embodiment of the time-sequence-based map data management method when being executed by a processor.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It should be noted that in the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word "comprising" does not exclude the presence of elements or steps not listed in a claim. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The application may be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In the unit claims enumerating several means, several of these means may be embodied by one and the same item of hardware. The use of the words first, second, third, etc. do not denote any order. These words may be interpreted as names.
While preferred embodiments of the present application have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. It is therefore intended that the following claims be interpreted as including the preferred embodiments and all such alterations and modifications as fall within the scope of the application.
It will be apparent to those skilled in the art that various modifications and variations can be made in the present application without departing from the spirit or scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims and the equivalents thereof, the present application is intended to cover such modifications and variations.
Claims (10)
1. A time-series-based profile data management method, characterized in that the time-series-based profile data management method comprises:
when receiving a database operation instruction, generating an instruction to be handled based on an operation type corresponding to the operation instruction;
adding the to-be-handled instruction to a corresponding cache queue, wherein the cache queue comprises an adding queue, a deleting queue and a query queue;
and processing the instructions to be handled in the cache queue based on the time sequence information of the instructions to be handled.
2. The timing-based profile data management method of claim 1, wherein the step of generating the to-Do instruction based on the operation type corresponding to the operation instruction when receiving the database operation instruction comprises:
determining time sequence information corresponding to the operation instruction;
generating a queue identifier of the operation instruction based on the operation type and the time sequence information, wherein the operation type comprises an adding operation, a deleting operation and a query operation;
and associating the queue identifier with the operation instruction to generate the to-Do instruction.
3. The method for managing time-series-based graph data according to claim 1, wherein, when receiving the database operation instruction, the step of generating the to-Do instruction based on the operation type corresponding to the operation instruction further comprises:
when the operation type is adding data, determining data to be added corresponding to the operation instruction;
determining an identifier of the data to be added based on the data type and the scene type of the data to be added;
generating node data according to the data to be added, the time sequence information of the data to be added and the identifier, and associating the node data with the instructions to be handled.
4. The timing based atlas data management method of claim 3, wherein the step of processing the to-do instruction in the cache queue based on timing information of the to-do instruction comprises:
when the to-be-handled instruction is an adding instruction, determining the node data associated with the adding instruction;
determining a target map based on the scene information of the node data;
and determining the entity node data of which the data type is entity data in the node data, and establishing an entity table association for storing the entity node data and the time sequence information under the corresponding sub-scene according to the storage path corresponding to the identifier.
5. The method for managing time-series-based graph data according to claim 4, wherein after the step of determining that the data type is entity node data of entity data in the node data, and establishing an entity table in a corresponding sub-scenario according to the storage path corresponding to the identifier to store the entity node data and the time-series information, the method further comprises:
determining the data type as attribute node data of attribute data in the node data, and determining the entity node data corresponding to the attribute node data;
according to the storage path corresponding to the identifier of the attribute node data, establishing an attribute table in the corresponding sub-scene to store the attribute node data and the time sequence information in an associated mode;
and associating the attribute table with the entity node data.
6. The method for managing time-series-based graph data according to claim 4, wherein after the step of determining that the data type is entity node data of entity data in the node data, and establishing an entity table in a corresponding sub-scenario according to the storage path corresponding to the identifier to store the entity node data and the time-series information, the method further comprises:
determining the data type as relationship node data of relationship data in the node data, and determining the entity node data corresponding to the relationship node data;
establishing a relation table in the corresponding sub-scene to store the relation node data and the time sequence information in an associated mode according to a storage path corresponding to the identifier of the relation node data;
and associating the relation table with the entity node data.
7. The timing based atlas data management method of claim 1, wherein the step of processing the to-do instruction in the cache queue based on timing information of the to-do instruction further comprises:
when the instruction to be handled is a query instruction, determining a map address, a time node and a query type corresponding to the query instruction;
determining a target sub-scene according to the map address, and determining target data associated with the target sub-scene according to the query type;
and generating a corresponding message window according to the target data of which the time sequence information is matched with the time node, and outputting the message window to a client.
8. The timing based atlas data management method of claim 1, wherein the step of processing the to-do instruction in the cache queue based on timing information of the to-do instruction further comprises:
when the to-be-handled instruction is a deletion instruction, determining a map address and a deletion type corresponding to the query instruction;
determining a target sub-scene corresponding to the map address, and determining target data with a data type matched with the deletion type;
and releasing the association of the target data and the target sub-scene.
9. A time-series based profile data management apparatus comprising a memory, a processor and a time-series based profile data management program stored on the memory and executable on the processor, the processor implementing the steps of the time-series based profile data management method of any one of claims 1 to 8 when the time-series based profile data management program is executed.
10. A computer readable storage medium, characterized in that the computer readable storage medium has stored thereon a timing based profile data management program which when executed by a processor implements the steps of the timing based profile data management method according to any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211730576.4A CN116304079A (en) | 2022-12-30 | 2022-12-30 | Timing-based profile data management method, apparatus, and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211730576.4A CN116304079A (en) | 2022-12-30 | 2022-12-30 | Timing-based profile data management method, apparatus, and readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116304079A true CN116304079A (en) | 2023-06-23 |
Family
ID=86821169
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211730576.4A Pending CN116304079A (en) | 2022-12-30 | 2022-12-30 | Timing-based profile data management method, apparatus, and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116304079A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118051527A (en) * | 2024-04-16 | 2024-05-17 | 杭州悦数科技有限公司 | Method and device for realizing dynamic knowledge graph based on graph database |
-
2022
- 2022-12-30 CN CN202211730576.4A patent/CN116304079A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118051527A (en) * | 2024-04-16 | 2024-05-17 | 杭州悦数科技有限公司 | Method and device for realizing dynamic knowledge graph based on graph database |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109559234B (en) | Block chain state data storage method, equipment and storage medium | |
| CN107391653B (en) | Distributed NewSQL database system and picture data storage method | |
| KR101994021B1 (en) | File manipulation method and apparatus | |
| US12045734B2 (en) | Optimizing gradient boosting feature selection | |
| CN108287708B (en) | Data processing method and device, server and computer readable storage medium | |
| US20130173509A1 (en) | Method and arrangement for processing data | |
| CN112579595A (en) | Data processing method and device, electronic equipment and readable storage medium | |
| CN111737564A (en) | Information query method, device, equipment and medium | |
| US20200050785A1 (en) | Database record access through use of a multi-value alternate primary key | |
| CN109614411B (en) | Data storage method, device and storage medium | |
| CN116304079A (en) | Timing-based profile data management method, apparatus, and readable storage medium | |
| CN113377817A (en) | Data processing method, system, device and storage medium | |
| CN113344074A (en) | Model training method, device, equipment and storage medium | |
| CN115952300A (en) | Dynamic map construction method, dynamic map construction apparatus, and readable storage medium | |
| CN113626217B (en) | Asynchronous message processing method, device, electronic equipment and storage medium | |
| CN118034822A (en) | Page processing method, device, equipment and storage medium | |
| CN116069810A (en) | Data query method and device and terminal equipment | |
| CN115270731A (en) | Collaborative editing method and device for mixed document | |
| CN111061744B (en) | Graph data updating method and device, computer equipment and storage medium | |
| CN114493642A (en) | User portrait label generation method and device, computing device and storage medium | |
| CN113722007A (en) | Configuration method, device and system of VPN branch equipment | |
| CN105677801A (en) | Data processing method and system based on graph | |
| CN114780432B (en) | Interface testing method, device, equipment and storage medium | |
| CN113326004B (en) | Efficient log centralization method and device in cloud computing environment | |
| CN116701220A (en) | Data synchronization test method and device, electronic equipment and computer readable medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |