Answering Why-questions by Exemplars in Attributed Graphs

Summary: Q-Chase: a framework to answer Why-questions on attributed graphs by rewriting Q into Q' so Q'(G) aligns with exemplar E under a closeness measure. It yields anytime and fixed-parameter algorithms that detect picky operators and use star-view caches to prune irrelevant matches, validated on real graphs. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 5764
Venue: SIGMOD
Year: 2019
Pagerank: 5.093636e-05
Overall Rank: 11,854 | 18.68%
DOI: 10.1145/3299869.3319890

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Mohammad Hossein Namaki (Washington State University)
2. Qi Song (Washington State University)
3. Yinghui Wu (Washington State University)
4. Shengqi Yang (WeWork Technology)

BibTeX Citation

@inproceedings{namaki_sigmod19,
        title = {{Answering Why-questions by Exemplars in Attributed Graphs}},
        author = {Namaki, Mohammad Hossein and Song, Qi and Wu, Yinghui and Yang, Shengqi},
        series = {{SIGMOD} '19},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3299869.3319890},
        url = {https://dl.acm.org/doi/10.1145/3299869.3319890},
        year = {2019}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
11,865	NAVIGATE: Explainable Visual Graph Exploration by Examples	2019	SIGMOD	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
195	Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling	2013	SIGMOD	0.00025813775
856	How to ConQueR Why-Not Questions	2010	SIGMOD	0.00013573466
1,591	SQLGraph: An Efficient Relational-Based Property Graph Store	2015	SIGMOD	0.00010255536
1,897	Exemplar Queries: Give me an Example of What You Need	2014	VLDB	9.5243334e-05
2,718	Graph Homomorphism Revisited for Graph Matching	2010	VLDB	8.209788e-05
2,973	Functional Dependencies for Graphs	2016	SIGMOD	7.9083516e-05
3,056	VIIQ: Auto-Suggestion Enabled Visual Interface for Interactive Graph Query Formulation	2015	VLDB	7.8075329e-05
3,908	Diversified Top-k Graph Pattern Matching	2013	VLDB	7.0262215e-05
4,372	Schemaless and Structureless Graph Querying	2014	VLDB	6.7384384e-05
5,999	Exploratory Querying of Extended Knowledge Graphs	2016	VLDB	6.0137042e-05
6,728	BOOMER: Blending Visual Formulation and Processing of P-Homomorphic Queries on Large Networks	2018	SIGMOD	5.7898807e-05
11,918	GExp: Cost-aware Graph Exploration with Keywords	2018	SIGMOD	5.093636e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	294	Graphs-at-a-time: Query Language and Access Methods for Graph Databases	2008	SIGMOD
2	2,634	Benchmarking the Chase	2017	PODS
3	1,897	Exemplar Queries: Give me an Example of What You Need	2014	VLDB
4	776	Distance-Join: Pattern Match Query In a Large Graph Database	2009	VLDB
5	11,225	Efficient Regular Simple Path Queries under Transitive Restricted Expressions	2024	VLDB
6	11,762	Simulation-based Approximate Graph Pattern Matching	2020	SIGMOD
7	4,703	Finding Patterns in a Knowledge Base using Keywords to Compose Table Answers	2014	VLDB
8	4,474	Querying Big Graphs within Bounded Resources	2014	SIGMOD
9	11,583	Answering Regular Path Queries through Exemplars	2022	VLDB
10	4,986	Querying Graph Patterns	2011	PODS