Huawei technologies co., ltd. (20240095260). MULTI-SUBGRAPH MATCHING METHOD AND APPARATUS, AND DEVICE simplified abstract
Contents
- 1 MULTI-SUBGRAPH MATCHING METHOD AND APPARATUS, AND DEVICE
- 1.1 Organization Name
- 1.2 Inventor(s)
- 1.3 MULTI-SUBGRAPH MATCHING METHOD AND APPARATUS, AND DEVICE - A simplified explanation of the abstract
- 1.4 Simplified Explanation
- 1.5 Potential Applications
- 1.6 Problems Solved
- 1.7 Benefits
- 1.8 Potential Commercial Applications
- 1.9 Possible Prior Art
- 1.10 How does this technology handle large-scale data processing?
- 1.11 What are the limitations of this technology in terms of graph complexity?
- 1.12 Original Abstract Submitted
MULTI-SUBGRAPH MATCHING METHOD AND APPARATUS, AND DEVICE
Organization Name
Inventor(s)
MULTI-SUBGRAPH MATCHING METHOD AND APPARATUS, AND DEVICE - A simplified explanation of the abstract
This abstract first appeared for US patent application 20240095260 titled 'MULTI-SUBGRAPH MATCHING METHOD AND APPARATUS, AND DEVICE
Simplified Explanation
The multi-subgraph matching method and apparatus described in the patent application involve grouping a plurality of query graphs based on hash values, matching these groups with a data graph in parallel, and obtaining matching results between the query graphs and the data graph. This method aims to increase grouping efficiency and subgraph matching efficiency.
- Efficient grouping of query graphs based on hash values
- Parallel matching of query graph groups with a data graph
- Increased subgraph matching efficiency
Potential Applications
The technology described in this patent application could be applied in various fields such as:
- Bioinformatics
- Social network analysis
- Image recognition
Problems Solved
The technology addresses the following issues:
- Inefficient grouping of query graphs
- Low subgraph matching efficiency
Benefits
The benefits of this technology include:
- Improved efficiency in grouping and matching query graphs
- Faster subgraph matching process
Potential Commercial Applications
This technology could have commercial applications in industries such as:
- Data analytics
- Information retrieval systems
Possible Prior Art
One possible prior art for this technology could be the use of hash values for grouping and matching in data processing systems.
Unanswered Questions
How does this technology handle large-scale data processing?
The patent application does not provide information on how the method scales when dealing with a large volume of data.
What are the limitations of this technology in terms of graph complexity?
The patent application does not discuss the potential limitations of the method when dealing with highly complex graph structures.
Original Abstract Submitted
a multi-subgraph matching method and apparatus, and a device are provided. after receiving a plurality of query graphs, the multi-subgraph matching apparatus groups the plurality of query graphs based on a hash value of each query graph, to generate a plurality of groups of query graphs. a plurality of query graphs whose hash values fall within a same value range belong to a same group. then, the multi-subgraph matching apparatus respectively matches the plurality of groups of query graphs with a data graph in parallel, to obtain matching results. the matching results are matching results between the plurality of query graphs and the data graph. according to the multi-subgraph matching method in this application, grouping efficiency can be increased, and subgraph matching efficiency can be effectively increased.
