Towards efficient processing of graph queries = 그래프 질의의 효율적인 처리에 관한 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 289
  • Download : 0
Conceptually, a graph consists of a set of vertices and edges where both vertices and edges may have attributes to represent complex information associated with themselves. There are a lot of real-world datasets, which can be easily expressed as graphs. For example, it is natural to represent computer networks, food webs, protein interactions, and social networks as graphs. From the users` point of view, the main concern is how to quickly find information they needed from these graph datasets after issuing graph-structured queries. The goal of this thesis is to provide efficient ways of processing graph queries over large graph datasets. In this thesis, we focus on two types of graph query problems, i.e., subgraph matching and graph containment. We first answer to a subgraph matching query problem. The results of a subgraph matching query are all occurrences of the query in a target data graph. Since a target data graph typically has a lot of vertices, the main challenge of the problem is how to filter out unqualified vertices, which are not eligible to be mapped to vertices in the query. Here we analyze all possible vertex features, which are made of the combination of label distribution and connectivity information within two hops of neighbor of a vertex, and choose vertex features that are balanced with pruning power and extraction cost. Then, we propose a feature indexing method over the chosen vertex features, which is used for finding candidates for each vertex in query processing. Meanwhile, due to potential errors and noises in real-world graph datasets, exact subgraph matching may be sometimes inappropriate in practice. Thus approximate subgraph matching is also required. In this thesis, we investigate an approximate subgraph matching model that allows missing edges. A simple solution is to first generate all query subgraphs from a query within a threshold and perform exact subgraph matching for each query subgraph separately. The main challenge o...
Advisors
Lee, Yoon-Joonresearcher이윤준
Description
한국과학기술원 : 전산학과,
Publisher
한국과학기술원
Issue Date
2013
Identifier
513966/325007  / 020095026
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전산학과, 2013.2, [ vii, 63 p. ]

Keywords

grpah query; approximate subgraph matching; graph database; feature index; 그래프 질의; 근사 부분그래프 매칭; 그래프 데이터베이스; 특징 인덱스; 병렬 처리; parallel processing

URI
http://hdl.handle.net/10203/180358
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=513966&flag=dissertation
Appears in Collection
CS-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0