DBScholar

Back to papers

Generating Concise Entity Matching Rules

Summary: Generates concise EM rules as GBFs via program synthesis from pos/neg examples, beating DNFs in conciseness. Demo: web-based customization, fast GBF synthesis, and open-source release for benchmarking against ML baselines. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5435
Venue
SIGMOD
Year
2017
Pagerank
7.176496e-05
Overall Rank
3,713 | 74.53%
DOI
10.1145/3035918.3058739

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{singh_sigmod17,
        title = {{Generating Concise Entity Matching Rules}},
        author = {Singh, Rohit and Meduri, Vamsi and Elmagarmid, Ahmed and Madden, Samuel and Papotti, Paolo and Quiané-Ruiz, Jorge-Arnulfo and Solar-Lezama, Armando and Tang, Nan},
        series = {{SIGMOD} '17},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3035918.3058739},
        url = {https://dl.acm.org/doi/10.1145/3035918.3058739},
        year = {2017}
}

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
1,248 Entity Matching: How Similar Is Similar 2011 VLDB 0.00011498301
1,497 Generic Schema Matching, Ten Years Later 2011 VLDB 0.00010568859
Previous Page 1 / 1 Next

Semantically Similar Papers