We consider the point-to-point (approximate) shortest-path query problem, which is the
following generalization of the classical single-source (SSSP) and all-pairs shortest-path …

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 reachability is fundamental to a wide range of applications, including XML indexing,
geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many …

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 …

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 …

A temporal graph is a graph in which vertices communicate with each other at specific time,
eg, A calls B at 11 am and talks for 7 minutes, which is modeled by an edge from A to B with …

Due to rapid growth of the Internet technology and new scientific/technological advances,
the number of applications that model data as graphs increases, because graphs have high …

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 …

Graphs have been the natural choice for modeling entities and the relationships among
them. One of the most fundamental graph processing operators is a reachability query …