Querying Big Graphs within Bounded Resources
Summary: Proposes resource-bounded query answering by shrinking G to a bound-preserving subgraph G_Q with |G_Q| ≤ α|G|. NP-hard for exact pattern queries and no exact reachability for α<1; yet, scalable resource-bounded algorithms yield accurate approximations. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Wenfei Fan (Beihang University; University of Edinburgh)
- 2. Xin Wang (Southwest Jiaotong University)
- 3. Yinghui Wu (University of California Santa Barbara)
BibTeX Citation
@inproceedings{fan_sigmod14,
title = {{Querying Big Graphs within Bounded Resources}},
author = {Fan, Wenfei and Wang, Xin and Wu, Yinghui},
series = {{SIGMOD} '14},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2588555.2610513},
url = {https://dl.acm.org/doi/10.1145/2588555.2610513},
year = {2014}
}Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,108 | Approximate Query Processing: No Silver Bullet | 2017 | SIGMOD | 0.00012145154 |
| 2,182 | TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data | 2018 | SIGMOD | 9.010121e-05 |
| 2,798 | Incremental Graph Computations: Doable and Undoable | 2017 | SIGMOD | 8.1129891e-05 |
| 5,370 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD | 6.2436385e-05 |
| 5,797 | Effective and Efficient Dynamic Graph Coloring | 2018 | VLDB | 6.0859157e-05 |
| 9,032 | Bonding Vertex Sets Over Distributed Graph: A Betweenness Aware Approach | 2015 | VLDB | 5.327953e-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 |
|---|---|---|---|---|
| 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0012250108 |
| 20 | Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud | 2012 | VLDB | 0.00056944564 |
| 431 | Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism | 2008 | VLDB | 0.00018577017 |
| 486 | Efficient Aggregation for Graph Summarization | 2008 | SIGMOD | 0.00017692185 |
| 548 | Graph Summarization with Bounded Error | 2008 | SIGMOD | 0.00016694936 |
| 1,008 | D(K)-Index: An Adaptive Structural Summary for Graph-Structured Data | 2003 | SIGMOD | 0.00012688008 |
| 1,336 | Query Preserving Graph Compression | 2012 | SIGMOD | 0.00011118804 |
| 2,575 | K-Reach: Who is in Your Small World | 2012 | VLDB | 8.3982298e-05 |
| 5,484 | Capturing Topology in Graph Pattern Matching | 2012 | VLDB | 6.2018052e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,841 | Querying Big Data by Accessing Small Data | 2015 | PODS |
| 2 | 9,625 | I/O Efficient Label-Constrained Reachability Queries in Large Graphs | 2024 | VLDB |
| 3 | 5,784 | Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks | 2021 | SIGMOD |
| 4 | 5,029 | Performance Guarantees for Distributed Reachability Queries | 2012 | VLDB |
| 5 | 2,798 | Incremental Graph Computations: Doable and Undoable | 2017 | SIGMOD |
| 6 | 1,796 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD |
| 7 | 6,876 | A Hierarchical Contraction Scheme for Querying Big Graphs | 2022 | SIGMOD |
| 8 | 4,986 | Querying Graph Patterns | 2011 | PODS |
| 9 | 5,370 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD |
| 10 | 1,336 | Query Preserving Graph Compression | 2012 | SIGMOD |