The explosion in the amount of the available RDF data has lead to the need to explore,
query and understand such data sources. Due to the complex structure of RDF graphs and …

Graph has become increasingly important in modelling complicated structures and
schemaless data such as proteins, chemical compounds, and XML documents. Given a …

Subgraph Isomorphism is a fundamental problem in graph data processing. Most existing
subgraph isomorphism algorithms are based on a backtracking framework which computes …

It is common to find graphs with millions of nodes and billions of edges in, eg, social
networks. Queries on such graphs are often prohibitively expensive. These motivate us to …

Graph pattern matching is fundamental to social network analysis. Traditional techniques
are subgraph isomorphism and graph simulation. However, these notions often impose too …

Graphs are prevalently used to model the relationships between objects in various domains.
With the increasing usage of graph databases, it has become more and more demanding to …

Querying heterogeneous and large-scale knowledge graphs is expensive. This paper
studies a graph summarization framework to facilitate knowledge graph search.(1) We …

Complex social and information network search becomes important with a variety of
applications. In the core of these applications, lies a common and critical problem: Given a …

Extensible markup language (XML) is emerging as a de facto standard for information
exchange among various applications on the World Wide Web. There has been a growing …

Searching for all occurrences of a twig pattern in an XML document is an important
operation in XML query processing. Recently a holistic method TwigStack.[2] has been …