Multi-Subgraph Matching via Hash Grouping and Parallel Querying
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing subgraph query methods are inefficient when multiple query graphs are processed, leading to low speed and low efficiency in subgraph matching.
Innovation Solution
A multi-subgraph matching method that groups multiple query graphs based on hash values and matches them in parallel with a data graph, utilizing load balancing and data subgraph division to optimize the process.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If single-subgraph query is performed for each query graph, then matching accuracy is maintained, but subgraph query speed and efficiency deteriorate
Solution Approach 1:
The patent combines multiple single-subgraph queries into a unified multi-subgraph matching framework. By merging the processing of multiple query graphs into a single parallel execution model, the system maintains matching accuracy while significantly improving query speed through consolidated resource utilization and reduced redundant operations.
Solution Approach 2:
The patent segments the set of query graphs into multiple groups that can be processed in parallel. Each group is handled by dedicated processing units, allowing simultaneous execution of multiple matching operations while maintaining the precision of individual subgraph matching through isolated processing paths for each query graph group.
2Use of energy by moving object
If multiple query graphs are processed sequentially, then resource consumption is reduced, but matching efficiency deteriorates
Solution Approach 1:
The patent implements a dynamic parallel processing architecture where query graphs are adaptively grouped and assigned to processing units based on workload characteristics. The system dynamically adjusts the degree of parallelization and resource allocation, enabling efficient handling of multiple query graphs simultaneously while optimizing resource consumption through load balancing and adaptive scheduling.
Data Source
AI summary
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.