Druid is an open source data store designed for real-time exploratory analytics on large data
sets. The system combines a column-oriented storage layout, a distributed, shared-nothing …

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 …

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 …

In this paper, we propose a scalable and highly efficient index structure for the reachability
problem over graphs. We build on the well-known node interval labeling scheme where the …

Reachability queries are a fundamental type of queries on graphs that find important
applications in numerous domains. Although a plethora of techniques have been proposed …

In this paper, we study the problem of label-constrained reachability (LCR) query which is
fundamental in many applications with directed edge-label graphs. Although the classical …

As an important graph operator, reachability query has been extensively studied over
decades, which is to check whether a vertex can reach another vertex over a large directed …

Massive volumes of uncertain trajectory data are being generated by GPS devices. Due to
the limitations of GPS data, these trajectories are generally uncertain. This state of affairs …

Reachability querying is a basic graph operation with numerous important applications in
databases, network analysis, computational biology, software engineering, etc. Although …

Consider a directed edge-labeled graph, such as a social network or a citation network. A
fundamental query on such data is to determine if there is a path in the graph from a given …