Extending Graph Patterns with Conditions
Summary: CGPs extend graph patterns with per-edge conditions, so edges exist only if the condition holds, enabling missing-link detection and richer dependencies in compact form. Complexity: linear-time for consistency; NP-complete for matching; NP^p-complete for incremental matching; Pi2-complete for containment; plus practical CGP/multi-CGP matching and incremental optimization with empirical validation on real and synthetic graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Grace Fan (Brown University)
- 2. Wenfei Fan (Beihang University; Shenzhen University; University of Edinburgh)
- 3. Yuanhao Li (Shenzhen University; University of Edinburgh)
- 4. Ping Lu (Beihang University)
- 5. Chao Tian (Alibaba)
- 6. Jingren Zhou (Alibaba)
BibTeX Citation
@inproceedings{fan_sigmod20,
title = {{Extending Graph Patterns with Conditions}},
author = {Fan, Grace and Fan, Wenfei and Li, Yuanhao and Lu, Ping and Tian, Chao and Zhou, Jingren},
series = {{SIGMOD} '20},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3318464.3380585},
url = {https://dl.acm.org/doi/10.1145/3318464.3380585},
year = {2020}
}
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,722 | Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming | 2021 | VLDB | 6.5438628e-05 |
| 8,586 | A Framework for Privacy Preserving Localized Graph Pattern Query Processing | 2023 | SIGMOD | 5.4073203e-05 |
| 11,227 | Extending Graph Rules with Oracles | 2024 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 18 of 18 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,099 | Discovering Graph Functional Dependencies | 2018 | SIGMOD |
| 2 | 11,910 | Catching Numeric Inconsistencies in Graphs | 2018 | SIGMOD |
| 3 | 4,503 | Event Pattern Matching over Graph Streams | 2015 | VLDB |
| 4 | 5,484 | Capturing Topology in Graph Pattern Matching | 2012 | VLDB |
| 5 | 11,762 | Simulation-based Approximate Graph Pattern Matching | 2020 | SIGMOD |
| 6 | 1,296 | Incremental Graph Pattern Matching | 2011 | SIGMOD |
| 7 | 2,973 | Functional Dependencies for Graphs | 2016 | SIGMOD |
| 8 | 4,986 | Querying Graph Patterns | 2011 | PODS |
| 9 | 1,128 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB |
| 10 | 8,809 | Adding Counting Quantifiers to Graph Patterns | 2016 | SIGMOD |