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

1. 发明申请

US20100042581A1 JOIN PATHS ACROSS MULTIPLE DATABASES 有权
标题翻译：加入PATHS多个数据库
公开(公告)号：US20100042581A1
公开(公告)日：2010-02-18
申请号：US12605038
申请日：2009-10-23
申请人： Divesh Srivastava , Ioannis Kotidis
发明人： Divesh Srivastava , Ioannis Kotidis
IPC分类号： G06F17/30
CPC分类号： G06F17/30442 , Y10S707/99933
摘要： Methods, systems and computer instructions on computer readable media are disclosed for optimizing a query, including a first join path, a second join path, and an optimizer, to efficiently provide high quality information from large, multiple databases. The methods and systems include evaluating a schema graph identifying the join paths between a field X and a field Y, and a value X=x, to identify the top-few values of Y=y that are reachable from a specified X=x value when using the join paths. Each data path that instantiates the schema join paths can be scored and evaluated as to the quality of the data with respect to specified integrity constraints to alleviate data quality problems. Agglomerative scoring methodologies can be implemented to compute high quality information in the form of a top-few answers to a specified problem as requested by the query.
摘要翻译：公开了用于优化包括第一连接路径，第二连接路径和优化器的查询的方法，系统和计算机指令，以有效地从大型多个数据库提供高质量信息。方法和系统包括评估标识场X和场Y之间的连接路径的模式图，以及值X = x，以识别从指定的X = x值可达到的Y = y的最低值当使用连接路径时。实例化模式连接路径的每个数据路径可以根据指定的完整性约束对数据的质量进行评分和评估，以减轻数据质量问题。可以实施聚集评分方法，以按照查询请求的特定问题的最佳答案形式计算高质量信息。

2. 发明授权

US07440957B1 Updates through views 有权
标题翻译：视图更新
公开(公告)号：US07440957B1
公开(公告)日：2008-10-21
申请号：US11290683
申请日：2005-11-30
申请人： Ioannis Kotidis , Divesh Srivastava , Ioannis Velegrakis
发明人： Ioannis Kotidis , Divesh Srivastava , Ioannis Velegrakis
IPC分类号： G06F17/30
CPC分类号： G06F17/30477 , G06F17/30451
摘要： A method and system are disclosed that allow database views and base tables to be treated identically with respect to queries, insertions, deletions and updates. The method and system include separating the data instance of a view into a logical data instance and a physical data instance. The physical data instance is extended to include identifiers on data values that are used to query insert, delete and update information in base tables. The manner in which users and applications interface with the view remains unchanged since those interactions occur at the logical level.
摘要翻译：公开了一种允许数据库视图和基表相对于查询，插入，删除和更新进行相同处理的方法和系统。该方法和系统包括将视图的数据实例分离成逻辑数据实例和物理数据实例。物理数据实例被扩展为包括用于查询在基表中插入，删除和更新信息的数据值的标识符。用户和应用程序与视图接口的方式保持不变，因为这些交互发生在逻辑级别。

3. 发明授权

US07185012B1 Method and apparatus for ranked join indices 有权
标题翻译：排名连接索引的方法和装置
公开(公告)号：US07185012B1
公开(公告)日：2007-02-27
申请号：US10775056
申请日：2004-02-09
申请人： Nikolaos Koudas , Ioannis Kotidis , Themistoklis Palpanas , Divesh Srivastava , Panayiotis Tsaparas
发明人： Nikolaos Koudas , Ioannis Kotidis , Themistoklis Palpanas , Divesh Srivastava , Panayiotis Tsaparas
IPC分类号： G06F17/30
CPC分类号： G06F17/30498 , Y10S707/99932 , Y10S707/99933 , Y10S707/99937 , Y10S707/99942
摘要： A method and apparatus for ranked join indices includes a solution providing performance guarantees for top-k join queries over two relations, when preprocessing to construct a ranked join index for a specific join condition is permitted. The concepts of ranking join indices presented herein are also applicable in the case of a single relation. In this case, the concepts herein provide a solution to the top-k selection problem with monotone linear functions, having guaranteed worst case search performance for the case of two ranked attributes and arbitrary preference vectors.
摘要翻译：用于分级连接索引的方法和装置包括当允许对特定连接条件构建排名连接索引的预处理时，提供针对两个关系的top-k连接查询的性能保证的解决方案。在这里提出的排名连接指数的概念也适用于单一关系的情况。在这种情况下，这里的概念提供了对单调线性函数的top-k选择问题的解决方案，对于两个排序的属性和任意偏好向量的情况，保证了最差情况搜索性能。

4. 发明授权

US07630967B1 Join paths across multiple databases 失效
标题翻译：连接多个数据库的路径
公开(公告)号：US07630967B1
公开(公告)日：2009-12-08
申请号：US11285051
申请日：2005-11-22
申请人： Divesh Srivastava , Ioannis Kotidis
发明人： Divesh Srivastava , Ioannis Kotidis
IPC分类号： G06F7/00
CPC分类号： G06F17/30442 , Y10S707/99933
摘要： Methods, systems and computer instructions on computer readable media are disclosed for optimizing a query, including a first join path, a second join path, and an optimizer, to efficiently provide high quality information from large, multiple databases. The methods and systems include evaluating a schema graph identifying the join paths between a field X and a field Y, and a value X=x, to identify the top-few values of Y=y that are reachable from a specified X=x value when using the join paths. Each data path that instantiates the schema join paths can be scored and evaluated as to the quality of the data with respect to specified integrity constraints to alleviate data quality problems. Agglomerative scoring methodologies can be implemented to compute high quality information in the form of a top-few answers to a specified problem as requested by the query.
摘要翻译：公开了用于优化包括第一连接路径，第二连接路径和优化器的查询的方法，系统和计算机指令，以有效地从大型多个数据库提供高质量信息。方法和系统包括评估标识场X和场Y之间的连接路径的模式图，以及值X = x，以识别从指定的X = x值可达到的Y = y的最低值当使用连接路径时。实例化模式连接路径的每个数据路径可以根据指定的完整性约束对数据的质量进行评分和评估，以减轻数据质量问题。可以实施聚集评分方法，以按照查询请求的特定问题的最佳答案形式计算高质量信息。

5. 发明授权

US08176036B2 Join paths across multiple databases 有权
标题翻译：连接多个数据库的路径
公开(公告)号：US08176036B2
公开(公告)日：2012-05-08
申请号：US12605038
申请日：2009-10-23
申请人： Divesh Srivastava , Ioannis Kotidis
发明人： Divesh Srivastava , Ioannis Kotidis
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30442 , Y10S707/99933
摘要： Methods, systems and computer instructions on computer readable media are disclosed for optimizing a query, including a first join path, a second join path, and an optimizer, to efficiently provide high quality information from large, multiple databases. The methods and systems include evaluating a schema graph identifying the join paths between a field X and a field Y, and a value X=x, to identify the top-few values of Y=y that are reachable from a specified X=x value when using the join paths. Each data path that instantiates the schema join paths can be scored and evaluated as to the quality of the data with respect to specified integrity constraints to alleviate data quality problems. Agglomerative scoring methodologies can be implemented to compute high quality information in the form of a top-few answers to a specified problem as requested by the query.
摘要翻译：公开了用于优化包括第一连接路径，第二连接路径和优化器的查询的方法，系统和计算机指令，以有效地从大型多个数据库提供高质量信息。方法和系统包括评估标识场X和场Y之间的连接路径的模式图，以及值X = x，以识别从指定的X = x值可达到的Y = y的最低值当使用连接路径时。实例化模式连接路径的每个数据路径可以根据指定的完整性约束对数据的质量进行评分和评估，以减轻数据质量问题。可以实施聚集评分方法，以按照查询请求的特定问题的最佳答案形式计算高质量信息。

6. 发明授权

US08024346B2 Method and apparatus for ranked join indices 有权
标题翻译：排名连接索引的方法和装置
公开(公告)号：US08024346B2
公开(公告)日：2011-09-20
申请号：US12647490
申请日：2009-12-26
申请人： Nikolaos Koudas , Ioannis Kotidis , Themistoklis Palpanas , Divesh Srivastava , Panayiotis Tsaparas
发明人： Nikolaos Koudas , Ioannis Kotidis , Themistoklis Palpanas , Divesh Srivastava , Panayiotis Tsaparas
IPC分类号： G06F17/30
CPC分类号： G06F17/30498 , Y10S707/99932 , Y10S707/99933 , Y10S707/99937 , Y10S707/99942
摘要： A method and apparatus for ranked join indices includes a solution providing performance guarantees for top-k join queries over two relations, when preprocessing to construct a ranked join index for a specific join condition is permitted. The concepts of ranking join indices presented herein are also applicable in the case of a single relation. In this case, the concepts herein provide a solution to the top-k selection problem with monotone linear functions, having guaranteed worst case search performance for the case of two ranked attributes and arbitrary preference vectors.
摘要翻译：用于分级连接索引的方法和装置包括当允许对特定连接条件构建排名连接索引的预处理时，提供针对两个关系的top-k连接查询的性能保证的解决方案。在这里提出的排名连接指数的概念也适用于单一关系的情况。在这种情况下，这里的概念提供了对单调线性函数的top-k选择问题的解决方案，对于两个排序的属性和任意偏好向量的情况，保证了最差情况搜索性能。

7. 发明授权

US07664749B1 Method and apparatus for ranked join indices 有权
标题翻译：排名连接索引的方法和装置
公开(公告)号：US07664749B1
公开(公告)日：2010-02-16
申请号：US11676470
申请日：2007-02-19
申请人： Nikolaos Koudas , Ioannis Kotidis , Themistoklis Palpanas , Divesh Srivastava , Panayiotis Tsaparas
发明人： Nikolaos Koudas , Ioannis Kotidis , Themistoklis Palpanas , Divesh Srivastava , Panayiotis Tsaparas
IPC分类号： G06F17/30
CPC分类号： G06F17/30498 , Y10S707/99932 , Y10S707/99933 , Y10S707/99937 , Y10S707/99942
摘要： A method and apparatus for ranked join indices includes a solution providing performance guarantees for top-k join queries over two relations, when preprocessing to construct a ranked join index for a specific join condition is permitted. The concepts of ranking join indices presented herein are also applicable in the case of a single relation. In this case, the concepts herein provide a solution to the top-k selection problem with monotone linear functions, having guaranteed worst case search performance for the case of two ranked attributes and arbitrary preference vectors.
摘要翻译：用于分级连接索引的方法和装置包括当允许对特定连接条件构建排名连接索引的预处理时，提供针对两个关系的top-k连接查询的性能保证的解决方案。在这里提出的排名连接指数的概念也适用于单一关系的情况。在这种情况下，这里的概念提供了对单调线性函数的top-k选择问题的解决方案，对于两个排序的属性和任意偏好向量的情况，保证了最差情况搜索性能。

8. 发明授权

US07769782B1 Method and apparatus for using wavelets to produce data summaries 有权
标题翻译：使用小波生成数据摘要的方法和装置
公开(公告)号：US07769782B1
公开(公告)日：2010-08-03
申请号：US11906715
申请日：2007-10-03
申请人： Anna C. Gilbert , Ioannis Kotidis , Shanmugavelayutham Muthukrishnan , Martin J. Strauss
发明人： Anna C. Gilbert , Ioannis Kotidis , Shanmugavelayutham Muthukrishnan , Martin J. Strauss
IPC分类号： G06F17/30
CPC分类号： H04L47/10
摘要： A system and method are provided for summarizing dynamic data from distributed sources through the use of wavelets. The method comprises receiving a first data signal at a first location, where the first data signal is dynamic, determining a first array sketch of the first data signal and constructing a first wavelet representation by manipulating the first array sketch with a B-term wavelet expansion to produce a first representation. The method further comprises receiving a second data signal at a second location, where the second data signal is dynamic and where the second location is distinct from the first location, determining a second array sketch of the second data signal, and constructing a second wavelet representation by manipulating the second array sketch with a B-term wavelet expansion to produce a second representation. In one embodiment, the method further comprises obtaining first and second array sketches from first and second locations respectively, and constructing a wavelet representation of a linear combination of the first and second array sketches. In one embodiment, the expansion is done using a Haar wavelet.
摘要翻译：提供了一种系统和方法，用于通过使用小波来汇总来自分布式源的动态数据。该方法包括在第一位置处接收第一数据信号，其中第一数据信号是动态的，确定第一数据信号的第一阵列草图，并通过用B项小波展开操纵第一阵列草图来构造第一小波表示产生第一个表示。该方法还包括在第二位置处接收第二数据信号，其中第二数据信号是动态的，并且其中第二位置与第一位置不同，确定第二数据信号的第二阵列草图，以及构建第二小波表示通过用B项小波展开操纵第二阵列草图以产生第二表示。在一个实施例中，该方法还包括分别从第一和第二位置获得第一和第二阵列草图，以及构建第一和第二阵列草图的线性组合的小波表示。在一个实施例中，使用Haar小波进行扩展。

9. 发明授权

US07177282B1 Method and apparatus for using histograms to produce data summaries 失效
标题翻译：使用直方图产生数据摘要的方法和装置
公开(公告)号：US07177282B1
公开(公告)日：2007-02-13
申请号：US10114655
申请日：2002-04-02
申请人： Anna C. Gilbert , Sudipto Guha , Piotr Indyk , Ioannis Kotidis , Shanmugavelayutham Muthukrishnan , Martin J. Strauss
发明人： Anna C. Gilbert , Sudipto Guha , Piotr Indyk , Ioannis Kotidis , Shanmugavelayutham Muthukrishnan , Martin J. Strauss
IPC分类号： H04J1/16 , H04J3/14
CPC分类号： H04L43/06 , H04L43/045 , Y10S707/99934 , Y10S707/99943
摘要： A system and method are provided for monitoring dynamic data from distributed sources through the use of histograms. In the method, an array sketch of the digital signal is determined, a robust histogram is constructed from the array sketch, and an output histogram is constructed from the array sketch and the robust histogram via a hybrid histogram. Dyadic intervals of a representation of the array sketch are used in constructing the robust histogram.
摘要翻译：提供了一种系统和方法，用于通过使用直方图来监视来自分布式源的动态数据。在该方法中，确定数字信号的阵列草图，从阵列草图中构建鲁棒直方图，并通过混合直方图从阵列草图和鲁棒直方图构建输出直方图。数组草图表示的二维间隔用于构建鲁棒直方图。

10. 发明授权

US07965643B1 Method and apparatus for using histograms to produce data summaries 有权
标题翻译：使用直方图产生数据摘要的方法和装置
公开(公告)号：US07965643B1
公开(公告)日：2011-06-21
申请号：US12217958
申请日：2008-07-10
申请人： Anna C. Gilbert , Sudipto Guha , Piotr Indyk , Ioannis Kotidis , Shanmugavelayutham Muthukrishnan , Martin J. Strauss
发明人： Anna C. Gilbert , Sudipto Guha , Piotr Indyk , Ioannis Kotidis , Shanmugavelayutham Muthukrishnan , Martin J. Strauss
IPC分类号： H04J1/16
CPC分类号： H04L43/045 , H04L63/1408
摘要： A system and method are provided for summarizing dynamic data from distributed sources through the use of histograms. In particular, the method comprises receiving a first data signal at a first location, determining a first array sketch of the first data signal, and constructing a first output histogram from the first array sketch and a first robust histogram via a first hybrid histogram. Array sketches of a number of data signals may be calculated, and added to yield a single vector sum. The histogram is constructed from the vector sum. In that way, the vector sum may be analyzed without revealing the individual data signals that form the basis of the sum.
摘要翻译：提供了一种通过使用直方图从分布式源汇总动态数据的系统和方法。特别地，该方法包括在第一位置处接收第一数据信号，确定第一数据信号的第一阵列草图，以及经由第一混合直方图从第一阵列草图和第一稳健直方图构造第一输出直方图。可以计算多个数据信号的阵列草图，并将其加到以产生单个向量和。直方图由向量和构成。以这种方式，可以分析矢量和，而不会泄露构成和的基础的各个数据信号。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式