CN102662974B - A network graph index method based on adjacent node trees - Google Patents
A network graph index method based on adjacent node trees Download PDFInfo
- Publication number
- CN102662974B CN102662974B CN201210063543.9A CN201210063543A CN102662974B CN 102662974 B CN102662974 B CN 102662974B CN 201210063543 A CN201210063543 A CN 201210063543A CN 102662974 B CN102662974 B CN 102662974B
- Authority
- CN
- China
- Prior art keywords
- node
- tree
- adjacent node
- query
- network chart
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a subgraph query method in a large scale network graph based on adjacent node trees. The invention uses the adjacent relation of nodes to form index trees, and uses the adjacent node trees as an index characteristic of the large scale network graph to realize the query process of the subgraph. First, a graphic label list, a layer by layer tag list, and an edge list are established according to the adjacent relation of the graph nodes, and adjacent node tree index is constructed based on the lists; secondly, the nodes matching candidate set are obtained through decomposing the query graph to the adjacent node tree sets and tailoring the candidate nodes by utilizing the established adjacent node tree index; and finally, by employing the strategy of covering the query graph with the adjacent node tree sets, a subgraph query result is obtained based on the node matching method. The method uses the adjacent relation to realize effective filtering of the candidate nodes and rapid covering of the query graph, and is capable of supporting rapid query of the subgraph in the large scale network graph.
Description
Technical field
The invention belongs to information retrieval and database structure technical field thereof, particularly relate to a kind of subgraph query method of setting based on adjacent node in catenet figure.
Background technology
Figure is the important data structures in computer science.Along with infotech ground development, occurred that increasing data are usingd to scheme as logical expression, for example bio-networks, chemical molecular structural formula, community network and protein network etc.The data volume that these diagram datas comprise itself also in continuous increase, for example, has 4,000 new chemical constitutions to be added in SCF Finder database every day.Especially, the interstitial content in current social network chart has reached more than one hundred million.Therefore diagram data how effectively to manage and excavate magnanimity is the key problem of chart database research.Specifically comprise: 1) how to set up effective memory mechanism and index strategy; 2) how fast and effeciently in catenet figure, to inquire about; 3) how from the chart database of magnanimity, to excavate Useful Information.Along with the appearance of the complex network figure such as community network, how given query graph, find all subgraphs that mate with query graph to become very meaningful in a Large Graph.For example, by subgraph match mode, can find the particular friend circle in community network, and the functional group in bio-networks etc.
At present existed some will solve by subgraph index technology the querying method of subgraph match in catenet figure.These methods are the strategy based in abutting connection with feature mainly, utilizes internodal structural information or internodal shortest path as index structure, to reduce coupling cost and search time.Yet, utilizing while carrying out the invalid node of beta pruning in abutting connection with attribute or path as indexing units, be easy to lose node structural information around.Meanwhile, the pseudo-effectively node of part may be retained and need further to filter as both candidate nodes.In addition,, compared to tree or the so comparatively complicated structure of subgraph, only based on information such as hops, in matching process, need more attended operation.The patent of invention that is CN102254012A as publication number has proposed a kind of diagram data storage means and subgraph query method based on external memory, the method is by being a kind of standard drawing data layout to diagram data uniform format, then according to the label information of the starting point on every limit in diagram data and terminal, classified and store and B+-Tree index is set up in every class limit in limit in figure, according to the label information on each point in diagram data, point in figure is divided into some territories, and in same territory, every bit is pressed identifier order successively corresponding to one; Then according to the starting point on limit, terminal label information, for setting up a bitmap index in each class limit; An origin information data histogram and an endpoint information data histogram are set up in each class limit.Wherein, about subgraph inquiry, first inquiry subgraph is decomposed, then the submodule decompositing is inquired about and Query Result is integrated.This invention step is complicated, and operand is large, and efficiency is not high.
Owing to carrying out node filtration and coupling based on information such as hops, it is not effective subgraph query method, thereby for the design feature of community network figure, be necessary to provide one can utilize structural information more complicated between node to carry out index and improve the method for subgraph search efficiency.
Summary of the invention
The present invention is directed to complicated operation in the inquiry of current subgraph, easily lose the node problems such as structural information around, propose a kind ofly utilize structural information more complicated between node to carry out index and improve the method for subgraph search efficiency.
A network chart indexing means based on adjacent node tree, comprises step:
(1), according to the internodal syntople of network chart, set up the adjacent node tree index of network chart, according to the internodal syntople of query graph, decomposition query figure;
(2), the initial matching Candidate Set using node set identical with query graph node label in network chart as query graph node;
(3), by beta pruning, obtain the node matching Candidate Set that each query graph node is corresponding;
(4), adopt the overlay strategy of adjacent node tree collection to realize subgraph match.
Described step (1) comprises step:
Adopt depth optimization method that the abutment points tree of network chart is carried out to mode standard, and use tree character string mode to represent adjacent node tree, according to the syntople between node of graph, set up respectively the Hash label table of network chart and query graph, successively mark sheet and limit list, and build based on this adjacent node tree index;
Adopt depth optimization method that the abutment points tree of query graph is carried out to mode standard, and use tree character string mode to represent adjacent node tree, according to the syntople between node of graph, set up the Hash label table of query graph, successively mark sheet and limit list.
Suppose that v is the node in query graph, u is the node in the initial matching Candidate Set of node v, and described step (3) comprises step:
3.1), the adjacent node label list of v and u relatively, establish node v in to have label be that the adjacent node number of X is n
vif it is that adjacent node or the adjacent node number of X is less than n that node u does not have label
v, from initial matching Candidate Set, reject u, and proceed to step 3.4), otherwise, continue step 3.2 below);
3.2), the successively mark sheet of query node v and u, the quantity on limit during identical layer relatively, establishes limit with respect to the layer of node v and u during for k, the quantity with certain same edge e is respectively count (e, v), count (e, u), if count (e, v) be less than count (e, u), from initial matching Candidate Set, reject u, and proceed to step 3.4), otherwise, continue step 3.3 below);
3.3), the character string of comparison node v and u adjacent node tree, if the character string of node u can not comprise the character string of node v, from initial matching Candidate Set, reject u;
3.4) if the node of not accessing in addition in initial matching Candidate Set proceeds to step 3.1), all nodes in traversal initial matching Candidate Set, otherwise finish.
Described step 4) comprise step:
Select a node that node v ' will access as first in query graph, the node matching Candidate Set of traversal v ', with set I, deposit the current adjacent node tree having mated in network chart and query graph, u ' is the node in node matching Candidate Set, if meet following condition:
(1) adjacent node of u ' tree T (u ') is crossing with certain adjacent node tree P having mated in network chart;
(2) adjacent node of v ' tree T (v ') is crossing with certain adjacent node tree P ' having mated in query graph;
(3) P mates with P ', thinks T (u ') and T (v ') coupling, and T (u ') and T (v ') are put into and gather I, and the limit of the query graph comprising in mark T (v ') is for accessing;
Wherein intersect between referring to tree and setting and at least have a total limit;
When all limits of query graph are all accessed, the network subgraph that all of its neighbor node tree that in set I, network chart has mated forms is a Query Result;
Work as all nodes in the node matching Candidate Set of v ' and all access, poll-final, and return to the Query Result of all acquisitions.
The present invention is based on the network chart indexing means of adjacent node tree, utilize internodal syntople to form index tree, and using adjacent node tree and realize subgraph query script as the index feature of catenet figure, utilize the syntople of node to realize effective filtration of both candidate nodes and the rapid Cover of query graph, can support the fast query of subgraph in catenet figure.
Accompanying drawing explanation
Fig. 1 is catenet diagram illustration;
Fig. 2 is query graph exemplary plot;
Fig. 3 is the network chart indexing means process flow diagram that the present invention is based on adjacent node tree;
Fig. 4 a is network chart node u
5adjacent node tree;
Fig. 4 b is network chart node u
9adjacent node tree;
Fig. 4 c query graph node v
0adjacent node tree.
Embodiment
Below in conjunction with accompanying drawing, specific embodiment of the invention process is specifically addressed.
Using Fig. 1 as large-scale network chart, and Fig. 2 is example as query graph, specifically sets forth implementation step of the present invention, A wherein, and B, C, D is node label, and u is the node of catenet figure, and the medium-and-large-sized network chart node of Fig. 1 comprises u
0to u
13totally 14 nodes, v is query graph node, in Fig. 2, query graph comprises v
0to v
3totally 4 nodes.
As shown in Figure 3, a kind of network chart indexing means based on adjacent node tree provided by the invention, comprises step:
S1, according to the internodal syntople of network chart, set up the adjacent node tree index of network chart, according to the internodal syntople of query graph, decomposition query figure.
For guaranteeing the uniqueness of tree, utilize depth first method that the adjacent node tree of network chart is carried out to mode standard, and use tree character string mode to represent adjacent node tree.As shown in Figure 4, u for example
5abutment points tree as shown in Fig. 4 a, u
9abutment points tree as shown in Figure 4 b, and query graph node v
0adjacent node tree as shown in Fig. 4 c.
Select the represented tree of minimum character string as the mode standard of adjacent node tree.U
5, u
9, v
0adjacent node set corresponding character string and be respectively:
Node u
5character string be: " ABA#C#C##CB##DB#C### ";
Node u
9character string be: " ABC#D##CB#D#D##DB#C### ";
And node v
0character string be: " ABC#D##CB#D### ".
According to the syntople between node of graph, set up respectively the adjacent node label list (Label_Table) of figure, successively mark sheet (Signature_Table) and limit list (Edge_List), and build based on this adjacent node tree index.Adopt breadth first method traverses network figure, the Hash that records the limit identical with the distance of root node and their quantity is mark sheet successively, sets up the adjacent node Hash label table of storage adjacent node label information and the Hash limit list on storage all of its neighbor limit simultaneously.Wherein, the label that the key word of label list is node, value is the node listing with this label, and successively the key word of mark sheet is the boundary layer number with respect to node, and value is limit and limit quantity.
Network chart node u for example
0adjacent node label list as shown in table 1:
Table 1
Network chart node u
9successively mark sheet and limit list as shown in table 2:
Table 2
Network chart node u
11successively mark sheet and limit list as shown in table 3:
Table 3
For query graph, adopt the same procedure of setting up adjacent node tree with network chart, set up the adjacent node of query graph and set and obtain corresponding tree character string, adopt breadth first method traversal queries figure, set up successively mark sheet, adjacent node label list and limit list.
Query graph v wherein
0adjacent node label list as shown in table 4:
| label | vid |
| B | 1 |
| |
2 |
Table 4
Query graph node of graph v
0layer mark sheet and limit list as shown in table 5:
Table 5
S2, the initial matching Candidate Set using node set identical with query graph node label in network chart as query graph node, as shown in table 6:
Table 6
S3, the Pruning strategy based on adjacent node tree index obtain node matching Candidate Set.
By beta pruning, obtain the node matching Candidate Set of query graph, for the corresponding initial matching Candidate Set of node v in query graph, by beta pruning, obtain the node matching Candidate Set of query graph, wherein u is the node of network chart, v is the node of query graph, and the procurement process of node Candidate Set is as follows:
S3.1, supposition u are the nodes in the initial matching Candidate Set of node v, their adjacent node label list relatively, establish node v in to have label be that the adjacent node number of X is n
vif it is that adjacent node or the adjacent node number of X is less than n that node u does not have label
v, from initial matching Candidate Set, reject u, and proceed to step S3.4, otherwise, step S3.2 below continued;
For example,, in network chart, with query graph node v
0the node that has same label has u
0, u
5, u
9, u
11.Node v
0the node being adjacent has node and 1 node that label is C that 1 label is B, however with node u
0only have the node that 2 labels are B, there is no label is the node of C, is not therefore node v
0candidate Set, so it concentrate is deleted to all the other node u from matching candidate
5, u
9, u
11all meet the demands.
The successively mark sheet of S3.2, query node v and u, the quantity on limit during more identical level.If limit is with respect to a layer level of node v and u while being k, the quantity with certain same edge e is respectively count (e, v), count (e, u), if count (e, v) be less than count (e, u), from initial matching Candidate Set, reject u, and proceed to step S3.4, otherwise, continue step S3.3 below;
For example, query graph node v
0with network chart node u
11relatively their successively mark sheet, relatively can find node v by table 3 and table 5
0at ground floor to there being one to connect two limits that node label is C, D between the second layer, and node u
11no, so node u
11can not be as node v
0both candidate nodes, so it concentrate is deleted from matching candidate; The known node u of comparison sheet 2 and table 5 again
9satisfy condition.Node v now
0matching candidate concentrate to also have u
5, u
9.
The character string of S3.3, comparison node v and u adjacent node tree if the character string of node u can not comprise the character string of node v, is rejected u from initial matching Candidate Set;
If the node of not accessing in addition in S3.4 initial matching Candidate Set proceeds to step S3.1, until all nodes in initial matching Candidate Set are all accessed to, matching candidate collection is chosen end.
Difference comparison node u
5, u
9and v
0character string, due to node u
5character string can not comprise node v
0character string, therefore by u
5from initial matching Candidate Set, reject, obtain comprising u
9the matching candidate collection of a unique node.
S4, the overlay strategy that adopts adjacent node tree to collect realize subgraph match.
Select a node that node v ' will access as first in query graph, the node matching Candidate Set of traversal v '.Suppose with set I and deposit the current adjacent node tree having mated in network chart and query graph.If u ' is the node in node matching Candidate Set, if meet following condition:
(1) in the adjacent node of u ' tree T (u ') and set I, certain adjacent node tree P of network chart intersects, and wherein intersects between referring to tree and setting and at least has a total limit;
(2) in the adjacent node of v ' tree T (v ') and set I, certain adjacent node tree P ' of query graph intersects;
(3) P mates with P ', thinks T (u ') and T (v ') coupling, and T (u ') and T (v ') are put into and gather I, and the limit of the query graph comprising in mark T (v ') is for accessing.
When all limits of query graph are all accessed, the network subgraph that all of its neighbor node tree that in set I, network chart has mated forms is a Query Result.Work as all nodes in the node matching Candidate Set of v ' and all access, poll-final, and return to the Query Result of all acquisitions.
Select node v
0the node that will access as first, from first element u of node matching Candidate Set
9start coupling, by u
9and v
0adjacent node tree put into set I, now all limits of query graph are all accessed to, and obtain a Query Result [u
6, u
7, u
8, u
9].So far, node v
0matching candidate collection traversal finish.In sum, obtain altogether the Query Result [u of 1 coupling
6, u
7, u
8, u
9].
Adopt a kind of catenet index of the picture method based on adjacent node tree provided by the invention, can realize effective filtration of both candidate nodes and the rapid Cover of query graph, can support the fast query of subgraph in catenet figure.
Claims (8)
1. a network chart indexing means of setting based on adjacent node, comprises step:
(1), according to the internodal syntople of network chart, set up the adjacent node tree index of network chart, according to the internodal syntople of query graph, decomposition query figure;
(2), the initial matching Candidate Set using node set identical with query graph node label in network chart as query graph node;
(3), by beta pruning, obtain the node matching Candidate Set that each query graph node is corresponding;
V is the node in query graph, and u is the node in the initial matching Candidate Set of node v, and described step (3) comprises step:
3.1), the adjacent node label list of v and u relatively, establish that in node v, to have label be that the adjacent node number of X is n
vif it is that adjacent node or the adjacent node number of X is less than n that node u does not have label
v, from initial matching Candidate Set, reject u, and proceed to step 3.4), otherwise, continue step 3.2 below);
3.2), the successively mark sheet of query node v and u, the quantity on identical layer limit relatively, establishes limit with respect to the layer of node v and u during for k; the quantity with certain same edge e is respectively count (e; v), count (e, u), if count (e; v) be less than count (e; u), from initial matching Candidate Set, reject u, and proceed to step 3.4); otherwise, continue step 3.3 below);
3.3), the character string of comparison node v and u adjacent node tree, if the character string of node u can not comprise the character string of node v, from initial matching Candidate Set, reject u;
3.4) if the node of not accessing in addition in initial matching Candidate Set proceeds to step 3.1), each node in traversal initial matching Candidate Set, otherwise finish; (4), adopt the overlay strategy of adjacent node tree collection to realize subgraph match.
2. the network chart indexing means based on adjacent node tree as claimed in claim 1, is characterized in that, described step (1) comprises step:
The abutment points tree of network chart is carried out to mode standard, according to the syntople between node of graph, set up respectively the label list of network chart and query graph, successively mark sheet and limit list, and build based on this network chart adjacent node tree index;
The abutment points tree of query graph is carried out to mode standard, according to the syntople between node of graph, set up respectively the label list of network chart and query graph, successively mark sheet and limit list.
3. the network chart indexing means based on adjacent node tree as claimed in claim 2, is characterized in that: the abutment points tree of network chart is carried out to mode standard and the abutment points tree of query graph is carried out to mode standardization all adopting depth first method.
4. the network chart indexing means based on adjacent node tree as claimed in claim 3, is characterized in that: described mode standard refers to and uses tree character string mode to represent adjacent node tree.
5. the network chart indexing means based on adjacent node tree as claimed in claim 2, is characterized in that: adopt breadth first method, set up the label list of network chart and query graph, successively mark sheet and limit list.
6. the network chart indexing means based on adjacent node tree as claimed in claim 5, is characterized in that: described label list, successively mark sheet and limit list are Hash table.
7. the network chart indexing means based on adjacent node tree as claimed in claim 1, is characterized in that, described step (4) comprises step:
Select a node that node v ' will access as first in query graph, the node matching Candidate Set of traversal v ', with set I, deposit the current adjacent node tree having mated in network chart and query graph, u ' is the node in node matching Candidate Set, if meet following condition:
(1) adjacent node of u ' tree T (u ') is crossing with certain adjacent node tree P having mated in network chart;
(2) adjacent node of v ' tree T (v ') is crossing with certain adjacent node tree P ' having mated in query graph;
(3) P mates with P ', thinks T (u ') and T (v ') coupling, and T (u ') and T (v ') are put into and gather I, and the limit of the query graph comprising in mark T (v ') is for accessing;
When all limits of query graph are all accessed, the network subgraph that all of its neighbor node tree that in set I, network chart has mated forms is a Query Result;
Work as all nodes in the node matching Candidate Set of v ' and all access, poll-final, and return to the Query Result of all acquisitions.
8. the network chart indexing means based on adjacent node tree as claimed in claim 7, is characterized in that, wherein intersects between referring to tree and setting and at least has a total limit.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210063543.9A CN102662974B (en) | 2012-03-12 | 2012-03-12 | A network graph index method based on adjacent node trees |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210063543.9A CN102662974B (en) | 2012-03-12 | 2012-03-12 | A network graph index method based on adjacent node trees |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102662974A CN102662974A (en) | 2012-09-12 |
| CN102662974B true CN102662974B (en) | 2014-02-26 |
Family
ID=46772465
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210063543.9A Expired - Fee Related CN102662974B (en) | 2012-03-12 | 2012-03-12 | A network graph index method based on adjacent node trees |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102662974B (en) |
Families Citing this family (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103037317A (en) * | 2012-12-23 | 2013-04-10 | 无锡泛联软件科技有限公司 | Energy-conservation multicasting method based on relay group in wireless self-organized and sensor network |
| CN103106279B (en) * | 2013-02-21 | 2018-06-15 | 浙江大学 | Clustering method a kind of while based on nodal community and structural relationship similarity |
| CN103345508B (en) * | 2013-07-04 | 2016-09-21 | 北京大学 | A kind of date storage method being applicable to community network figure and system |
| WO2015100549A1 (en) * | 2013-12-30 | 2015-07-09 | 华为技术有限公司 | Graph data query method and device |
| CN104063507B (en) * | 2014-07-09 | 2017-10-17 | 时趣互动（北京）科技有限公司 | A kind of figure computational methods and system |
| CN104504003B (en) * | 2014-12-09 | 2018-03-13 | 北京航空航天大学 | The searching method and device of diagram data |
| CN106649359B (en) * | 2015-10-30 | 2021-05-18 | 方正国际软件(北京)有限公司 | Method and device for processing spatial point data |
| CN107018074B (en) * | 2017-04-06 | 2019-11-05 | 湘潭大学 | A kind of network-in-dialing path method for fast searching based on flattening |
| CN106991195B (en) * | 2017-04-28 | 2020-08-11 | 南京大学 | Distributed subgraph enumeration method |
| US10826781B2 (en) * | 2017-08-01 | 2020-11-03 | Elsevier, Inc. | Systems and methods for extracting structure from large, dense, and noisy networks |
| CN107609175B (en) * | 2017-09-28 | 2021-01-29 | 华为技术有限公司 | DOM tree generation method and related equipment |
| CN108388642B (en) * | 2018-02-27 | 2020-08-18 | 中南民族大学 | Sub-graph query method and device and computer readable storage medium |
| CN109063089B (en) * | 2018-07-26 | 2021-04-23 | 清华大学 | Subgraph matching method and device based on community structure |
| CN110781255B (en) * | 2019-08-29 | 2024-04-05 | 腾讯大地通途（北京）科技有限公司 | Road aggregation method, road aggregation device and electronic equipment |
| CN114741570A (en) * | 2022-01-20 | 2022-07-12 | 浙江大华技术股份有限公司 | Graph database query method, index creation method and related equipment |
| CN116319518B (en) * | 2022-08-31 | 2024-02-20 | 王举范 | Information acquisition method and device based on shortest path of knowledge graph |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1207464A2 (en) * | 2000-11-15 | 2002-05-22 | Samsung Electronics Co. Ltd. | Database indexing using a tree structure |
| CN1755685A (en) * | 2004-09-30 | 2006-04-05 | 微软公司 | Query formulation |
| CN101751447A (en) * | 2009-07-22 | 2010-06-23 | 中国科学院自动化研究所 | Network image retrieval method based on semantic analysis |
| CN102073708A (en) * | 2010-12-30 | 2011-05-25 | 东北大学 | Large-scale uncertain graph database-oriented subgraph query method |
| CN102254012A (en) * | 2011-07-19 | 2011-11-23 | 北京大学 | Graph data storing method and subgraph enquiring method based on external memory |
-
2012
- 2012-03-12 CN CN201210063543.9A patent/CN102662974B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1207464A2 (en) * | 2000-11-15 | 2002-05-22 | Samsung Electronics Co. Ltd. | Database indexing using a tree structure |
| CN1755685A (en) * | 2004-09-30 | 2006-04-05 | 微软公司 | Query formulation |
| CN101751447A (en) * | 2009-07-22 | 2010-06-23 | 中国科学院自动化研究所 | Network image retrieval method based on semantic analysis |
| CN102073708A (en) * | 2010-12-30 | 2011-05-25 | 东北大学 | Large-scale uncertain graph database-oriented subgraph query method |
| CN102254012A (en) * | 2011-07-19 | 2011-11-23 | 北京大学 | Graph data storing method and subgraph enquiring method based on external memory |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102662974A (en) | 2012-09-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102662974B (en) | A network graph index method based on adjacent node trees | |
| CN106933833B (en) | Method for quickly querying position information based on spatial index technology | |
| CN103631909B (en) | System and method for combined processing of large-scale structured and unstructured data | |
| CN102722566B (en) | Method for inquiring potential friends in social network | |
| CN103561133B (en) | A kind of IP address attribution information index method and method for quickly querying | |
| CN104462582B (en) | A kind of web data similarity detection method based on structure and content secondary filtration | |
| CN103198151B (en) | The search index system and method for regional urban public traffic vehicles operation information | |
| CN103345521B (en) | A kind of method and apparatus processing key assignments in Hash table database | |
| CN103605752A (en) | Address matching method based on semantic recognition | |
| CN102867066B (en) | Data Transform Device and data summarization method | |
| CN104346444B (en) | A kind of the best site selection method based on the anti-spatial key inquiry of road network | |
| CN103092867A (en) | Method and system for managing data, and data analyzing device | |
| CN103678550A (en) | Mass data real-time query method based on dynamic index structure | |
| CN106503223A (en) | A kind of binding site and the online source of houses searching method and device of key word information | |
| CN104391908B (en) | Multiple key indexing means based on local sensitivity Hash on a kind of figure | |
| CN105515997B (en) | The higher efficiency range matching process of zero scope expansion is realized based on BF_TCAM | |
| CN110928882B (en) | Memory database indexing method and system based on improved red black tree | |
| CN104615734B (en) | A kind of community management service big data processing system and its processing method | |
| CN104881427A (en) | Data blood relationship analyzing method for power grid regulation and control running | |
| CN103106198A (en) | Tree structure implementation method and tree structure implementation device | |
| CN104408067A (en) | Multi-tree structure database design method and device | |
| CN102081649A (en) | Method and system for searching computer files | |
| CN113704248B (en) | Block chain query optimization method based on external index | |
| CN105354266A (en) | Rich graph model RichGraph based graph data management method | |
| CN103365960A (en) | Off-line searching method of structured data of electric power multistage dispatching management |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140226 Termination date: 20160312 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |