Much work has been devoted to supporting RDF data. But state-of-the-art systems and
methods still cannot handle web scale RDF data effectively. Furthermore, many useful and …

With the prevalence of graph data in a variety of domains, there is an increasing need for a
language to query and manipulate graphs with heterogeneous attributes and structures. We …

Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes
it an np-complete problem. Moreover, it requires bijective functions, which are often too …

Graph pattern matching is commonly used in a variety of emerging applications such as
social network analysis. These applications highlight the need for studying the following two …

Reachability queries on large directed graphs have attracted much attention recently. The
existing work either uses spanning structures, such as chains or trees, to compress the …

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

Many applications work with graph-structured data. As graphs grow in size, indexing
becomes essential to ensure sufficient query performance. We present the GRIPP index …

Efficient shortest path query answering in large graphs is enjoying a growing number of
applications, such as ranked keyword search in databases, social networks, ontology …

The growing popularity of graph databases has generated interesting data management
problems, such as subgraph search, shortest-path query, reachability verification, and …

Given a large directed graph, rapidly answering reachability queries between source and
target nodes is an important problem. Existing methods for reachability trade-off indexing …