DBScholar

Back to papers

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)

Paper ID
h5936b96fad78cf82
Venue
SIGMOD
Year
2020
Pagerank
5.5150923e-05
Overall Rank
7,478 | 49.73%
DOI
10.1145/3318464.3380585

Incoming Non-self Citations Over Time

Authors

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,779 Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming 2021 VLDB 6.4163774e-05
7,573 A Framework for Privacy Preserving Localized Graph Pattern Query Processing 2023 SIGMOD 5.4934674e-05
11,563 Extending Graph Rules with Oracles 2024 VLDB 4.9793485e-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.

Rank Cited Paper Year Venue Pagerank
155 Common Expression Analysis in Database Applications 1982 SIGMOD 0.00028527932
211 AliGraph: A Comprehensive Graph Neural Network Platform 2019 VLDB 0.00024816965
288 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00021969641
355 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020124083
438 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018286607
443 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018197688
490 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017438618
657 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.0001505607
960 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012836554
1,045 Graphflow: An Active Graph Database 2017 SIGMOD 0.00012322402
1,100 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012013426
1,131 Efficient Exploitation of Similar Subexpressions for Query Processing 2007 SIGMOD 0.0001189909
2,211 TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data 2018 SIGMOD 8.8237249e-05
2,364 Dependencies for Graphs 2017 PODS 8.5665938e-05
2,851 Incremental Graph Computations: Doable and Undoable 2017 SIGMOD 7.9419904e-05
3,026 Functional Dependencies for Graphs 2016 SIGMOD 7.7387829e-05
3,767 Multi-Query Optimization for Subgraph Isomorphism Search 2017 VLDB 7.0315534e-05
12,210 Catching Numeric Inconsistencies in Graphs 2018 SIGMOD 4.9793485e-05
Previous Page 1 / 1 Next

Semantically Similar Papers