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
- 7200
- Venue
- SIGMOD
- Year
- 2025
- Pagerank
- 4.1905499e-05
- Overall Rank
- 10,477 | 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.00030020929 |
| 1,392 |
Real-time Constrained Cycle Detection in Large Dynamic Graphs |
2018 |
VLDB |
0.00012224015 |
| 2,643 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
8.3894193e-05 |
| 3,221 |
Landmark Indexing for Evaluation of Label-Constrained Reachability Queries |
2017 |
SIGMOD |
7.3541078e-05 |
| 3,579 |
Finding Locally Densest Subgraphs: A Convex Programming Approach |
2022 |
VLDB |
6.9461197e-05 |
| 3,608 |
Skyline Community Search in Multi-valued Networks |
2018 |
SIGMOD |
6.9241653e-05 |
| 4,536 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.099154e-05 |
| 4,726 |
On Querying Connected Components in Large Temporal Graphs |
2023 |
SIGMOD |
5.9632682e-05 |
| 5,035 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
5.7414979e-05 |
| 5,274 |
A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery |
2022 |
SIGMOD |
5.5919087e-05 |
| 6,144 |
Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks |
2021 |
SIGMOD |
5.1865526e-05 |
| 6,207 |
PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration |
2021 |
SIGMOD |
5.1519085e-05 |
| 6,595 |
Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks |
2023 |
SIGMOD |
4.9949537e-05 |
| 6,988 |
Marrying Top-k with Skyline Queries: Relaxing the Preference Input while Producing Output of Controllable Size |
2021 |
SIGMOD |
4.8665394e-05 |
| 7,439 |
BatchHL: Answering Distance Queries on Batch-Dynamic Networks at Scale |
2022 |
SIGMOD |
4.7256836e-05 |
| 7,674 |
Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale |
2022 |
VLDB |
4.677258e-05 |
| 8,666 |
Towards Generating Hop-constrained s-t Simple Path Graphs |
2023 |
SIGMOD |
4.467539e-05 |
| 8,667 |
Distributed Set Reachability |
2016 |
SIGMOD |
4.467539e-05 |
| 9,086 |
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs |
2024 |
SIGMOD |
4.3947639e-05 |
| 9,561 |
T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big Graph |
2023 |
SIGMOD |
4.3212967e-05 |
Semantically Similar Papers