DBScholar

Back to papers

Adding Counting Quantifiers to Graph Patterns

Summary: Proposes quantified graph patterns (QGPs) with counting edge quantifiers, enabling universal/existential quantification and numeric aggregates. Quantified matching is NP-complete without negation and DP-complete for general QGPs; it weaves quantifier checks into subgraph isomorphism and delivers parallel scalable algorithms for quantified graph association rules. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5190
Venue
SIGMOD
Year
2016
Pagerank
5.3655939e-05
Overall Rank
8,809 | 39.57%
DOI
10.1145/2882903.2882937

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{fan_sigmod16,
        title = {{Adding Counting Quantifiers to Graph Patterns}},
        author = {Fan, Wenfei and Wu, Yinghui and Xu, Jingbo},
        series = {{SIGMOD} '16},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2882903.2882937},
        url = {https://dl.acm.org/doi/10.1145/2882903.2882937},
        year = {2016}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
8,113 Capturing Associations in Graphs 2020 VLDB 5.484341e-05
9,961 Threshold Queries in Theory and in the Wild 2022 VLDB 5.1879626e-05
11,212 Capturing More Associations by Referencing External Graphs 2024 VLDB 5.093636e-05
11,227 Extending Graph Rules with Oracles 2024 VLDB 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 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