CN103077216A - Sub-graph matching device and sub-graph matching method - Google Patents
Sub-graph matching device and sub-graph matching method Download PDFInfo
- Publication number
- CN103077216A CN103077216A CN2012105868929A CN201210586892A CN103077216A CN 103077216 A CN103077216 A CN 103077216A CN 2012105868929 A CN2012105868929 A CN 2012105868929A CN 201210586892 A CN201210586892 A CN 201210586892A CN 103077216 A CN103077216 A CN 103077216A
- Authority
- CN
- China
- Prior art keywords
- tree
- subtree
- value
- match
- subgraph
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims description 25
- 230000008878 coupling Effects 0.000 claims description 43
- 238000010168 coupling process Methods 0.000 claims description 43
- 238000005859 coupling reaction Methods 0.000 claims description 43
- 230000008034 disappearance Effects 0.000 claims description 17
- 238000012217 deletion Methods 0.000 claims description 4
- 230000037430 deletion Effects 0.000 claims description 4
- 238000000354 decomposition reaction Methods 0.000 claims description 2
- 230000006870 function Effects 0.000 description 19
- 230000008569 process Effects 0.000 description 7
- 238000005516 engineering process Methods 0.000 description 4
- 238000004458 analytical method Methods 0.000 description 3
- 238000003066 decision tree Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000013523 data management Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 102000004169 proteins and genes Human genes 0.000 description 1
- 108090000623 proteins and genes Proteins 0.000 description 1
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a sub-graph matching device, which is used for finding out a sub-graph matched with a loop graph in a large-scale graph. The device comprises a spanning tree module, a matching module, a judging module and a gathering module. A spanning tree of the loop graph is found by the spanning tree module according to a minimum spanning tree algorithm; the spanning tree matching is carried out on a data graph by the matching module from bottom to top to find a tree Li (i>=1) matched with the spanning tree; whether the sum of a grading function value of the tree Li and the missing edge number is larger than or equal to a preset value or not is judged by the judging module, if so, whether the tree Li can be expanded into the loop graph or not is judged by the judging module; and the gathering module can be used for outputting the previous fixed value number of matching graphs in a set V when the sum of the grading function value of the tree Li and the missing edge number is larger than or equal to the preset value.
Description
Technical field
The present invention relates to the data search technology, relate in particular to and a kind of large data figure is carried out the subgraph match device of subgraph match and the method for subgraph match.
Background technology
Along with web technologies and new data management and the development of memory technology, the data of graph structure become more and more general.Graph structure is the complex relationship between the expressive object clearly.Many application need to be processed the data of graph structure, such as the protein Internet [2] in semantic net [1], the bioinformatics and the social networks in the social science etc.Single or multiple Large Graph data are effectively stored and analyzed to these application requirements.
When the analysis chart data, often need to inquire about figure, different from the inquiry in the relational database, the general graph-based structure of the inquiry of figure.The inquiry relevant with figure can be divided into three classes substantially.The first kind is the inquiry about the path, requires to find out two shortest paths between the summit such as shortest path query [35], and whether accessibility inquiry [5 – 8] requires to judge has the path to link to each other between two summits.Equations of The Second Kind is relevant with the summit, and for example nearest-neighbors summit inquiry [9,10] is searched and immediate neighbours summit, given summit.The 3rd class is subgraph inquiry [11,12], requires to find out the subgraph structure that needs, and for example Subgraph Isomorphism, subgraph match and frequent subgraph excavate, and compare the inquiry on path and summit, and the subgraph inquiry more can be excavated the information of figure.These query manipulations are bases of many application, so these inquiries of fast processing are very important.
Traditionally, subgraph match refers to Subgraph Isomorphism.Given query graph Q and data plot G, Subgraph Isomorphism requires to find out the subgraph that same structure is arranged with Q among the G.The main application of Subgraph Isomorphism aspect database is that frequent subgraph excavates.Under many circumstances, especially WWW develop rapidly now, a lot of application needs to process single large-scale data plot usually, such as linking parsing, social networks and semantic net.For efficiently management and analysis large data figure, develop a kind of new subgraph match problem in original Subgraph Isomorphism problem gradually, this subgraph match problem is inquired about label figure.Label figure refers among the figure that there is a label on each summit or limit, and in social networks, job overall can be used as the label on each user summit.The pattern that query graph Q representative will be inquired about, the summit of query graph is also with label.The subgraph match problem requires the matching result of inquiry to satisfy simultaneously label condition and structural condition: (1) label condition, and the label on summit is identical with the label on coupling summit among the G among the Q; (2) structural condition to the limit among the Q, will have the path to link to each other between the summit of corresponding coupling among the G.Therefore Subgraph Isomorphism requires the strict coupling on limit and limit, and the limit in this subgraph match problem requirement query graph and the route matching in the data plot.
1, the existing algorithm of searching subgraph match is not considered the problem of top-k.In the face of large data figure, the matching result collection of given inquiry is very huge, therefore adopts existing subgraph match algorithm to find out whole couplings, and then obtaining top-k result by ordering can be very consuming time.
2, existing top-k join algorithm can directly be used for finding the solution the subgraph match of top-k, but analysis and the experiment of this algorithm shown that this algorithm does not have better performance, especially for large-scale data plot.Existing top-k Sub-tree Matching algorithm can't be directly used in finds the solution the top-k subgraph match.
[1]B.Berendt,A.Hotho,and?G.Stumme.Towards?semantic?web?mining.The?Semantic?Web―ISWC2002,pages264–278,2002.
[2]J.Van?Helden,A.Naim,R.Mancuso,M.Eldridge,L.Wernisch,D.Gilbert,S.J.Wodak,et?al.Representing?and?analysing?molecular?and?cellular?functionusing?the?computer.Biological?Chemistry,381(9/10):921–936,2000.
[3]E.P.Chan?and?H.Lim.Optimization?and?evaluation?of?shortest?path?queries.The?VLDB?Journal―The?International?Journal?on?Very?Large?Data?Bases,16(3):343369,2007.
[4]N.Jing,Y.W.Huang,and?E.A.Rundensteiner.Hierarchical?encoded?path?views?for?path?query?processing:An?optimal?model?and?its?performance?evaluation.Knowledge?and?Data?Engineering,IEEE?Transactions?on,10(3):409–432,1998.
[5]E.Cohen,E.Halperin,H.Kaplan,and?U.Zwic?k.Reachability?and?distancequeries?via2-hop?labels.In?Proceedings?of?the?thirteenth?annual?ACM-SIAMsymposium?on?Discrete?algorithms,pages937–946.Society?for?Industrial?andApplied?Mathematics,2002.
[6]H.Wang,H.He,J.Yang,P.S.Yu,and?J.X.Yu.Dual?labeling:Answering?graph?reachability?queries?in?constant?time.In?Data?Engineering,2006.
ICDE'06.Proceedings?of?the22nd?International?Conference?on,pages75–75.Ieee,2006.
[7]S.Trisl?and?U.Leser.Fast?and?practical?indexing?and?querying?of?very?largegraphs.In?Proceedings?of?the2007ACM?SIGMOD?international?conferenceon?Management?of?data,pages845–856.ACM,2007.
[8]Y.Chen?and?Y.Chen.An?efficient?algorithm?for?answering?graph?reachabilityqueries.In?Data?Engineering,2008.ICDE?2008.IEEE?24th?InternationalConference?on,pages893–902.IEEE,2008.
[9]D.Papadias,J.Zhang,N.Mamoulis,and?Y.Tao.Query?processing?in?spatialnetwork?databases.In?Proceedings?of?the29th?international?conference?onVery?large?data?bases-Volume29,pages802–813.VLDB?Endowment,2003.
[10]Jiefeng?Cheng,Jeffrey?Xu?Yu,and?Philip?S.Yu.Graph?pattern?matching:A?join/semijoin?approach.In?TKDE,pages1006–1021,Los?Alamitos,CA,USA,2010.IEEE?Computer?Society.
[11]H.Tong,C.Faloutsos,B.Gallagher,and?T.Eliassi-Rad.Fast?best-effortpattern?matching?in?large?attributed?graphs.In?Proceedings?of?the?13thACM?SIGKDD?international?conference?on?Knowledge?discovery?and?data?mining,pages737-746.ACM,2007.
[12]J.Cheng,J.X.Yu,B.Ding,P.S.Yu,and?H.Wang.Fast?graph?pattern?matching.In?Data?Engineering,2008.ICDE2008.IEEE24th?InternationalConference?on,pages913–922.Ieee,2008.
Summary of the invention
In view of this, be necessary to provide the method for a kind of subgraph match device and subgraph match.
A kind of subgraph match device provided by the invention is used for finding out the subgraph that mates with band figure at Large Scale Graphs, comprising: spanning tree module, matching module, judge module and collection modules.Wherein, the spanning tree module is used for finding described band map generalization tree according to minimal spanning tree algorithm; Matching module carries out the spanning tree coupling for bottom-up to data plot, seeks the tree Li(i with the spanning tree coupling 〉=1); Judge module, be used for judging the score function value of described tree Li and lack the limit and whether count sum more than or equal to preset value, wherein, described judge module also is used for judging that can described tree Li expand to band figure when the score function value of described tree Li is counted sum less than preset value with the disappearance limit; Collection modules, be used for when tree Li can expand to band figure, described tree Li being expanded to match map, and deposit among the set V, wherein, described collection modules also is used for the match map of described set V is sorted from small to large according to weight, whether described judge module also be used for judges set V coupling number of graphs more than or equal to fixed value, and described preset value is made as when the coupling number of graphs is more than or equal to fixed value in set V the weight of a fixed value match map; Wherein, described collection modules also is used for when the score function value of described tree Li is counted sum more than or equal to preset value with the disappearance limit the match map output of fixed value before the described set V.
The present invention also provides a kind of method of subgraph match, is used for finding out the subgraph that mates with band figure at Large Scale Graphs, said method comprising the steps of: find described band map generalization tree according to minimal spanning tree algorithm; Bottom-up data plot is carried out spanning tree coupling, seek the tree Li(i with the spanning tree coupling=1); Judge the score function value of described tree Li and lack the limit and whether count sum more than or equal to preset value; If the score function value of described tree Li is counted sum less than preset value with the disappearance limit, judge that then can described tree Li expand to band figure; If described tree Li can expand to band figure, then described tree Li is expanded to match map, and deposit among the set V; Match map among the described set V is sorted from small to large according to weight; Judge that whether the coupling number of graphs is more than or equal to fixed value among the described set V; If the coupling number of graphs is more than or equal to fixed value among the described set V, then described preset value is made as the weight of a fixed value match map, wherein, if the score function value of described tree Li is counted sum more than or equal to preset value with the disappearance limit, then with the match map output of front fixed value among the described set V.
Subgraph match device among the present invention and the method for subgraph match are by being converted to spanning tree with band figure, bottom-up data plot is carried out spanning tree coupling, seek the tree with the spanning tree coupling, the score function value of decision tree is counted sum with the disappearance limit and whether is decided more than or equal to the weight of a fixed value match map in the set whether tree is matching result, has improved the speed to the data plot match query.
Description of drawings
Fig. 1 is the module map of subgraph coalignment in an embodiment of the present invention;
Fig. 2 is the generative process of I type subtree;
Fig. 3 is the generative process of II type subtree;
Fig. 4 utilizes subgraph match device shown in Figure 1 to carry out the process flow diagram of the method for subgraph match in an embodiment of the present invention;
Fig. 5 is the particular flow sheet of step S204 among Fig. 4.
Embodiment
The below describes embodiments of the invention in detail, and the example of described embodiment is shown in the drawings, and wherein identical or similar label represents identical or similar element or the element with identical or similar functions from start to finish.Be exemplary below by the embodiment that is described with reference to the drawings, only be used for explaining the present invention, and can not be interpreted as limitation of the present invention.
In description of the invention, term " interior ", " outward ", " vertically ", " laterally ", " on ", orientation or the position relationship of the indications such as D score, " top ", " end " be based on orientation shown in the drawings or position relationship, only be for convenience of description the present invention rather than require the present invention with specific orientation structure and operation, therefore can not be interpreted as limitation of the present invention.
See also Fig. 1, Figure 1 shows that the module map of subgraph coalignment 10 in an embodiment of the present invention.
In the present embodiment, subgraph match device 10 comprises: spanning tree module 102, matching module 104, judge module 106, collection modules 108, storer 110 and processor 112, wherein, spanning tree module 102, matching module 104, judge module 106 and collection modules 108 are stored in the storer 110, and processor 112 is used for carrying out the functional module that is stored in storer 110.
In the present embodiment, subgraph match device 10 is used for finding out the subgraph that mates with band figure at Large Scale Graphs.
In being implemented mode, Large Scale Graphs is stored in the storer 110 with the form of form, wherein, comprises the weight between starting point label and terminal point label and starting point label and the terminal point label in the form.
In the present embodiment, spanning tree module 102 is used for finding described band map generalization tree according to minimal spanning tree algorithm.
Matching module 104 carries out the spanning tree coupling for bottom-up to data plot, seeks the tree Li(i with the spanning tree coupling 〉=1).
Whether judge module 106 is used for judging the score function value of described tree Li and lacks the limit counts sum more than or equal to preset value.
In the present embodiment, described judge module 106 also is used for judging that can described tree Li expand to band figure when the score function value of described tree Li is counted sum less than preset value with the disappearance limit.
In the present embodiment, in the present embodiment, the tree Li that the spanning tree coupling obtains has identical summit with band figure, but it has lacked the part limit.Therefore Li is extended to band figure, only needs the limit of search disappearance, whether have corresponding path at data plot.If exist, then expression can be expanded, and becoming band figure corresponding match map in data plot after the tree Li expansion is Mi, otherwise, cannot expand.
In the present embodiment, judge module 106 calculates described tree L by score function
QBand figure (the M that expands
Q) weight, score function is as follows:
U wherein, v ∈ M
Q, M
QThat query graph Q is at data plot G
DIn match map; (X; Y)=(λ
-1(u); λ
-1(v)) be limit among the query graph Q; C (X; Y) be and inquiry limit (X; Y) related coefficient, it is specified by the user, is defaulted as 1; Dist (u; V) distance value of the shortest path of expression summit u and v.When the shortest path on two summits distance more hour, it is tightr to think that this two summit connects, so score (M
Q) value less, then think the coupling M
QBetter.
Collection modules 108 is used for when tree Li can expand to band figure described tree Li being expanded to match map, and deposit among the set V, wherein, described collection modules 108 also is used for the match map of described set V is sorted from small to large according to weight, whether described judge module 106 also be used for judges set V coupling number of graphs more than or equal to fixed value, and described preset value is made as when the coupling number of graphs is more than or equal to fixed value in set V the weight of a fixed value match map.
In the present embodiment, described collection modules 108 also is used for when the score function value of described tree Li is counted sum more than or equal to preset value with the disappearance limit the match map output of fixed value before the described set V.
In the present embodiment, described collection modules 106 abandons tree Li when described tree Li can not expand to band figure.
In the present embodiment, described judge module 106 also is used for when described set V mates number of graphs less than fixed value preset value being made as+∞.
In the present embodiment, described matching module 104 comprises: decompose submodule 1040, judge submodule 1042, seek submodule 1044 and output sub-module 1046.
Decomposing submodule 1040 is used for the top-down subtree of only having the limit that is decomposed into of described spanning tree.
Judge whether submodule 1042 is I type subtree after being used for judging the subtree growth.
In the present embodiment, the type of the tree that forms after the subtree growth has two kinds: I type subtree and II type subtree, wherein, I type subtree be leaf node without brother's tree, II type subtree is the tree that leaf node has the brotgher of node.
See also Fig. 2 and Fig. 3, Figure 2 shows that the generative process of I type subtree, Figure 3 shows that the generative process of II type subtree.
In Fig. 2, subtree forms (B is the root node of low one deck subtree, and C can be a leaf node) by the subtree of a root node A and a sub-Node B, and Node B has a limit to point to root node.In the present embodiment, C can be low one deck subtree, can be come by I type or the growth of II type by other subtrees.
In Fig. 3, subtree is by a root node A and a plurality of child node B ... the subtree of C forms (B ... C is the root node of low one deck subtree, B ... C can be a node).Node B ... C has a limit to point to root node.In the present embodiment, B ... C can be low one deck subtree, can be come by I type or the growth of II type by other subtrees.
Please continue to consult Fig. 1, seek the root node of the tree that after the described subtree growth of described data plot searching, forms when submodule 1044 is used for being I type subtree after described subtree growth to the optimal result of leaf node, put into pTable, wherein, described searching submodule 1044 also is used for the data that described pTable dist value (weighted value) is minimum and puts into sTable, and the minimum data of dist value among the deletion pTable, describedly judge that submodule 1042 is used for also judging whether described subtree is that last stalk is set.
Output sub-module 1046 is used for when described subtree is last stalk tree the content of the described sTable matching result (tree Li) as described spanning tree.
In the present embodiment, the optimal result when described searching submodule 1044 also is used for forming after described subtree growth tree is not I type subtree between the brotgher of node of the tree that forms after the described subtree growth of described data plot searching is put into pTable.
In the present embodiment, described decomposition submodule 1040 also is used for when described subtree is not last stalk tree described subtree as leaf node.
See also Fig. 4, Figure 4 shows that and utilize subgraph match device shown in Figure 1 10 to carry out the process flow diagram of the method for subgraph match in an embodiment of the present invention.
In the present embodiment, the method for subgraph match is used for finding out the subgraph that mates with band figure at Large Scale Graphs.
At step S202, spanning tree module 102 finds described band map generalization tree according to minimal spanning tree algorithm.
At step S204, matching module 104 is bottom-up to carry out the spanning tree coupling to data plot, seeks the tree Li(i with the spanning tree coupling 〉=1).
At step S206, judge module 106 judges that whether the score function value of described tree Li and disappearance limit count sum more than or equal to preset value.
In the present embodiment, judge module 106 calculates described tree L by score function
QBand figure (the M that expands
Q) weight, score function is as follows:
U wherein, v ∈ M
Q, M
QThat query graph Q is at data plot G
DIn match map; (X; Y)=(λ
-1(u); λ
-1(v)) be limit among the query graph Q; C (X; Y) be and inquiry limit (X; Y) related coefficient, it is specified by the user, is defaulted as 1; Dist (u; V) distance value of the shortest path of expression summit u and v.When the shortest path on two summits distance more hour, it is tightr to think that this two summit connects, so score (M
Q) value less, then think the coupling M
QBetter.
If the score function value of described tree Li is counted sum more than or equal to preset value with the disappearance limit, then at step S206, collection modules 108 is with the match map output of front fixed value among the described set V.
If the score function value of described tree Li is counted sum less than preset value with the disappearance limit, then at step S208, judge module 106 judges that can described tree Li expand to band figure.
In the present embodiment, the tree Li that the spanning tree coupling obtains has identical summit with band figure, but it has lacked the part limit.Therefore Li is extended to band figure, only needs the limit of search disappearance, whether have corresponding path at data plot.If exist, then expression can be expanded, and becoming band figure corresponding figure in data plot after the tree Li expansion is Mj, otherwise, cannot expand.
If described tree Li can expand to band figure, then at step S212, collection modules 108 expands to match map with described tree Li, and deposits among the set V.
At step S214, collection modules 108 sorts the match map among the described set V from small to large according to weight.
At step S216, judge module 106 judges that whether the coupling number of graphs is more than or equal to fixed value among the described set V.
If the coupling number of graphs is more than or equal to fixed value among the described set V, then at step S218, judge module 106 is made as described preset value the weight of a fixed value match map.
If the coupling number of graphs is less than fixed value among the described set V, then at step S220, judge module 106 is made as preset value+∞.
See also Fig. 5, Fig. 5 is the particular flow sheet of step S204 among Fig. 4.
At step S300, decompose submodule 1040 with the top-down subtree of only having the limit that is decomposed into of described spanning tree.
At step S302, judge that submodule 1042 judges whether subtree is I type subtree.
In the present embodiment, the type of the tree that forms after the subtree growth has two kinds: I type subtree and II type subtree, wherein, I type subtree be leaf node without brother's tree, II type subtree is the tree that leaf node has the brotgher of node.
In the present embodiment, the relation of judging the node of the tree that forms after submodule 1042 is by the subtree growth determines whether subtree is I type subtree.
If the tree that forms after the described subtree growth is I type subtree, then at step S304, seek submodule 1044 and in described data plot, seek the root node of the tree that forms after the described subtree growth to the optimal result of leaf node, put into pTable.In the present embodiment, pTable is used for the intermediate result that memory node connects.
At step S306, seek submodule 1044 data that dist value (weighted value) among the described pTable is minimum and put into sTable, and the minimum data of dist value among the deletion pTable.In the present embodiment, sTable stores the matching result of having found out.
At step S308, judge that submodule 106 judges that whether described subtree is last stalk tree.
If described subtree is for last stalk tree, then at step S310, output sub-module 1046 is with the content of the described sTable matching result (tree Li) as described spanning tree.
If described subtree is not last stalk tree, then at step S312, decompose submodule 1040 with described subtree as leaf node.
In the judged result in step S302, if the tree that forms after the described subtree growth is not I type subtree, represent that then the tree that forms after the subtree growth is II type subtree, at step S314, seek submodule 1044 and in described data plot, seeks optimal result between the brotgher of node of the tree of formation after the described subtree growth, put into pTable.
Subgraph match device 10 in the embodiment of the present invention and the method for subgraph match are by being converted to spanning tree with band figure, bottom-up data plot is carried out spanning tree coupling, seek the tree with the spanning tree coupling, the score function value of decision tree is counted sum with the disappearance limit and whether is decided more than or equal to the weight of a fixed value match map in the set whether tree is matching result, has improved the speed to the data plot match query.
Although the present invention is described with reference to current preferred embodiments; but those skilled in the art will be understood that; above-mentioned preferred embodiments only is used for illustrating the present invention; be not to limit protection scope of the present invention; any within the spirit and principles in the present invention scope; any modification of doing, equivalence replacement, improvement etc. all should be included within the scope of the present invention.
Claims (12)
1. a subgraph match device is used for finding out the subgraph that mates with band figure at Large Scale Graphs, comprising:
The spanning tree module is used for finding described band map generalization tree according to minimal spanning tree algorithm;
Matching module carries out the spanning tree coupling for bottom-up to data plot, seeks the tree Li(i with the spanning tree coupling 〉=1);
Judge module, be used for judging the score function value of described tree Li and lack the limit and whether count sum more than or equal to preset value, wherein, described judge module also is used for judging that can described tree Li expand to band figure when the score function value of described tree Li is counted sum less than preset value with the disappearance limit;
Collection modules, be used for when tree Li can expand to band figure, described tree Li being expanded to match map, and deposit among the set V, wherein, described collection modules also is used for the match map of described set V is sorted from small to large according to weight, whether described judge module also be used for judges set V coupling number of graphs more than or equal to fixed value, and described preset value is made as when the coupling number of graphs is more than or equal to fixed value in set V the weight of a fixed value match map;
Wherein, described collection modules also is used for when the score function value of described tree Li is counted sum more than or equal to preset value with the disappearance limit the match map output of fixed value before the described set V.
2. subgraph match device as claimed in claim 1 is characterized in that, described collection modules abandons tree Li when described tree Li can not expand to band figure.
3. subgraph match device as claimed in claim 1 is characterized in that, score function is:
U wherein, v ∈ M
QM
QThat query graph Q is at data plot G
DIn match map, (X; Y)=(λ
-1(u); λ
-1(v)) be limit among the query graph Q, C (X; Y) be and inquiry limit (X; Y) related coefficient, dist (u; V) distance value of the shortest path of expression summit u and v.
4. subgraph match device as claimed in claim 1 is characterized in that, described matching module comprises:
Decompose submodule, be used for the top-down subtree of only having the limit that is decomposed into of described spanning tree;
Judge submodule, be used for judging whether the tree that forms after the subtree growth is I type subtree;
Seek submodule, when being I type subtree, the tree that is used for forming after described subtree growth seeks the root node of described subtree to the optimal result of leaf node at described data plot, put into pTable, wherein, described searching submodule also is used for the data that described pTable dist value (weighted value) is minimum and puts into sTable, and the minimum data of dist value among the deletion pTable, describedly judge that submodule is used for also judging whether described subtree is that last stalk is set;
Output sub-module is used for when described subtree is last stalk tree the content of the described sTable matching result (tree Li) as described spanning tree.
5. subgraph match device as claimed in claim 4, it is characterized in that, optimal result when described searching submodule also is used for forming after described subtree growth tree is not I type subtree between the brotgher of node of the described subtree of described data plot searching is put into pTable.
6. subgraph match device as claimed in claim 4 is characterized in that, described decomposition submodule also is used for when described subtree is not last stalk tree described subtree as leaf node.
7. the method for a subgraph match is used for finding out the subgraph that mates with band figure at Large Scale Graphs, it is characterized in that, said method comprising the steps of:
Find described band map generalization tree according to minimal spanning tree algorithm;
Bottom-up data plot is carried out spanning tree coupling, seek the tree Li(i with the spanning tree coupling=1);
Judge the score function value of described tree Li and lack the limit and whether count sum more than or equal to preset value;
If the score function value of described tree Li is counted sum less than preset value with the disappearance limit, judge that then can described tree Li expand to band figure;
If described tree Li can expand to band figure, then described tree Li is expanded to match map, and deposit among the set V;
Match map among the described set V is sorted from small to large according to weight;
Judge that whether the coupling number of graphs is more than or equal to fixed value among the described set V;
If the coupling number of graphs is more than or equal to fixed value among the described set V, then described preset value is made as the weight of a fixed value match map, wherein, if the score function value of described tree Li is counted sum more than or equal to preset value with the disappearance limit, then with the match map output of front fixed value among the described set V.
8. the method for subgraph match as claimed in claim 7 is characterized in that, and is further comprising the steps of:
When if described tree Li can not expand to band figure, then abandon tree Li.
9. the method for subgraph match as claimed in claim 7 is characterized in that, described score function is:
U wherein, v ∈ M
Q, M
QThat query graph Q is at data plot G
DIn match map, (X; Y)=(λ
-1(u); λ
-1(v)) be limit among the query graph Q, C (X; Y) be and inquiry limit (X; Y) related coefficient, dist (u; V) distance value of the shortest path of expression summit u and v.
10. the method for subgraph match as claimed in claim 7 is characterized in that, step " bottom-up data plot is carried out spanning tree coupling, seek the tree Li(i with the spanning tree coupling=1) " may further comprise the steps:
With the top-down subtree of only having the limit that is decomposed into of described spanning tree;
Judge whether the tree that forms after the subtree growth is I type subtree;
If the tree that forms after the described subtree growth is I type subtree, then in described data plot, seek the root node of described subtree to the optimal result of leaf node, put into pTable;
The data that dist value (weighted value) among the described pTable is minimum are put into sTable, and the minimum data of dist value among the deletion pTable;
Judge whether described subtree is last stalk tree;
If described subtree during for last stalk tree with the content of the described sTable matching result (tree Li) as described spanning tree.
11. the method for subgraph match as claimed in claim 10 is characterized in that, step " bottom-up data plot is carried out spanning tree coupling, seek the tree Li(i with the spanning tree coupling=1) " further comprising the steps of:
If the tree that forms after the described subtree growth is not I type subtree, then the optimal result between the brotgher of node of the described subtree of searching in described data plot is put into pTable.
12. the method for subgraph match as claimed in claim 10 is characterized in that, step " bottom-up data plot is carried out spanning tree coupling, seek the tree Li(i with the spanning tree coupling=1) " further comprising the steps of:
If described subtree is not last stalk tree, then with described subtree as leaf node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210586892.9A CN103077216B (en) | 2012-12-28 | 2012-12-28 | The method of subgraph match device and subgraph match |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210586892.9A CN103077216B (en) | 2012-12-28 | 2012-12-28 | The method of subgraph match device and subgraph match |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103077216A true CN103077216A (en) | 2013-05-01 |
| CN103077216B CN103077216B (en) | 2016-01-20 |
Family
ID=48153746
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210586892.9A Active CN103077216B (en) | 2012-12-28 | 2012-12-28 | The method of subgraph match device and subgraph match |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103077216B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104699698A (en) * | 2013-12-05 | 2015-06-10 | 深圳先进技术研究院 | Graph query processing method based on massive data |
| CN105243064A (en) * | 2014-06-23 | 2016-01-13 | 华为技术有限公司 | Subgraph matching method and device |
| CN105260465A (en) * | 2015-10-16 | 2016-01-20 | 晶赞广告（上海）有限公司 | Graph data processing service method and apparatus |
| CN108197186A (en) * | 2017-12-26 | 2018-06-22 | 北京航空航天大学 | A kind of Dynamic Graph matching inquiry method applied in social networks |
| CN112948591A (en) * | 2021-02-25 | 2021-06-11 | 成都数联铭品科技有限公司 | Subgraph matching method and system suitable for directed graph and electronic device |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105825237B (en) * | 2016-03-21 | 2019-03-01 | 山东联科云计算股份有限公司 | A kind of similar querying method of subgraph estimated based on figure |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101446958A (en) * | 2008-12-12 | 2009-06-03 | 大连理工大学 | Method for searching CAD model based on topological adjacency approximation |
-
2012
- 2012-12-28 CN CN201210586892.9A patent/CN103077216B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101446958A (en) * | 2008-12-12 | 2009-06-03 | 大连理工大学 | Method for searching CAD model based on topological adjacency approximation |
Non-Patent Citations (2)
| Title |
|---|
| XIANGGANG ZENG等: "Top-K Graph Pattern Matching: A Twig Query Approach", 《LECTURE NOTES IN COMPUTER SCIENCE》 * |
| 成杰峰等: "Fast Graph Pattern Matching", 《DATA ENGINEERING, 2008. ICDE 2008. IEEE 24TH INTERNATIONAL CONFERENCE ON》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104699698A (en) * | 2013-12-05 | 2015-06-10 | 深圳先进技术研究院 | Graph query processing method based on massive data |
| CN105243064A (en) * | 2014-06-23 | 2016-01-13 | 华为技术有限公司 | Subgraph matching method and device |
| CN105260465A (en) * | 2015-10-16 | 2016-01-20 | 晶赞广告（上海）有限公司 | Graph data processing service method and apparatus |
| CN105260465B (en) * | 2015-10-16 | 2018-10-30 | 晶赞广告（上海）有限公司 | A kind of method, apparatus of diagram data processing service |
| CN108197186A (en) * | 2017-12-26 | 2018-06-22 | 北京航空航天大学 | A kind of Dynamic Graph matching inquiry method applied in social networks |
| CN108197186B (en) * | 2017-12-26 | 2021-11-12 | 北京航空航天大学 | Dynamic graph matching query method applied to social network |
| CN112948591A (en) * | 2021-02-25 | 2021-06-11 | 成都数联铭品科技有限公司 | Subgraph matching method and system suitable for directed graph and electronic device |
| CN112948591B (en) * | 2021-02-25 | 2024-02-09 | 成都数联铭品科技有限公司 | Subgraph matching method and system suitable for directed graph and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103077216B (en) | 2016-01-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Fang et al. | Effective and efficient community search over large heterogeneous information networks | |
| Zheng et al. | Efficient graph similarity search over large graph databases | |
| Yuan et al. | Index-based densest clique percolation community search in networks | |
| CN107016072B (en) | Knowledge inference system and method based on social network knowledge graph | |
| CN103077216A (en) | Sub-graph matching device and sub-graph matching method | |
| Sakr et al. | Graph indexing and querying: a review | |
| CN104573039A (en) | Keyword search method of relational database | |
| CN104699698A (en) | Graph query processing method based on massive data | |
| Cheng et al. | Distr: A distributed method for the reachability query over large uncertain graphs | |
| CN103699647A (en) | Character string dictionary indexing method and system | |
| Ghrab et al. | An analytics-aware conceptual model for evolving graphs | |
| Jiang et al. | Incremental evaluation of top-k combinatorial metric skyline query | |
| Consoli et al. | A quartet method based on variable neighborhood search for biomedical literature extraction and clustering | |
| Jiang et al. | Graph compression strategies for instance-focused semantic mining | |
| Mallick et al. | Incremental mining of sequential patterns: Progress and challenges | |
| CN104156431A (en) | RDF keyword research method based on stereogram community structure | |
| Wu et al. | Modeling and extracting deep-web query interfaces | |
| Skhiri et al. | Large graph mining: recent developments, challenges and potential solutions | |
| Gao et al. | Holistic top-k simple shortest path join in graphs | |
| FRATERNALI | Graph search of software models using multidimensional scaling | |
| Yan et al. | Discovery of frequent substructures | |
| CN102955860A (en) | Improved keyword query method based on mode pattern | |
| Zada et al. | Large-scale data integration using graph probabilistic dependencies (gpds) | |
| Li et al. | A novel approach for mining probabilistic frequent itemsets over uncertain data streams | |
| Sahoo et al. | Prom: A semantic web framework for provenance management in science |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| EE01 | Entry into force of recordation of patent licensing contract | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20130501 Assignee: Dongguan Taiyan Electronic Technology Co.,Ltd. Assignor: SHENZHEN INSTITUTES OF ADVANCED TECHNOLOGY CHINESE ACADEMY OF SCIENCES Contract record no.: X2023980037841 Denomination of invention: Subgraph matching device and subgraph matching method Granted publication date: 20160120 License type: Common License Record date: 20230711 |
|
| EE01 | Entry into force of recordation of patent licensing contract | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20130501 Assignee: Dongguan pinenshi Intelligent Equipment Co.,Ltd. Assignor: SHENZHEN INSTITUTES OF ADVANCED TECHNOLOGY CHINESE ACADEMY OF SCIENCES Contract record no.: X2023980039276 Denomination of invention: Subgraph matching device and subgraph matching method Granted publication date: 20160120 License type: Common License Record date: 20230809 |
|
| EE01 | Entry into force of recordation of patent licensing contract | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20130501 Assignee: Achievement (Shenzhen) Industrial Technology Co.,Ltd. Assignor: SHENZHEN INSTITUTES OF ADVANCED TECHNOLOGY CHINESE ACADEMY OF SCIENCES Contract record no.: X2023980043772 Denomination of invention: Subgraph matching device and subgraph matching method Granted publication date: 20160120 License type: Common License Record date: 20231019 |