Data cleaning and query answering with matching dependencies and matching functions

DOI10.1007/s00224-012-9402-7zbMath1270.68102arXiv1008.3743MaRDI QIDQ359881

Laks V. S. Lakshmanan, Solmaz Kolahi, Leopoldo Bertossi

Publication date: 23 August 2013

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1008.3743

zbMATH Keywords

lattice; data cleaning; matching function; databases; certain answer; entity resolution; matching dependency; possible answer; query relaxation; semantic domination

Mathematics Subject Classification ID

68P15: Database theory

68P05: Data structures

Related Items

ERBlox: combining matching dependencies with machine learning for entity resolution, Expressive power of entity-linking frameworks, Matching dependencies: semantics and query answering, Policy-based inconsistency management in relational databases

Cites Work

• Unnamed Item
• Unnamed Item
• A calculus for complex objects
• On the representation and querying of sets of possible worlds
• Using powerdomains to generalize relational databases
• Scalar aggregation in inconsistent databases.
• Matching dependencies: semantics and query answering
• Incomplete Information in Relational Databases
• Answer sets for consistent query answering in inconsistent databases
• An Introduction to Duplicate Detection
• On the expressive power of the relational algebra with partially ordered domains