Database Paper Browser

Back to papers

On Concise Set of Relative Candidate Keys

Summary: Proposes a concise, redundancy-free set of relative candidate keys (rcks) for matching and blocking by minimizing the number of compared attributes. Applies approximation algorithms with guarantees under distance restrictions; experiments show tighter coverage than prior methods and pruning yields up to 100x speedups. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10777
Venue
VLDB
Year
2014
Pagerank
4.2945121e-05
Overall Rank
9,725 | 32.35%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
7,185 Certus: An Effective Entity Resolution Approach with Graph Differential Dependencies (GDDs) 2019 VLDB 4.8066159e-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