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

1. 发明申请

US20060161566A1 Sketch-based multi-query processing over data streams 有权
标题翻译：基于草图的数据流多查询处理
公开(公告)号：US20060161566A1
公开(公告)日：2006-07-20
申请号：US11025211
申请日：2004-12-29
申请人： Alin Dobra , Johannes Gehrke , Rajeev Rastogi , Minos Garofalakis
发明人： Alin Dobra , Johannes Gehrke , Rajeev Rastogi , Minos Garofalakis
IPC分类号： G06F7/00
CPC分类号： G06F17/30516 , G06F17/3046 , Y10S707/99936 , Y10S707/99942
摘要： A method of efficiently providing estimated answers to workloads of aggregate, multi-join SQL-like queries over a number of input data-streams. The method only examines each data elements once and uses a limited amount of computer memory. The method uses join graphs and atomic sketches that are essentially pseudo-random summaries formed using random binary variables. The estimated answer is the product of all the atomic sketches for all the vertices in the query join graph. A query workload is processed efficiently by identifying and sharing atomic sketches common to distinct queries, while ensuring that the join graphs remain well formed. The method may automatically minimize either the average query error or the maximum query error over the workload.
摘要翻译：一种有效提供对多个输入数据流的聚合，多连接SQL类查询的工作负载的估计答案的方法。该方法仅检查每个数据元素一次并使用有限数量的计算机存储器。该方法使用连接图和原子素描，它们本质上是使用随机二进制变量形成的伪随机摘要。估计答案是查询连接图中所有顶点的所有原子草图的乘积。通过识别和共享不同查询共同的原子草图，同时确保连接图形式保持良好，可以有效地处理查询工作负载。该方法可以自动最小化平均查询错误或工作负载上的最大查询错误。

2. 发明授权

US07328220B2 Sketch-based multi-query processing over data streams 有权
标题翻译：基于草图的数据流多查询处理
公开(公告)号：US07328220B2
公开(公告)日：2008-02-05
申请号：US11025211
申请日：2004-12-29
申请人： Alin Dobra , Johannes Gehrke , Rajeev Rastogi , Minos Garofalakis
发明人： Alin Dobra , Johannes Gehrke , Rajeev Rastogi , Minos Garofalakis
IPC分类号： G06F17/00
CPC分类号： G06F17/30516 , G06F17/3046 , Y10S707/99936 , Y10S707/99942
摘要： A method of efficiently providing estimated answers to workloads of aggregate, multi-join SQL-like queries over a number of input data-streams. The method only examines each data elements once and uses a limited amount of computer memory. The method uses join graphs and atomic sketches that are essentially pseudo-random summaries formed using random binary variables. The estimated answer is the product of all the atomic sketches for all the vertices in the query join graph. A query workload is processed efficiently by identifying and sharing atomic sketches common to distinct queries, while ensuring that the join graphs remain well formed. The method may automatically minimize either the average query error or the maximum query error over the workload.
摘要翻译：一种有效提供对多个输入数据流的聚合，多连接SQL类查询的工作负载的估计答案的方法。该方法仅检查每个数据元素一次并使用有限数量的计算机存储器。该方法使用连接图和原子素描，它们本质上是使用随机二进制变量形成的伪随机摘要。估计答案是查询连接图中所有顶点的所有原子草图的乘积。通过识别和共享不同查询共同的原子草图，同时确保连接图形式保持良好，可以有效地处理查询工作负载。该方法可以自动最小化平均查询错误或工作负载上的最大查询错误。

3. 发明授权

US08799264B2 Method for improving search engine efficiency 有权
标题翻译：提高搜索引擎效率的方法
公开(公告)号：US08799264B2
公开(公告)日：2014-08-05
申请号：US12332979
申请日：2008-12-11
申请人： Johannes Gehrke , Robbert Van Renesse , Fred Schneider
发明人： Johannes Gehrke , Robbert Van Renesse , Fred Schneider
IPC分类号： G06F7/08 , G06F17/30
CPC分类号： G06F17/30864
摘要： In a method for improving the efficiency of a search engine in accessing, searching and retrieving information in the form of documents stored in document or content repositories, the search engine comprises an array of search nodes hosted on one or more servers. An index of the stored document is created. The search engine processes a user search query and returns a result set of query-matching documents. The index of the search engine is configured on the basis of one or more document properties and partitioned, replicated and distributed over the array of the search nodes. The search queries are processed on the basis of the distributed index. The method realizes a framework for distributing the index of a search engine across several hosts in a computer cluster, relying on three orthogonal mechanisms for index distribution, namely index partitioning, index replication, and assignment of replicas to hosts. In this manner, different ways of configuring the index of a search engine are obtained and provide a much improved resource usage and performance, combined with any desired level of fault tolerance.
摘要翻译：在用于提高搜索引擎在存储在文档或内容存储库中的文档形式的访问，搜索和检索信息的效率的方法中，搜索引擎包括一个或多个服务器上托管的搜索节点的阵列。创建存储文档的索引。搜索引擎处理用户搜索查询并返回查询匹配文档的结果集。搜索引擎的索引是根据一个或多个文档属性进行配置的，并在搜索节点的阵列上进行分区，复制和分发。搜索查询根据分布式索引进行处理。该方法实现了一种框架，用于在计算机集群中的多个主机之间分配搜索引擎的索引，依赖于索引分配的三个正交机制，即索引分区，索引复制以及副本到主机的分配。以这种方式，可以获得配置搜索引擎的索引的不同方法，并提供大量改进的资源使用和性能，以及任何所需的容错级别。

4. 发明申请

US20060053122A1 Method for matching XML twigs using index structures and relational query processors 审中-公开
标题翻译：使用索引结构和关系查询处理器来匹配XML树枝的方法
公开(公告)号：US20060053122A1
公开(公告)日：2006-03-09
申请号：US10937641
申请日：2004-09-09
申请人： Philip Korn , Nikolaos Koudas , Divesh Srivastava , Zhiyuan Chen , Johannes Gehrke , Jayavel Shanmugasundaram
发明人： Philip Korn , Nikolaos Koudas , Divesh Srivastava , Zhiyuan Chen , Johannes Gehrke , Jayavel Shanmugasundaram
IPC分类号： G06F7/00
CPC分类号： G06F16/84
摘要： A framework defining a family of index structures useful in evaluating XML path expressions (i.e., twigs) in XML database is disclosed. Within this framework, two particular index structures with different space-time tradeoffs are presented that prove effective for the evaluation of twigs with value conditions. These index structures can be realized using access methods of an underlying relational database system. Experimental results show that the indices disclosed achieve significant improvement in performance for evaluating twig queries as compared with previously proposed XML path indices.
摘要翻译：公开了一种定义在XML数据库中评估XML路径表达式（即，树枝）中有用的索引结构族的框架。在这个框架内，提出了具有不同时空权衡的两个特定索引结构，这对于评价具有价值条件的枝条是有效的。这些索引结构可以使用底层关系数据库系统的访问方法来实现。实验结果表明，与以前提出的XML路径索引相比，所公开的索引在评估树枝查询方面的性能显着提高。

5. 发明授权

US10339139B2 Computer system and methods for performing data-driven coordination 有权
公开(公告)号：US10339139B2
公开(公告)日：2019-07-02
申请号：US13816382
申请日：2011-08-15
申请人： Johannes Gehrke , Christoph Koch , Lucja Kot , Nitin Gupta
发明人： Johannes Gehrke , Christoph Koch , Lucja Kot , Nitin Gupta
IPC分类号： G06F7/00 , G06F16/2455 , G06F16/242 , G06F17/30
摘要： A computer system and computer implemented method that obtains coordinated results from at least two queries by utilizing context data of each query. Specifically, the computer system and computer implemented method facilitates enhanced querying functionality by matching entangled queries to achieve coordinated results.

6. 发明申请

US20120110338A1 Protecting the Integrity and Privacy of Data with Storage Leases 有权
标题翻译：保护数据与存储租赁的完整性和隐私
公开(公告)号：US20120110338A1
公开(公告)日：2012-05-03
申请号：US13282847
申请日：2011-10-27
申请人： Peter Druschel , Rodrigo Rodrigues , Ansley Post , Johannes Gehrke , Anjo Lucas Vahldiek
发明人： Peter Druschel , Rodrigo Rodrigues , Ansley Post , Johannes Gehrke , Anjo Lucas Vahldiek
IPC分类号： G06F21/24
CPC分类号： G06F21/6218 , G06F2221/2137
摘要： Storage leases specify access restrictions and time periods, restricting access to their associated data during the storage lease time period. Storage leases may be assigned to individual data storage blocks or groups of data storage blocks in a data storage device. A data storage device may include any arbitrary number of different storage leases assigned to different portions of its data storage blocks. Storage lease-enabled devices may provide security certificates to verify that data access operations have been performed as requested and that their storage leases are being enforced. Storage lease-enabled devices compare storage lease information for data units with the current time using a clock isolated from access by storage clients or time certificates from one or more trusted time servers. Storage leases may be used in combination with backup applications, file systems, database systems, peer-to-peer data storage, and cloud storage systems.
摘要翻译：存储租赁指定访问限制和时间段，在存储租期期间限制对其相关数据的访问。存储租赁可以被分配给数据存储设备中的各个数据存储块或数据存储块组。数据存储设备可以包括分配给其数据存储块的不同部分的任意数量的不同存储租赁。支持启用存储租赁的设备可以提供安全证书，以验证已按照请求执行数据访问操作，并且其存储租约正在执行。启用存储租赁的设备将数据单元的存储租赁信息与当前时间进行比较，使用与存储客户端访问隔离的时钟或来自一个或多个可信时间服务器的时间证书。存储租赁可以与备份应用程序，文件系统，数据库系统，对等数据存储和云存储系统结合使用。

7. 发明申请

US20100257054A1 METHOD AND SYSTEM FOR EFFICIENT AND EXPRESSIVE ADVERTISING AUCTIONS 审中-公开
标题翻译：用于有效和明显广告拍卖的方法和系统
公开(公告)号：US20100257054A1
公开(公告)日：2010-10-07
申请号：US12675418
申请日：2008-08-27
申请人： David J. Martin , Joseph Y. Halpern , Johannes Gehrke
发明人： David J. Martin , Joseph Y. Halpern , Johannes Gehrke
IPC分类号： G06Q30/00 , G06Q10/00 , G06Q50/00
CPC分类号： G06Q30/08 , G06Q30/02 , G06Q30/0247 , G06Q30/0275
摘要： A system and method for allowing advertisers to express bids as bidding programs that take as input, for example, a search query and various statistics about auction history and performance, for outputting bids on output characteristics such as, for example, clicks, purchases, and slot positions, and for providing an efficient, scalable, and parallelizable algorithm to solve winner determination given the bids output by the bidding programs.
摘要翻译：一种系统和方法，用于允许广告主将投标作为投标程序（例如搜索查询和关于拍卖历史和性能的各种统计数据）作为输入来出价，以输出关于输出特征的出价，例如点击，购买和并提供一种高效，可扩展和可并行化的算法，以便根据投标程序输出的出价来解决获胜者的决定。

8. 发明授权

US09165155B2 Protecting the integrity and privacy of data with storage leases 有权
标题翻译：通过存储租赁保护数据的完整性和隐私
公开(公告)号：US09165155B2
公开(公告)日：2015-10-20
申请号：US13282847
申请日：2011-10-27
申请人： Peter Druschel , Rodrigo Rodrigues , Ansley Post , Johannes Gehrke , Anjo Lucas Vahldiek
发明人： Peter Druschel , Rodrigo Rodrigues , Ansley Post , Johannes Gehrke , Anjo Lucas Vahldiek
IPC分类号： G06F21/00 , G06F21/62
CPC分类号： G06F21/6218 , G06F2221/2137
摘要： Storage leases specify access restrictions and time periods, restricting access to their associated data during the storage lease time period. Storage leases may be assigned to individual data storage blocks or groups of data storage blocks in a data storage device. A data storage device may include any arbitrary number of different storage leases assigned to different portions of its data storage blocks. Storage lease-enabled devices may provide security certificates to verify that data access operations have been performed as requested and that their storage leases are being enforced. Storage lease-enabled devices compare storage lease information for data units with the current time using a clock isolated from access by storage clients or time certificates from one or more trusted time servers. Storage leases may be used in combination with backup applications, file systems, database systems, peer-to-peer data storage, and cloud storage systems.
摘要翻译：存储租赁指定访问限制和时间段，在存储租期期限内限制对其相关数据的访问。存储租赁可以被分配给数据存储设备中的各个数据存储块或数据存储块组。数据存储设备可以包括分配给其数据存储块的不同部分的任意数量的不同存储租约。支持启用存储租赁的设备可以提供安全证书，以验证已按照请求执行数据访问操作，并且其存储租约正在执行。启用存储租赁的设备将数据单元的存储租赁信息与当前时间进行比较，使用与存储客户端访问隔离的时钟或来自一个或多个可信时间服务器的时间证书。存储租赁可以与备份应用程序，文件系统，数据库系统，对等数据存储和云存储系统结合使用。

9. 发明申请

US20140304302A1 COMPUTER SYSTEM AND METHODS FOR PERFORMING DATA-DRIVEN COORDINATION 审中-公开
标题翻译：用于执行数据驱动协调的计算机系统和方法
公开(公告)号：US20140304302A1
公开(公告)日：2014-10-09
申请号：US13816382
申请日：2011-08-15
申请人： Johannes Gehrke , Christoph Koch , Lucja Kot , Nitin Gupta
发明人： Johannes Gehrke , Christoph Koch , Lucja Kot , Nitin Gupta
IPC分类号： G06F17/30
CPC分类号： G06F16/24554 , G06F16/2425
摘要： A computer system and computer implemented method that obtains coordinated results from at least two queries by utilizing context data of each query. Specifically, the computer system and computer implemented method facilitates enhanced querying functionality by matching entangled queries to achieve coordinated results.
摘要翻译：一种计算机系统和计算机实现的方法，其通过利用每个查询的上下文数据从至少两个查询获得协调的结果。具体来说，计算机系统和计算机实现的方法通过匹配纠缠的查询来实现协调的结果来促进增强的查询功能。

10. 发明授权

US08443350B2 System and method for scaling simulations and games 有权
标题翻译：缩放模拟和游戏的系统和方法
公开(公告)号：US08443350B2
公开(公告)日：2013-05-14
申请号：US12480261
申请日：2009-06-08
申请人： Johannes Gehrke , Alan John Demers , Christoph Emanuel Koch , Walker White
发明人： Johannes Gehrke , Alan John Demers , Christoph Emanuel Koch , Walker White
IPC分类号： G06F9/45 , G06F9/44 , G06F9/455 , G06F17/50 , G06F17/00 , G06F15/16 , G06F15/177
CPC分类号： G06F9/445 , A63F13/10 , A63F13/60 , A63F2300/209 , A63F2300/6009 , G06N3/004
摘要： A system and method for modeling simulation and game artificial intelligence as a data management problem are described. A scripting language provides game designers and players with a data-driven artificial intelligence scheme for customizing behavior for individual agents. Query processing and indexing techniques efficiently execute large numbers of agent scripts, thus providing a framework for games with a large number of agents.
摘要翻译：描述了一种将模拟和游戏人工智能建模为数据管理问题的系统和方法。脚本语言为游戏设计者和玩家提供了数据驱动的人工智能方案，用于为个别代理人定制行为。查询处理和索引技术有效地执行大量代理脚本，从而为具有大量代理的游戏提供框架。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式