The present application relates to a kind of optimization method and
system of
timing diagram subgraph matching.The method includes: time block is carried out to original
timing diagram, and the edge with same end point is aggregated and compressed in each time block to generate intra-block multi-edge object, to build block index in turn;Query graph with time constraint is received, with the edge in query graph as matching unit to execute search, and maintain current legal time window;In candidate generation stage, according to current to be matched data vertex pair and current legal time window, construct cache key, and carry out exploration in hotspot cache;If hotspot cache is not hit, then use current legal time window to locate target time block, and execute intersection operation in target time block to generate candidate multi-edge
list;When current to be matched data vertex pair meets preset hotspot condition, the candidate multi-edge
list is written into hotspot cache;Continue to execute search based on the candidate multi-edge
list of hit or generated candidate multi-edge list, until outputting
model matching result.