Efficient methods for querying and mining real-world graph data

The ability to extract or retrieve useful knowledge has become one of the most important challenges in government, industry, and scientific communities. Much success has been achieved when the data to be mined / retrieved and their relationships are modeled as graphs. Over the past few years, resear...

Full description

Saved in:
Bibliographic Details
Main Author: Zhu, Linhong
Other Authors: Byron Choi
Format: Theses and Dissertations
Language:English
Published: 2013
Subjects:
Online Access:https://hdl.handle.net/10356/53624
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-53624
record_format dspace
spelling sg-ntu-dr.10356-536242023-03-04T00:43:12Z Efficient methods for querying and mining real-world graph data Zhu, Linhong Byron Choi Ng Wee Keong School of Computer Engineering DRNTU::Engineering::Computer science and engineering::Information systems::Information storage and retrieval The ability to extract or retrieve useful knowledge has become one of the most important challenges in government, industry, and scientific communities. Much success has been achieved when the data to be mined / retrieved and their relationships are modeled as graphs. Over the past few years, research on efficient mining and querying graph data has steadily increased. Among many graph-based applications, there are special interests on two types of applications: graph reachability query and approximate graph matching query. To efficiently process the aforementioned querying and mining tasks, indexing is widely adopted. However, the performance of an indexing technique is often influenced by the structural- and attribution- properties of the graph to be indexed. Unfortunately, there has not been much work on applying suitable indexes to a graph or subgraph with a specific structure. In addition, utilizing both structures and attributes to do indexing has not been well studied. DOCTOR OF PHILOSOPHY (SCE) 2013-06-06T06:22:41Z 2013-06-06T06:22:41Z 2011 2011 Thesis Zhu, L. (2011). Efficient methods for querying and mining real-world graph data. Doctoral thesis, Nanyang Technological University, Singapore. https://hdl.handle.net/10356/53624 10.32657/10356/53624 en 135 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic DRNTU::Engineering::Computer science and engineering::Information systems::Information storage and retrieval
spellingShingle DRNTU::Engineering::Computer science and engineering::Information systems::Information storage and retrieval
Zhu, Linhong
Efficient methods for querying and mining real-world graph data
description The ability to extract or retrieve useful knowledge has become one of the most important challenges in government, industry, and scientific communities. Much success has been achieved when the data to be mined / retrieved and their relationships are modeled as graphs. Over the past few years, research on efficient mining and querying graph data has steadily increased. Among many graph-based applications, there are special interests on two types of applications: graph reachability query and approximate graph matching query. To efficiently process the aforementioned querying and mining tasks, indexing is widely adopted. However, the performance of an indexing technique is often influenced by the structural- and attribution- properties of the graph to be indexed. Unfortunately, there has not been much work on applying suitable indexes to a graph or subgraph with a specific structure. In addition, utilizing both structures and attributes to do indexing has not been well studied.
author2 Byron Choi
author_facet Byron Choi
Zhu, Linhong
format Theses and Dissertations
author Zhu, Linhong
author_sort Zhu, Linhong
title Efficient methods for querying and mining real-world graph data
title_short Efficient methods for querying and mining real-world graph data
title_full Efficient methods for querying and mining real-world graph data
title_fullStr Efficient methods for querying and mining real-world graph data
title_full_unstemmed Efficient methods for querying and mining real-world graph data
title_sort efficient methods for querying and mining real-world graph data
publishDate 2013
url https://hdl.handle.net/10356/53624
_version_ 1759856865728004096