東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Index-based graph querying and match...

Zhang, Shijie.

FindBook

Google Book

Amazon

博客來

Index-based graph querying and matching in large graphs.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Index-based graph querying and matching in large graphs./
作者:	Zhang, Shijie.
面頁冊數:	108 p.
附註:	Source: Dissertation Abstracts International, Volume: 71-04, Section: B, page: 2517.
Contained By:	Dissertation Abstracts International71-04B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3401567
ISBN:	9781109690934

Index-based graph querying and matching in large graphs.
Zhang, Shijie.

Index-based graph querying and matching in large graphs. - 108 p.

Source: Dissertation Abstracts International, Volume: 71-04, Section: B, page: 2517.

Thesis (Ph.D.)--Case Western Reserve University, 2010.

Currently, a huge amount data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The size of an application graph may vary from tens of vertices to millions of vertices. Rich information may be retrieved if proper tools are provided. We are interested in applying index-based graph querying and matching techniques to both large and massive graphs. We use frequent subtrees for graph querying problem in a database composed of multiple small graphs. Subtree based indexing algorithms are efficient and effective in finding the supergraphs of any given query graph. For graph matching problem in a relatively large database graph, we proposed to use a distance based index structure. Optimized by a dynamic matching scheme, the algorithm can quickly find all the matches of any given query graph in the database graph. For graph matching in a massive database graph, we use a twofold index based on label combinations and shortest path trees. Last but not least, we discuss the future work of index-based graph querying and matching algorithms.

ISBN: 9781109690934Subjects--Topical Terms:

626642
Computer Science.

Index-based graph querying and matching in large graphs.
LDR:01946nam 2200265 4500 001 1391611
005 20110119094956.5
008 130515s2010 ||||||||||||||||| ||eng d
020 $a 9781109690934
035 $a (UMI)AAI3401567
035 $a AAI3401567
040 $a UMI $c UMI
100 1 $a Zhang, Shijie. $3 1670054
245 1 0 $a Index-based graph querying and matching in large graphs.
300 $a 108 p.
500 $a Source: Dissertation Abstracts International, Volume: 71-04, Section: B, page: 2517.
500 $a Adviser: Jiong Yang.
502 $a Thesis (Ph.D.)--Case Western Reserve University, 2010.
520 $a Currently, a huge amount data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The size of an application graph may vary from tens of vertices to millions of vertices. Rich information may be retrieved if proper tools are provided. We are interested in applying index-based graph querying and matching techniques to both large and massive graphs. We use frequent subtrees for graph querying problem in a database composed of multiple small graphs. Subtree based indexing algorithms are efficient and effective in finding the supergraphs of any given query graph. For graph matching problem in a relatively large database graph, we proposed to use a distance based index structure. Optimized by a dynamic matching scheme, the algorithm can quickly find all the matches of any given query graph in the database graph. For graph matching in a massive database graph, we use a twofold index based on label combinations and shortest path trees. Last but not least, we discuss the future work of index-based graph querying and matching algorithms.
590 $a School code: 0042.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 $a Case Western Reserve University. $3 1017714
773 0 $t Dissertation Abstracts International $g 71-04B.
790 1 0 $a Yang, Jiong, $e advisor
790 $a 0042
791 $a Ph.D.
792 $a 2010
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3401567