Core Graph: Exploiting edge centrality to speedup the evaluation of iterative graph queries
When evaluating an iterative graph query over a large graph, systems incur significant
overheads due to repeated graph transfer across the memory hierarchy coupled with …
overheads due to repeated graph transfer across the memory hierarchy coupled with …
Shortest-path queries on complex networks: experiments, analyses, and improvement
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 …
operation on complex networks and has numerous applications. To handle shortest-path …
Agenda: Robust personalized PageRanks in evolving graphs
Given a source node s and a target node t in a graph G, the Personalized PageRank (PPR)
from s to t is the probability of a random walk starting from s terminates at t. PPR is a classic …
from s to t is the probability of a random walk starting from s terminates at t. PPR is a classic …
Compressgraph: Efficient parallel graph analytics with rule-based compression
Modern graphs exert colossal time and space pressure on graph analytics applications. In
2022, Facebook social graph reaches 2.91 billion users with trillions of edges. Many …
2022, Facebook social graph reaches 2.91 billion users with trillions of edges. Many …
Scalable distance labeling maintenance and construction for dynamic small-world networks
Shortest path computation is a fundamental operation of many applications in small-world
networks, and shortest path index has been extensively studied to achieve high query …
networks, and shortest path index has been extensively studied to achieve high query …
Generating -hop-constrained - Path Graphs
In this paper, we study two different problems that investigate relations between given
vertices and. The first problem is to generate the-hop-constrained-path graph, ie, the …
vertices and. The first problem is to generate the-hop-constrained-path graph, ie, the …
Batchhl: Answering distance queries on batch-dynamic networks at scale
Many real-world applications operate on dynamic graphs that undergo rapid changes in
their topological structure over time. However, it is challenging to design dynamic algorithms …
their topological structure over time. However, it is challenging to design dynamic algorithms …
Lego-graphrag: Modularizing graph-based retrieval-augmented generation for design space exploration
GraphRAG integrates (knowledge) graphs with large language models (LLMs) to improve
reasoning accuracy and contextual relevance. Despite its promising applications and strong …
reasoning accuracy and contextual relevance. Despite its promising applications and strong …
BatchHL: batch dynamic labelling for distance queries on large-scale networks
Many real-world applications operate on dynamic graphs to perform important tasks. In this
article, we study batch-dynamic algorithms that are capable of updating distance labelling …
article, we study batch-dynamic algorithms that are capable of updating distance labelling …
Data Management in the Noisy Intermediate-Scale Quantum Era
Quantum computing has emerged as a promising tool for transforming the landscape of
computing technology. Recent efforts have applied quantum techniques to classical …
computing technology. Recent efforts have applied quantum techniques to classical …