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
- 2. Xin Wang
- 3. Yinghui Wu
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,574 | Approximate Query Processing: No Silver Bullet | 2017 | SIGMOD | 0.00011287495 |
| 2,912 | TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data | 2018 | SIGMOD | 7.9130459e-05 |
| 3,394 | Incremental Graph Computations: Doable and Undoable | 2017 | SIGMOD | 7.1480446e-05 |
| 5,751 | Effective and Efficient Dynamic Graph Coloring | 2018 | VLDB | 5.3409543e-05 |
| 5,854 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD | 5.3006473e-05 |
| 8,885 | Bonding Vertex Sets Over Distributed Graph: A Betweenness Aware Approach | 2015 | VLDB | 4.4282232e-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 |
|---|---|---|---|---|
| 4 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0019005923 |
| 37 | Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud | 2012 | VLDB | 0.0007522744 |
| 388 | Graph Summarization with Bounded Error | 2008 | SIGMOD | 0.00024662272 |
| 435 | Efficient Aggregation for Graph Summarization | 2008 | SIGMOD | 0.00023260172 |
| 612 | Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism | 2008 | VLDB | 0.0001920234 |
| 993 | D(K)-Index: An Adaptive Structural Summary for Graph-Structured Data | 2003 | SIGMOD | 0.00014765816 |
| 1,579 | Query Preserving Graph Compression | 2012 | SIGMOD | 0.00011283792 |
| 2,756 | K-Reach: Who is in Your Small World | 2012 | VLDB | 8.1682536e-05 |
| 5,776 | Capturing Topology in Graph Pattern Matching | 2012 | VLDB | 5.3309758e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,085 | Querying Big Data by Accessing Small Data | 2015 | PODS | 4.8388174e-05 |
| 9,483 | I/O Efficient Label-Constrained Reachability Queries in Large Graphs | 2024 | VLDB | 4.3341665e-05 |
| 6,138 | Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks | 2021 | SIGMOD | 5.1915368e-05 |
| 5,054 | Performance Guarantees for Distributed Reachability Queries | 2012 | VLDB | 5.7321997e-05 |
| 3,394 | Incremental Graph Computations: Doable and Undoable | 2017 | SIGMOD | 7.1480446e-05 |
| 1,777 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD | 0.00010589591 |
| 6,730 | A Hierarchical Contraction Scheme for Querying Big Graphs | 2022 | SIGMOD | 4.9479867e-05 |
| 4,946 | Querying Graph Patterns | 2011 | PODS | 5.8149362e-05 |
| 5,854 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD | 5.3006473e-05 |
| 1,579 | Query Preserving Graph Compression | 2012 | SIGMOD | 0.00011283792 |