Back to papers
LM-SRPQ: Efficiently Answering Regular Path Query in Streaming Graphs
Summary: LM-SRPQ: hybrid persistent-RPQ for streaming graphs combining selective materialization of intermediate results with real-time traversal. Merges redundant storage and computation to cut memory and time; extensive experiments show clear gains over prior art.
(summarized by gpt-5-mini on Feb 09 2026)
- Paper ID
- 13354
- Venue
- VLDB
- Year
- 2024
- Pagerank
- 4.5697385e-05
- Overall Rank
- 8,170 | 43.17%
- DOI
-
10.14778/3641204.3641214
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 13 of 13 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 363 |
A Graphical Query Language Supporting Recursion |
1987 |
SIGMOD |
0.00025715157 |
| 536 |
The LDBC Social Network Benchmark: Interactive Workload |
2015 |
SIGMOD |
0.00020722862 |
| 964 |
G-CORE: A Core for Future Graph Query Languages |
2018 |
SIGMOD |
0.0001497475 |
| 1,040 |
Graph Sketches: Sparsification, Spanners, and Subgraphs |
2012 |
PODS |
0.00014488943 |
| 1,394 |
Real-time Constrained Cycle Detection in Large Dynamic Graphs |
2018 |
VLDB |
0.0001221552 |
| 1,777 |
Reachability Queries on Large Dynamic Graphs: A Total Order Approach |
2014 |
SIGMOD |
0.00010589591 |
| 2,826 |
Regular Path Query Evaluation on Streaming Graphs |
2020 |
SIGMOD |
8.056119e-05 |
| 2,912 |
TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data |
2018 |
SIGMOD |
7.9130459e-05 |
| 3,063 |
Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges |
2021 |
SIGMOD |
7.6321424e-05 |
| 4,191 |
Efficiently Answering Regular Simple Path Queries on Large Labeled Networks |
2019 |
SIGMOD |
6.3735885e-05 |
| 4,280 |
Query Planning for Evaluating SPARQL Property Paths |
2016 |
SIGMOD |
6.2948356e-05 |
| 4,879 |
Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage |
2018 |
VLDB |
5.8575676e-05 |
| 7,428 |
DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs |
2022 |
VLDB |
4.7320892e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 8,256 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
4.5490743e-05 |
| 8,765 |
Efficient Query Answering in Probabilistic RDF Graphs |
2011 |
SIGMOD |
4.456315e-05 |
| 2,827 |
Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push |
2021 |
SIGMOD |
8.0551884e-05 |
| 10,912 |
Distinct Shortest Walk Enumeration for RPQs |
2024 |
PODS |
4.1945683e-05 |
| 4,191 |
Efficiently Answering Regular Simple Path Queries on Large Labeled Networks |
2019 |
SIGMOD |
6.3735885e-05 |
| 11,385 |
Answering Regular Path Queries through Exemplars |
2022 |
VLDB |
4.1945683e-05 |
| 11,014 |
Efficient Regular Simple Path Queries under Transitive Restricted Expressions |
2024 |
VLDB |
4.1945683e-05 |
| 10,070 |
DRPQ: Distributed Evaluation of Regular Path Queries On Streaming Graphs |
2026 |
SIGMOD |
4.1945683e-05 |
| 9,481 |
MWP: Multi-Window Parallel Evaluation of Regular Path Queries on Streaming Graphs |
2024 |
SIGMOD |
4.3341665e-05 |
| 2,826 |
Regular Path Query Evaluation on Streaming Graphs |
2020 |
SIGMOD |
8.056119e-05 |