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.5606514e-05
Overall Rank
7,244 | 51.45%
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,318 Discovering Association Rules from Big Graphs 2022 VLDB 5.5411422e-05
10,778 Repairing Property Graphs under PG-Constraints 2026 VLDB 4.9605343e-05
11,605 Capturing More Associations by Referencing External Graphs 2024 VLDB 4.9605343e-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.00039343755
158 Deep Learning for Entity Matching: A Design Space Exploration 2018 SIGMOD 0.00028049555
169 Efficient Exact Set-Similarity Joins 2006 VLDB 0.00027077763
199 CrowdER: Crowdsourcing Entity Resolution 2012 VLDB 0.0002551523
231 Reference Reconciliation in Complex Information Spaces 2005 SIGMOD 0.00023797615
244 Evaluation of entity resolution approaches on real-world match problems 2010 VLDB 0.00023265795
434 Corleone: Hands-Off Crowdsourcing for Entity Matching 2014 SIGMOD 0.00018323777
502 Dependencies Revisited for Improving Data Quality 2008 PODS 0.00017239652
602 A Hybrid Approach to Functional Dependency Discovery 2016 SIGMOD 0.00015670535
727 Functional Dependency Discovery: An Experimental Evaluation of Seven Algorithms 2015 VLDB 0.00014426954
1,251 Entity Matching: How Similar Is Similar 2011 VLDB 0.0001132553
1,489 Synthesizing Entity Matching Rules by Examples 2018 VLDB 0.00010480559
2,120 Comparative Analysis of Approximate Blocking Techniques for Entity Resolution 2016 VLDB 8.9985078e-05
2,269 Dependencies for Graphs 2017 PODS 8.711418e-05
2,641 Progressive Approach to Relational Entity Resolution 2014 VLDB 8.1723025e-05
2,894 Functional Dependencies for Graphs 2016 SIGMOD 7.8870146e-05
3,329 Keys for Graphs 2015 VLDB 7.4086832e-05
3,359 An Efficient Partition Based Method for Exact Set Similarity Joins 2016 VLDB 7.3640394e-05
3,672 Online Entity Resolution Using an Oracle 2016 VLDB 7.0926043e-05
5,961 Exploiting Context Analysis for Combining Multiple Entity Resolution Systems 2009 SIGMOD 5.9157271e-05
6,179 Why Big Data Industrial Systems Need Rules and What We Can Do About It 2015 SIGMOD 5.8430324e-05
6,990 Explore or Exploit? Effective Strategies for Disambiguating Large Databases 2010 VLDB 5.6105767e-05
7,263 Discovering Graph Functional Dependencies 2018 SIGMOD 5.5557683e-05
10,108 On Concise Set of Relative Candidate Keys 2014 VLDB 5.0674699e-05
Previous Page 1 / 1 Next

Semantically Similar Papers