A graph data processing method, device, electronic equipment and storage medium
A processing method and graph data technology, applied in the computer field, can solve problems such as reducing query performance and side-write performance, and achieve the effects of improving access performance, improving import performance, and reducing the number
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0032] Figure 1A It is a flow chart of a graph data processing method provided in Embodiment 1 of the present invention. This embodiment is applicable to the situation of processing graph data. The method can be executed by a graph data processing device, which can be implemented by software and / or or hardware, and can be integrated into an electronic device carrying a graph data processing function, such as a server device.
[0033] like Figure 1A As shown, the method may specifically include:
[0034] S110. According to the identification information of the endpoint in the graph data to be stored and the type of the relationship edge associated with the endpoint, construct the foreign key identifier of the basic key-value pair key field of at least one type of relationship edge.
[0035] In this embodiment, the graph data to be stored refers to graph data that needs to be stored, and may include endpoints and relationship edges, where the endpoints may be super nodes with ...
Embodiment 2
[0058] Figure 2A It is a flow chart of a graph data processing method provided in Embodiment 2 of the present invention. On the basis of the above embodiments, it is further optimized to insert, delete and modify data in the kv storage engine, providing an optional implementation Program.
[0059] like Figure 2A As shown, the method may specifically include:
[0060] S210. If an edge insertion event is recognized, determine a target foreign key identifier according to the type of the edge to be inserted and the identification information of any endpoint associated with the edge to be inserted.
[0061] Wherein, the insertion edge event refers to an event that requires relational edge insertion and storage. The target foreign key identifier is used to determine the basic key-value pair of the same type as the edge to be inserted, that is, the basic key-value pair that needs to be inserted in the edge to be inserted.
[0062] In this embodiment, if an edge insertion event ...
Embodiment 3
[0079] image 3 It is a schematic structural diagram of a graph data processing device provided in Embodiment 3 of the present invention. This embodiment is applicable to processing graph data. The device can be implemented by software and / or hardware, and can be integrated into a bearer In electronic equipment with graph data processing functions, such as in server equipment.
[0080] like image 3 As shown, the device may specifically include a foreign key identification building module 310, an internal key identification determination module 320, an internal key value determination module 330, and a writing module 340, wherein,
[0081] The foreign key identification building module 310 is used to construct the foreign key identification of the basic key-value pair key field of at least one type of relationship edge according to the identification information of the endpoint in the graph data to be stored and the type of the relationship edge associated with the endpoint; ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com