DBScholar

Back to papers

Certus: An Effective Entity Resolution Approach with Graph Differential Dependencies (GDDs)

Summary: Proposes Graph Differential Dependencies (GDDs) for approximate ER matching, enabling efficient discovery. Certus leverages a non-redundant GDD set to boost ER precision with minimal recall loss; validated on five real datasets and a proprietary DB. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h6b98ec6dbb7ba81c
Venue
VLDB
Year
2019
Pagerank
5.5783924e-05
Overall Rank
7,228 | 51.42%
DOI
10.14778/3311880.3311883
PDF
Download (CC BY-NC-ND 4.0)

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{kwashie_vldb19,
        title = {{Certus: An Effective Entity Resolution Approach with Graph Differential Dependencies (GDDs)}},
        author = {Kwashie, Selasi and Liu, Lin and Liu, Jixue and Stumptner, Markus and Li, Jiuyong and Yang, Lujing},
        journal = {PVLDB},
        series = {{VLDB} '19},
        volume = {12},
        number = {6},
        pages = {653--666},
        doi = {10.14778/3311880.3311883},
        url = {https://doi.org/10.14778/3311880.3311883},
        year = {2019}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
7,345 Discovering Association Rules from Big Graphs 2022 VLDB 5.5453863e-05
10,717 Repairing Property Graphs under PG-Constraints 2026 VLDB 4.9769913e-05
11,556 Capturing More Associations by Referencing External Graphs 2024 VLDB 4.9769913e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 24 of 24 cited papers.

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

Rank Cited Paper Year Venue Pagerank
60 The Merge/Purge Problem for Large Databases 1995 SIGMOD 0.00039440583
158 Deep Learning for Entity Matching: A Design Space Exploration 2018 SIGMOD 0.00028038831
168 Efficient Exact Set-Similarity Joins 2006 VLDB 0.00027151132
198 CrowdER: Crowdsourcing Entity Resolution 2012 VLDB 0.00025546182
230 Reference Reconciliation in Complex Information Spaces 2005 SIGMOD 0.00023861741
244 Evaluation of entity resolution approaches on real-world match problems 2010 VLDB 0.00023307564
433 Corleone: Hands-Off Crowdsourcing for Entity Matching 2014 SIGMOD 0.00018324965
501 Dependencies Revisited for Improving Data Quality 2008 PODS 0.00017273167
603 A Hybrid Approach to Functional Dependency Discovery 2016 SIGMOD 0.00015692059
728 Functional Dependency Discovery: An Experimental Evaluation of Seven Algorithms 2015 VLDB 0.00014436728
1,249 Entity Matching: How Similar Is Similar 2011 VLDB 0.00011342019
1,493 Synthesizing Entity Matching Rules by Examples 2018 VLDB 0.00010500948
2,111 Comparative Analysis of Approximate Blocking Techniques for Entity Resolution 2016 VLDB 9.0194027e-05
2,365 Dependencies for Graphs 2017 PODS 8.5625389e-05
2,645 Progressive Approach to Relational Entity Resolution 2014 VLDB 8.173459e-05
3,027 Functional Dependencies for Graphs 2016 SIGMOD 7.7351194e-05
3,317 Keys for Graphs 2015 VLDB 7.432944e-05
3,350 An Efficient Partition Based Method for Exact Set Similarity Joins 2016 VLDB 7.3875743e-05
3,666 Online Entity Resolution Using an Oracle 2016 VLDB 7.1151622e-05
5,946 Exploiting Context Analysis for Combining Multiple Entity Resolution Systems 2009 SIGMOD 5.9352297e-05
6,190 Why Big Data Industrial Systems Need Rules and What We Can Do About It 2015 SIGMOD 5.8547344e-05
6,975 Explore or Exploit? Effective Strategies for Disambiguating Large Databases 2010 VLDB 5.6277347e-05
7,245 Discovering Graph Functional Dependencies 2018 SIGMOD 5.5741839e-05
10,074 On Concise Set of Relative Candidate Keys 2014 VLDB 5.0842681e-05
Previous Page 1 / 1 Next

Semantically Similar Papers