发明授权
- 专利标题： Efficient exact set similarity joins
- 专利标题（中）： 有效的精确集合相似性连接
-
申请号： US11668870申请日： 2007-01-30
-
公开(公告)号： US07865505B2公开(公告)日： 2011-01-04
- 发明人: Arvind Arasu , Venkatesh Ganti , Kaushik Shriraghav
- 申请人： Arvind Arasu , Venkatesh Ganti , Kaushik Shriraghav
- 申请人地址： US WA Redmond
- 专利权人： Microsoft Corporation
- 当前专利权人： Microsoft Corporation
- 当前专利权人地址： US WA Redmond
- 代理机构： Lee & Hayes, PLLC
- 主分类号： G06F7/00
- IPC分类号： G06F7/00 ; G06F17/30
摘要：
A machine implemented system and method that efficiently facilitates and effectuates exact similarity joins between collections of sets. The system and method obtains a collection of sets and a threshold value from an interface, and based at least in part on an identifiable similarity, such as an overlap or intersection, between the collection of sets the analysis component generates and outputs a candidate pair that at least equals or exceeds the threshold value.
公开/授权文献
- US20080183693A1 EFFICIENT EXACT SET SIMILARITY JOINS 公开/授权日：2008-07-31
信息查询
