Back to papers
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs
Summary: Introduces CAI, a core attribute index pruning vertices/edges not on any skyline s-t path in multi-attribute graphs, built via parallel hop-dependency label propagation. CAI-based querying cuts fruitless exploration, delivering large speedups and scalable memory on real graphs.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 7199
- Venue
- SIGMOD
- Year
- 2025
- Pagerank
- 4.1945683e-05
- Overall Rank
- 10,467 | 27.19%
- DOI
-
10.1145/3725261
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 20 of 20 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 260 |
Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling |
2013 |
SIGMOD |
0.00030040036 |
| 1,394 |
Real-time Constrained Cycle Detection in Large Dynamic Graphs |
2018 |
VLDB |
0.0001221552 |
| 2,639 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
8.3975113e-05 |
| 3,213 |
Landmark Indexing for Evaluation of Label-Constrained Reachability Queries |
2017 |
SIGMOD |
7.3669794e-05 |
| 3,575 |
Finding Locally Densest Subgraphs: A Convex Programming Approach |
2022 |
VLDB |
6.9528126e-05 |
| 3,603 |
Skyline Community Search in Multi-valued Networks |
2018 |
SIGMOD |
6.9306814e-05 |
| 4,534 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.1049756e-05 |
| 4,970 |
On Querying Connected Components in Large Temporal Graphs |
2023 |
SIGMOD |
5.7945079e-05 |
| 5,035 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
5.7470184e-05 |
| 5,265 |
A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery |
2022 |
SIGMOD |
5.5972878e-05 |
| 6,138 |
Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks |
2021 |
SIGMOD |
5.1915368e-05 |
| 6,208 |
PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration |
2021 |
SIGMOD |
5.1568586e-05 |
| 6,594 |
Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks |
2023 |
SIGMOD |
4.999751e-05 |
| 7,002 |
Marrying Top-k with Skyline Queries: Relaxing the Preference Input while Producing Output of Controllable Size |
2021 |
SIGMOD |
4.8670742e-05 |
| 7,441 |
BatchHL: Answering Distance Queries on Batch-Dynamic Networks at Scale |
2022 |
SIGMOD |
4.7302202e-05 |
| 7,675 |
Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale |
2022 |
VLDB |
4.6817479e-05 |
| 8,668 |
Towards Generating Hop-constrained s-t Simple Path Graphs |
2023 |
SIGMOD |
4.4718257e-05 |
| 8,669 |
Distributed Set Reachability |
2016 |
SIGMOD |
4.4718257e-05 |
| 9,089 |
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs |
2024 |
SIGMOD |
4.39898e-05 |
| 9,561 |
T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big Graph |
2023 |
SIGMOD |
4.3254416e-05 |
Semantically Similar Papers