DBScholar

Back to papers

On Concise Set of Relative Candidate Keys

Summary: Introduces concise relative candidate-key sets for entity matching, removing redundancy not only in compared attributes but also in comparison-distance restrictions while preserving coverage and validity. Approximation and pruning algorithms return distance-minimal rcks, achieving up to 100× faster discovery. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
10965
Venue
VLDB
Year
2014
Pagerank
5.2033964e-05
Overall Rank
9,883 | 32.20%
DOI
10.14778/2732977.2732986

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{song_vldb14,
        title = {{On Concise Set of Relative Candidate Keys}},
        author = {Song, Shaoxu and Chen, Lei and Cheng, Hong},
        journal = {PVLDB},
        series = {{VLDB} '14},
        volume = {7},
        number = {12},
        pages = {1179--1190},
        doi = {10.14778/2732977.2732986},
        url = {https://doi.org/10.14778/2732977.2732986},
        year = {2014}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
7,083 Certus: An Effective Entity Resolution Approach with Graph Differential Dependencies (GDDs) 2019 VLDB 5.7075402e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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