首页> 外国专利> RELATIONAL DATABASE JOINS FOR INEXACT MATCHING

RELATIONAL DATABASE JOINS FOR INEXACT MATCHING

机译:关系数据库联接以实现不精确匹配

摘要

Methods and systems for performing a query over joined tables in the context of inexact matching provide efficient search engine functionality. The systems and methods are used to perform an efficient query on a parent table and joined child tables. Search grams are determined based on the query and parent records and child records are scanned for the search grams. Gram scores are computed based on a degree of matching between the parent and child records and the search grams.
机译:用于在不精确匹配的上下文中对联接的表执行查询的方法和系统提供了有效的搜索引擎功能。该系统和方法用于对父表和联接的子表执行有效的查询。根据查询确定搜索克,并扫描父记录和子记录以查找搜索克。克分数是基于父子记录与搜索克之间的匹配程度来计算的。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号