A graph data representation and mapping method for knowledge graph
A mapping method and knowledge map technology, which can be used in other database retrieval, other database indexing, special data processing applications, etc., can solve the problems of inflexible data structure and restricted graph data, etc.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0028] like figure 1 As shown, the present invention stores the vertices, arcs and attributes of the graph data in the message space, and persists the data. The ID of the message space where the data is located is determined by the vertex, the space attribution of the arc is determined by its starting vertex, and the space attribution of the attribute is the same as the vertex or arc to which it belongs.
[0029] For a graph of N vertices, each vertex is identified with a 40-bit ID, through which the message space can be located. The system supports no more than 2 40 (about 1000 billion) vertices, N40 . It is expected that in real systems, the number of vertices is usually between one million and 100 million, depending on the problem size.
[0030] There are at most N between N vertices 2 different associations, 2*N 2 While the distributed graph database supports multiple arcs and identifies each arc with a 50-bit ID, there can be theoretically about 262 trillion arcs.
...
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