DBScholar

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
h8da9cd20f87eee8a
Venue
SIGMOD
Year
2025
Pagerank
5.0480912e-05
Overall Rank
10,261 | 31.04%
DOI
10.1145/3725261

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{zeng_sigmod25,
        title = {{Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs}},
        author = {Zeng, Yuanyuan and Fang, Yixiang and Luo, Wensheng and Ma, Chenhao},
        series = {{SIGMOD} '25},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3725261},
        url = {https://dl.acm.org/doi/10.1145/3725261},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Previous Page 1 / 1 Next

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
197 Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling 2013 SIGMOD 0.00025572265
937 Real-time Constrained Cycle Detection in Large Dynamic Graphs 2018 VLDB 0.00012971451
2,190 Scaling Distance Labeling on Small-World Networks 2019 SIGMOD 8.8832666e-05
2,734 Landmark Indexing for Evaluation of Label-Constrained Reachability Queries 2017 SIGMOD 8.0751431e-05
3,066 Finding Locally Densest Subgraphs: A Convex Programming Approach 2022 VLDB 7.6862279e-05
3,318 Skyline Community Search in Multi-valued Networks 2018 SIGMOD 7.4289128e-05
3,922 On Querying Connected Components in Large Temporal Graphs 2023 SIGMOD 6.9205122e-05
4,491 Scaling Up Distance Labeling on Graphs with Core-Periphery Properties 2020 SIGMOD 6.5750647e-05
4,637 Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice 2020 VLDB 6.4902365e-05
4,924 A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery 2022 SIGMOD 6.3492725e-05
5,897 Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks 2021 SIGMOD 5.952769e-05
6,047 PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration 2021 SIGMOD 5.9026722e-05
6,411 Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks 2023 SIGMOD 5.7914609e-05
6,761 Marrying Top-k with Skyline Queries: Relaxing the Preference Input while Producing Output of Controllable Size 2021 SIGMOD 5.6873442e-05
7,250 Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale 2022 VLDB 5.5720266e-05
7,253 T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big Graph 2023 SIGMOD 5.5714652e-05
7,305 BatchHL: Answering Distance Queries on Batch-Dynamic Networks at Scale 2022 SIGMOD 5.5576178e-05
8,397 Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs 2024 SIGMOD 5.3385249e-05
8,797 Towards Generating Hop-constrained s-t Simple Path Graphs 2023 SIGMOD 5.2742315e-05
8,798 Distributed Set Reachability 2016 SIGMOD 5.2742315e-05
Previous Page 1 / 1 Next

Semantically Similar Papers