专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07562067B2 Systems and methods for estimating functional relationships in a database 有权
标题翻译：用于估计数据库中的功能关系的系统和方法
公开(公告)号：US07562067B2
公开(公告)日：2009-07-14
申请号：US11123901
申请日：2005-05-06
申请人： Surajit Chaudhuri , Venkatesh Ganti , Kaushik Shriraghav
发明人： Surajit Chaudhuri , Venkatesh Ganti , Kaushik Shriraghav
IPC分类号： G06F17/30 , G06F7/00 , G06F17/00
CPC分类号： G06F17/30536 , Y10S707/99932
摘要： A system that facilitates estimating functional relationships associated with one or more columns in a database comprises a sampling component that receives a random sample of records within the database. An estimate generator component calculates an estimate of strength of functional relationships based at least in part upon the received samples. For example, the estimate generator component can calculate an estimate of strength of a column as a key column based at least in part upon the received samples.
摘要翻译：便于估计与数据库中的一个或多个列相关联的功能关系的系统包括接收数据库内的记录的随机抽样的采样组件。估计生成器组件至少部分地基于所接收的样本来计算功能关系的强度的估计。例如，估计生成器组件可以至少部分地基于所接收的样本来计算作为关键列的列的强度的估计。

2. 发明授权

US07406479B2 Primitive operator for similarity joins in data cleaning 有权
标题翻译：数据清理中相似性的原始运算符
公开(公告)号：US07406479B2
公开(公告)日：2008-07-29
申请号：US11352141
申请日：2006-02-10
申请人： Kaushik Shriraghav , Surajit Chaudhuri , Venkatesh Ganti
发明人： Kaushik Shriraghav , Surajit Chaudhuri , Venkatesh Ganti
IPC分类号： G06F17/00
CPC分类号： G06F17/30442 , Y10S707/99942 , Y10S707/99943
摘要： A set similarity join system and method are provided. The system can be employed to facilitate data cleaning based on similarities through the identification of “close” tuples (e.g., records and/or rows). “Closeness” can be is evaluated using a similarity function(s) chosen to suit the domain and/or application. Thus, the system facilitates generic domain-independent data cleansing.The system can be employed with a foundational primitive, the set similarity join (SSJoin) operator, which can be used as a building block to implement a broad variety of notions of similarity (e.g., edit similarity, Jaccard similarity, generalized edit similarity, hamming distance, soundex, etc.) as well as similarity based on co-occurrences. The SSJoin operator can exploit the observation that set overlap can be used effectively to support a variety of similarity functions. The SSJoin operator compares values based on “sets” associated with (or explicitly constructed for) each one of them.
摘要翻译：提供了一种集合相似性连接系统和方法。可以通过识别“关闭”元组（例如，记录和/或行）来基于相似性来促进系统的数据清理。可以使用选择适合域和/或应用程序的相似性函数来评估“接近度”。因此，该系统便于通用的域无关数据清理。该系统可以与基本原语，即相似性连接（SSJoin）运算符一起使用，其可以用作构建块来实现各种各样的相似性概念（例如，编辑相似性，Jaccard相似性，广义编辑相似性，汉明距离，声音等）以及基于共同出现的相似性。 SSJoin算子可以利用设置重叠的观察结果有效地用于支持各种相似度函数。 SSJoin操作符根据与其中每一个相关联（或明确构建的）的“集合”来比较值。

3. 发明申请

US20060282436A1 Systems and methods for estimating functional relationships in a database 有权
公开(公告)号：US20060282436A1
公开(公告)日：2006-12-14
申请号：US11123901
申请日：2005-05-06
申请人： Surajit Chaudhuri , Venkatesh Ganti , Kaushik Shriraghav
发明人： Surajit Chaudhuri , Venkatesh Ganti , Kaushik Shriraghav
IPC分类号： G06F7/00
CPC分类号： G06F17/30536 , Y10S707/99932
摘要： A system that facilitates estimating functional relationships associated with one or more columns in a database comprises a sampling component that receives a random sample of records within the database. An estimate generator component calculates an estimate of strength of functional relationships based at least in part upon the received samples. For example, the estimate generator component can calculate an estimate of strength of a column as a key column based at least in part upon the received samples.

4. 发明申请

US20070192342A1 Primitive operator for similarity joins in data cleaning 有权
标题翻译：数据清理中相似性的原始运算符
公开(公告)号：US20070192342A1
公开(公告)日：2007-08-16
申请号：US11352141
申请日：2006-02-10
申请人： Kaushik Shriraghav , Surajit Chaudhuri , Venkatesh Ganti
发明人： Kaushik Shriraghav , Surajit Chaudhuri , Venkatesh Ganti
IPC分类号： G06F7/00
CPC分类号： G06F17/30442 , Y10S707/99942 , Y10S707/99943
摘要： A set similarity join system and method are provided. The system can be employed to facilitate data cleaning based on similarities through the identification of “close” tuples (e.g., records and/or rows). “Closeness” can be is evaluated using a similarity function(s) chosen to suit the domain and/or application. Thus, the system facilitates generic domain-independent data cleansing. The system can be employed with a foundational primitive, the set similarity join (SSJoin) operator, which can be used as a building block to implement a broad variety of notions of similarity (e.g., edit similarity, Jaccard similarity, generalized edit similarity, hamming distance, soundex, etc.) as well as similarity based on co-occurrences. The SSJoin operator can exploit the observation that set overlap can be used effectively to support a variety of similarity functions. The SSJoin operator compares values based on “sets” associated with (or explicitly constructed for) each one of them.
摘要翻译：提供了一种集合相似性连接系统和方法。可以通过识别“关闭”元组（例如，记录和/或行）来基于相似性来促进系统的数据清理。可以使用选择适合域和/或应用程序的相似性函数来评估“接近度”。因此，该系统便于通用的域无关数据清理。该系统可以与基本原语，即相似性连接（SSJoin）运算符一起使用，其可以用作构建块来实现各种各样的相似性概念（例如，编辑相似性，Jaccard相似性，广义编辑相似性，汉明距离，声音等）以及基于共同出现的相似性。 SSJoin算子可以利用设置重叠的观察结果有效地用于支持各种相似度函数。 SSJoin操作符根据与其中每一个相关联（或明确构建的）的“集合”来比较值。

5. 发明授权

US07634464B2 Designing record matching queries utilizing examples 有权
标题翻译：使用示例设计记录匹配查询
公开(公告)号：US07634464B2
公开(公告)日：2009-12-15
申请号：US11424191
申请日：2006-06-14
申请人： Bee-Chung Chen , Venkatesh Ganti , Kaushik Shriraghav
发明人： Bee-Chung Chen , Venkatesh Ganti , Kaushik Shriraghav
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F17/30489 , Y10S707/99933 , Y10S707/99934
摘要： The subject disclosure pertains to a powerful and flexible framework for record matching. The framework facilitates design of a record matching query or package composed of a set of well-defined primitive operators (e.g., relational, data cleaning . . . ), which can ultimately be executed to match records. To assist design of such packages, a learning technique based on examples is provided. More specifically, a set of matching and non-matching record pairs can be input and employed to facilitate automatic package generation. A generated package can subsequently be transformed manually and/or automatically into a semantically equivalent form optimized for execution.
摘要翻译：主题公开涉及用于记录匹配的强大且灵活的框架。该框架便于设计由一组明确定义的原始运算符（例如，关系数据清理...）组成的记录匹配查询或包，其最终可以被执行以匹配记录。为了协助这样的包装的设计，提供了基于示例的学习技术。更具体地，可以输入并采用一组匹配和非匹配记录对来促进自动包装生成。生成的包可以随后被手动和/或自动地变换成为执行而优化的语义上等同的形式。

6. 发明申请

US20070192297A1 MINIMAL DIFFERENCE QUERY AND VIEW MATCHING 审中-公开
标题翻译：最小差异查询和查看匹配
公开(公告)号：US20070192297A1
公开(公告)日：2007-08-16
申请号：US11558029
申请日：2006-11-09
申请人： Kaushik Shriraghav , Venkatesh Ganti , Xin Dong
发明人： Kaushik Shriraghav , Venkatesh Ganti , Xin Dong
IPC分类号： G06F17/30
CPC分类号： G06F16/24535 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934
摘要： The subject disclosure pertains to efficient computation of the difference between queries by exploiting commonality between them. A minimal difference query (MDQ) is generated that roughly corresponds to removal of as many joins as possible while still accurately representing the query difference. The minimal difference can be employed to further substantially the scope of view matching where a query is not wholly subsumed by a view. Additionally, the minimal difference query can be employed as an analytical tool in various contexts.
摘要翻译：本发明涉及通过利用它们之间的共性来有效地计算查询之间的差异。生成最小差异查询（MDQ），大致对应于删除尽可能多的连接，同时仍准确地表示查询差异。可以使用最小差异来进一步实质地观察视图匹配的范围，其中查询未被完全包含在视图中。另外，最小差异查询可以用作各种上下文中的分析工具。

7. 发明申请

US20070294221A1 DESIGNING RECORD MATCHING QUERIES UTILIZING EXAMPLES 有权
标题翻译：设计记录匹配问题应用实例
公开(公告)号：US20070294221A1
公开(公告)日：2007-12-20
申请号：US11424191
申请日：2006-06-14
申请人： Bee-Chung Chen , Venkatesh Ganti , Kaushik Shriraghav
发明人： Bee-Chung Chen , Venkatesh Ganti , Kaushik Shriraghav
IPC分类号： G06F17/30
CPC分类号： G06F17/30489 , Y10S707/99933 , Y10S707/99934
摘要： The subject disclosure pertains to a powerful and flexible framework for record matching. The framework facilitates design of a record matching query or package composed of a set of well-defined primitive operators (e.g., relational, data cleaning . . . ), which can ultimately be executed to match records. To assist design of such packages, a learning technique based on examples is provided. More specifically, a set of matching and non-matching record pairs can be input and employed to facilitate automatic package generation. A generated package can subsequently be transformed manually and/or automatically into a semantically equivalent form optimized for execution.
摘要翻译：主题公开涉及用于记录匹配的强大且灵活的框架。该框架便于设计由一组明确定义的原始运算符（例如，关系数据清理...）组成的记录匹配查询或包，其最终可以被执行以匹配记录。为了协助这样的包装的设计，提供了基于示例的学习技术。更具体地，可以输入并采用一组匹配和非匹配记录对来促进自动包装生成。生成的包可以随后被手动和/或自动地变换成为执行而优化的语义上等同的形式。

8. 发明申请

US20070198469A1 MINIMAL DIFFERENCE QUERY AND VIEW MATCHING 有权
公开(公告)号：US20070198469A1
公开(公告)日：2007-08-23
申请号：US11564981
申请日：2006-11-30
申请人： Kaushik Shriraghav , Venkatesh Ganti , Xin Dong
发明人： Kaushik Shriraghav , Venkatesh Ganti , Xin Dong
IPC分类号： G06F17/30
CPC分类号： G06F17/30451 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934
摘要： The subject disclosure pertains to efficient computation of the difference between queries by exploiting commonality between them. A minimal difference query (MDQ) is generated that roughly corresponds to removal of as many joins as possible while still accurately representing the query difference. The minimal difference can be employed to further substantially the scope of view matching where a query is not wholly subsumed by a view. Additionally, the minimal difference query can be employed as an analytical tool in various contexts.

9. 发明申请

US20070192282A1 MINIMAL DIFFERENCE QUERY AND VIEW MATCHING 有权
公开(公告)号：US20070192282A1
公开(公告)日：2007-08-16
申请号：US11352628
申请日：2006-02-13
申请人： Kaushik Shriraghav , Venkatesh Ganti , Xin Dong
发明人： Kaushik Shriraghav , Venkatesh Ganti , Xin Dong
IPC分类号： G06F17/30
CPC分类号： G06F17/30451 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934
摘要： The subject disclosure pertains to efficient computation of the difference between queries by exploiting commonality between them. A minimal difference query (MDQ) is generated that roughly corresponds to removal of as many joins as possible while still accurately representing the query difference. The minimal difference can be employed to further substantially the scope of view matching where a query is not wholly subsumed by a view. Additionally, the minimal difference query can be employed as an analytical tool in various contexts.

10. 发明授权

US07865505B2 Efficient exact set similarity joins 有权
标题翻译：有效的精确集合相似性连接
公开(公告)号：US07865505B2
公开(公告)日：2011-01-04
申请号：US11668870
申请日：2007-01-30
申请人： Arvind Arasu , Venkatesh Ganti , Kaushik Shriraghav
发明人： Arvind Arasu , Venkatesh Ganti , Kaushik Shriraghav
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30498 , G06F17/30533
摘要： 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.
摘要翻译：一种机器实现的系统和方法，其有效地促进并实现集合集合之间的精确相似性连接。系统和方法从接口获得集合集合和阈值，并且至少部分地基于分析组件生成的集合集合之间的可识别相似性（例如重叠或交集）并输出候选对，至少等于或超过阈值。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式