A graph search method based on iteration
The invention discloses a graph searching method based on iteration, which improves the efficiency of graph searching. The method comprises the following steps of: adding a first node in a graph database to a queue, wherein the graph database comprises N nodes in a network graph; A graph database is...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Patent |
| Sprache: | chi ; eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | CAI SHIYONG CHEN GUANGCONG ZHANG SHAOWEI |
| description | The invention discloses a graph searching method based on iteration, which improves the efficiency of graph searching. The method comprises the following steps of: adding a first node in a graph database to a queue, wherein the graph database comprises N nodes in a network graph; A graph database is traversed by a first node as a parent node, and a second node is searched out from the graph database, a connecting edge exists between the first node and the second node, and the second node is a node that is not marked as processed; Adding a second node to the queue and marking the first node asa processed node; The first node is ejected from the queue to determine whether all nodes in the queue are ejected. If there are still nodes that are not ejected, the remaining nodes in the queue areused as parent nodes to search the graph database again, and the queue is updated after new nodes are searched until all sections in the queue are ejected, thus ending the graph search process.
本发明公开了种基于迭代的图搜索方法，提高图搜索的效率。该方法包括 |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN109299337A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN109299337A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN109299337A3</originalsourceid><addsrcrecordid>eNrjZNBwVEgvSizIUChOTSxKzlDITS3JyE9RSEosTk1RyM9TyCxJLUosyczP42FgTUvMKU7lhdLcDIpuriHOHrqpBfnxqcUFicmpeakl8c5-hgaWRpaWxsbmjsbEqAEAkQ0n2g</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>A graph search method based on iteration</title><source>esp@cenet</source><creator>CAI SHIYONG ; CHEN GUANGCONG ; ZHANG SHAOWEI</creator><creatorcontrib>CAI SHIYONG ; CHEN GUANGCONG ; ZHANG SHAOWEI</creatorcontrib><description>The invention discloses a graph searching method based on iteration, which improves the efficiency of graph searching. The method comprises the following steps of: adding a first node in a graph database to a queue, wherein the graph database comprises N nodes in a network graph; A graph database is traversed by a first node as a parent node, and a second node is searched out from the graph database, a connecting edge exists between the first node and the second node, and the second node is a node that is not marked as processed; Adding a second node to the queue and marking the first node asa processed node; The first node is ejected from the queue to determine whether all nodes in the queue are ejected. If there are still nodes that are not ejected, the remaining nodes in the queue areused as parent nodes to search the graph database again, and the queue is updated after new nodes are searched until all sections in the queue are ejected, thus ending the graph search process.
本发明公开了种基于迭代的图搜索方法，提高图搜索的效率。该方法包括</description><language>chi ; eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2019</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20190201&DB=EPODOC&CC=CN&NR=109299337A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25562,76317</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20190201&DB=EPODOC&CC=CN&NR=109299337A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>CAI SHIYONG</creatorcontrib><creatorcontrib>CHEN GUANGCONG</creatorcontrib><creatorcontrib>ZHANG SHAOWEI</creatorcontrib><title>A graph search method based on iteration</title><description>The invention discloses a graph searching method based on iteration, which improves the efficiency of graph searching. The method comprises the following steps of: adding a first node in a graph database to a queue, wherein the graph database comprises N nodes in a network graph; A graph database is traversed by a first node as a parent node, and a second node is searched out from the graph database, a connecting edge exists between the first node and the second node, and the second node is a node that is not marked as processed; Adding a second node to the queue and marking the first node asa processed node; The first node is ejected from the queue to determine whether all nodes in the queue are ejected. If there are still nodes that are not ejected, the remaining nodes in the queue areused as parent nodes to search the graph database again, and the queue is updated after new nodes are searched until all sections in the queue are ejected, thus ending the graph search process.
本发明公开了种基于迭代的图搜索方法，提高图搜索的效率。该方法包括</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2019</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZNBwVEgvSizIUChOTSxKzlDITS3JyE9RSEosTk1RyM9TyCxJLUosyczP42FgTUvMKU7lhdLcDIpuriHOHrqpBfnxqcUFicmpeakl8c5-hgaWRpaWxsbmjsbEqAEAkQ0n2g</recordid><startdate>20190201</startdate><enddate>20190201</enddate><creator>CAI SHIYONG</creator><creator>CHEN GUANGCONG</creator><creator>ZHANG SHAOWEI</creator><scope>EVB</scope></search><sort><creationdate>20190201</creationdate><title>A graph search method based on iteration</title><author>CAI SHIYONG ; CHEN GUANGCONG ; ZHANG SHAOWEI</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN109299337A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2019</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>CAI SHIYONG</creatorcontrib><creatorcontrib>CHEN GUANGCONG</creatorcontrib><creatorcontrib>ZHANG SHAOWEI</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>CAI SHIYONG</au><au>CHEN GUANGCONG</au><au>ZHANG SHAOWEI</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>A graph search method based on iteration</title><date>2019-02-01</date><risdate>2019</risdate><abstract>The invention discloses a graph searching method based on iteration, which improves the efficiency of graph searching. The method comprises the following steps of: adding a first node in a graph database to a queue, wherein the graph database comprises N nodes in a network graph; A graph database is traversed by a first node as a parent node, and a second node is searched out from the graph database, a connecting edge exists between the first node and the second node, and the second node is a node that is not marked as processed; Adding a second node to the queue and marking the first node asa processed node; The first node is ejected from the queue to determine whether all nodes in the queue are ejected. If there are still nodes that are not ejected, the remaining nodes in the queue areused as parent nodes to search the graph database again, and the queue is updated after new nodes are searched until all sections in the queue are ejected, thus ending the graph search process.
本发明公开了种基于迭代的图搜索方法，提高图搜索的效率。该方法包括</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | chi ; eng |
| recordid | cdi_epo_espacenet_CN109299337A |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
| title | A graph search method based on iteration |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T17%3A56%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=CAI%20SHIYONG&rft.date=2019-02-01&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN109299337A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |