MCR-Tree: An Efficient Index for Multi-dimensional Core Search
Summary: MCR-Tree: a generic, update-aware index for multi-dimensional core search across core models ((\u03b1,\u03b2)-core, (k,l)-core, k-core). Key idea: project vertices via skyline corenesses into R-tree space, augment nodes with connectivity, enabling branch-and-bound search with far less redundancy and strong scalability. (summarized by gpt-5.4-mini on May 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Chengyang Luo (Zhejiang University)
- 2. Yifan Zhu (Zhejiang University)
- 3. Qing Liu (Zhejiang University)
- 4. Yunjun Gao (Zhejiang University)
- 5. Lu Chen (Zhejiang University)
- 6. Jianliang Xu (Hong Kong Baptist University)
BibTeX Citation
@inproceedings{luo_sigmod24,
title = {{MCR-Tree: An Efficient Index for Multi-dimensional Core Search}},
author = {Luo, Chengyang and Zhu, Yifan and Liu, Qing and Gao, Yunjun and Chen, Lu and Xu, Jianliang},
series = {{SIGMOD} '24},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3654956},
url = {https://dl.acm.org/doi/10.1145/3654956},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,138 | Budgeted Strong Community Search in Heterogeneous Graphs | 2026 | SIGMOD | 5.0597449e-05 |
| 10,596 | Zero-Redundancy Search for Bi-Components in Bipartite Graphs | 2026 | SIGMOD | 4.9605343e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2 | R-Trees: A Dynamic Index Structure For Spatial Searching | 1984 | SIGMOD | 0.0019892478 |
| 1,398 | Local Algorithms for Hierarchical Dense Subgraph Discovery | 2019 | VLDB | 0.0001076734 |
| 1,613 | Distance-generalized Core Decomposition | 2019 | SIGMOD | 0.00010057822 |
| 2,285 | Effective and Efficient Relational Community Detection and Search in Large Dynamic Heterogeneous Information Networks | 2020 | VLDB | 8.6875058e-05 |
| 2,873 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB | 7.9005874e-05 |
| 3,044 | A Revised R*-tree in Comparison with Related Index Structures | 2009 | SIGMOD | 7.7045269e-05 |
| 3,880 | Distributed D-core Decomposition over Large Directed Graphs | 2022 | VLDB | 6.9318416e-05 |
| 4,333 | Neighborhood-based Hypergraph Core Decomposition | 2023 | VLDB | 6.6444874e-05 |
| 5,725 | Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs | 2021 | VLDB | 5.9991587e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,470 | Efficient Structural Graph Clustering: An Index-Based Approach | 2018 | VLDB |
| 2 | 734 | Graph Indexing: Tree + Delta >= Graph | 2007 | VLDB |
| 3 | 4,214 | Scaling Up Distance Labeling on Graphs with Core-Periphery Properties | 2020 | SIGMOD |
| 4 | 2,387 | Towards Graph Containment Search and Indexing | 2007 | VLDB |
| 5 | 8,339 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB |
| 6 | 6,786 | DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs | 2022 | VLDB |
| 7 | 2,029 | Optimizing Multidimensional Index Trees for Main Memory Access | 2001 | SIGMOD |
| 8 | 8,536 | On More Efficiently and Versatilely Querying Historical k-Cores | 2025 | VLDB |
| 9 | 3,170 | On Querying Historical K-Cores | 2021 | VLDB |
| 10 | 6,754 | gCore: Exploring Cross-layer Cohesiveness in Multi-layer Graphs | 2023 | VLDB |