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
- 13355
- Venue
- VLDB
- Year
- 2024
- Pagerank
- 4.5653572e-05
- Overall Rank
- 8,172 | 43.21%
- 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 |
| 364 |
A Graphical Query Language Supporting Recursion |
1987 |
SIGMOD |
0.00025657601 |
| 530 |
The LDBC Social Network Benchmark: Interactive Workload |
2015 |
SIGMOD |
0.00020823189 |
| 922 |
Graph Sketches: Sparsification, Spanners, and Subgraphs |
2012 |
PODS |
0.00015254436 |
| 964 |
G-CORE: A Core for Future Graph Query Languages |
2018 |
SIGMOD |
0.00014967208 |
| 1,392 |
Real-time Constrained Cycle Detection in Large Dynamic Graphs |
2018 |
VLDB |
0.00012224015 |
| 1,776 |
Reachability Queries on Large Dynamic Graphs: A Total Order Approach |
2014 |
SIGMOD |
0.0001058029 |
| 2,832 |
Regular Path Query Evaluation on Streaming Graphs |
2020 |
SIGMOD |
8.048358e-05 |
| 2,882 |
TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data |
2018 |
SIGMOD |
7.9666138e-05 |
| 3,067 |
Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges |
2021 |
SIGMOD |
7.6247945e-05 |
| 4,191 |
Efficiently Answering Regular Simple Path Queries on Large Labeled Networks |
2019 |
SIGMOD |
6.3676619e-05 |
| 4,276 |
Query Planning for Evaluating SPARQL Property Paths |
2016 |
SIGMOD |
6.2884651e-05 |
| 4,883 |
Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage |
2018 |
VLDB |
5.8519327e-05 |
| 7,430 |
DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs |
2022 |
VLDB |
4.7275494e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 8,252 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
4.544713e-05 |
| 8,762 |
Efficient Query Answering in Probabilistic RDF Graphs |
2011 |
SIGMOD |
4.4520434e-05 |
| 2,522 |
Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push |
2021 |
SIGMOD |
8.6029608e-05 |
| 10,916 |
Distinct Shortest Walk Enumeration for RPQs |
2024 |
PODS |
4.1905499e-05 |
| 4,191 |
Efficiently Answering Regular Simple Path Queries on Large Labeled Networks |
2019 |
SIGMOD |
6.3676619e-05 |
| 11,387 |
Answering Regular Path Queries through Exemplars |
2022 |
VLDB |
4.1905499e-05 |
| 11,017 |
Efficient Regular Simple Path Queries under Transitive Restricted Expressions |
2024 |
VLDB |
4.1905499e-05 |
| 10,070 |
DRPQ: Distributed Evaluation of Regular Path Queries On Streaming Graphs |
2026 |
SIGMOD |
4.1905499e-05 |
| 9,483 |
MWP: Multi-Window Parallel Evaluation of Regular Path Queries on Streaming Graphs |
2024 |
SIGMOD |
4.3300131e-05 |
| 2,832 |
Regular Path Query Evaluation on Streaming Graphs |
2020 |
SIGMOD |
8.048358e-05 |