Graph traversals are a basic but fundamental ingredient for a variety of graph algorithms and
graph-oriented queries. To achieve the best possible query performance, they need to be …

Measuring proximity in a social network is an important task, with many interesting
applications, including person search and link prediction. Person search is the problem of …

The shortest-path query, which returns the shortest path between two vertices, is a basic
operation on complex networks and has numerous applications. To handle shortest-path …

To support analytics on massive graphs such as online social networks, RDF, Semantic
Web, etc. many new graph algorithms are designed to query graphs for a specific problem …

Graph analytics is becoming increasingly popular, with a number of new applications and
systems developed in the past few years. In this paper, we study Vertica relational database …

Graph is a ubiquitous structure representing entities and their relationships applied in many
areas such as social networks, web graphs, and biological networks. One of the …

Graph is a ubiquitous structure representing entities and their relationships applied in many
areas such as social networks, web graphs, and biological networks. One of the …

Graph is a ubiquitous structure representing entities and their relationships applied in many
areas such as social networks, web graphs, and biological networks. One of the …

Horton+ is a graph query processing system that executes declarative reachability queries
on a partitioned attributed multi-graph. It employs a query language, query optimizer, and a …

Shortest path query is an important problem and has been well studied in static graphs.
However, in practice, the costs of edges in graphs always change over time. We call such …