activity
20102013
most citedTractable vs. Intractable Cases of Matching Dependencies for Query Answering under Entity Resolution

3 citations · 6 across the 4 of their papers we have counts for

collaborators
Showing 2011 · cs.DBShow all

1 paper · 2 filters

cs.DB2011★ 3 cited

Query Answering under Matching Dependencies for Data Cleaning: Complexity and Algorithms

Jaffer Gardezi, Leopoldo Bertossi

Matching dependencies (MDs) have been recently introduced as declarative rules for entity resolution (ER), i.e. for identifying and resolving duplicates in relational instance .…