首页>
外国专利>
Example-driven design of efficient record matching queries
Example-driven design of efficient record matching queries
展开▼
机译:以示例为驱动的高效记录匹配查询设计
展开▼
页面导航
摘要
著录项
相似文献
摘要
Example-driven creation of record matching queries. The disclosed architecture employs techniques that exploit the availability of positive (or matching) and negative (non-matching) examples to search through this space and suggest an initial record matching query. The record matching task is modeled as that of designing an operator tree obtained by composing a few primitive operators. This ensures that record matching programs be executable efficiently and scalably over large input relations. The architecture joins records across multiple (e.g., two) relations (e.g., R and S). The architecture exploits the monotonicity property of similarity functions for record matching in the relations, in that, any pair of matching records have a higher similarity value than non-matching record pairs on at least one similarity function.
展开▼