3 citations · 6 across the 4 of their papers we have counts for
4 papers
Tractable vs. Intractable Cases of Matching Dependencies for Query Answering under Entity Resolution
Leopoldo Bertossi, Jaffer Gardezi
Matching Dependencies (MDs) are a relatively recent proposal for declarative entity resolution. They are rules that specify, on the basis of similarities satisfied by values in a d…
On the Complexity of Query Answering under Matching Dependencies for Entity Resolution
Leopoldo Bertossi, Jaffer Gardezi
Matching Dependencies (MDs) are a relatively recent proposal for declarative entity resolution. They are rules that specify, given the similarities satisfied by values in a databas…
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 .…
Matching Dependencies with Arbitrary Attribute Values: Semantics, Query Answering and Integrity Constraints
Jaffer Gardezi, Leopoldo Bertossi, Iluju Kiringa
Matching dependencies (MDs) were introduced to specify the identification or matching of certain attribute values in pairs of database tuples when some similarity conditions are sa…