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

1. 发明申请

US20060294430A1 Systems and methods for dynamic application patching 有权
公开(公告)号：US20060294430A1
公开(公告)日：2006-12-28
申请号：US11012767
申请日：2004-12-15
申请人： Ross Bunker , Roger Weber , Lawrence Jones
发明人： Ross Bunker , Roger Weber , Lawrence Jones
IPC分类号： G06F11/00
CPC分类号： G06F8/65
摘要： A system and method to update a patch index such that one or more properties in the patch index are associated with the patch, wherein the patch includes one or more components for the target software system; updating a class path at run-time for the target software system such that the patch associated with each one of the one or more properties supersedes prior patches for the same property; and wherein a component can include a class.

2. 发明申请

US20050240902A1 System and method for describing application extensions in XML 有权
标题翻译：用于描述XML中的应用程序扩展的系统和方法
公开(公告)号：US20050240902A1
公开(公告)日：2005-10-27
申请号：US10786772
申请日：2004-02-25
申请人： Ross Bunker , Brendan MacLean , Britton Piehler
发明人： Ross Bunker , Brendan MacLean , Britton Piehler
IPC分类号： G06F9/44
CPC分类号： G06F9/44526 , Y10S707/99944 , Y10S707/99945
摘要： A system and method for an extendable application framework, comprising a user interface, at least one service, at least one extension, wherein one of the at least one extensions can provide access to functionality in the user interface, and wherein one of the at least one services can provide access to functionality in one of the at least one extensions.
摘要翻译：一种用于可扩展应用框架的系统和方法，包括用户界面，至少一个服务，至少一个扩展，其中所述至少一个扩展中的一个可以提供对所述用户界面中的功能的访问，并且其中至少一个一个服务可以提供对至少一个扩展中的一个的功能的访问。

3. 发明申请

US20050097100A1 System and method for segmented evaluation of database queries 失效
标题翻译：数据库查询分段评估的系统和方法
公开(公告)号：US20050097100A1
公开(公告)日：2005-05-05
申请号：US10998761
申请日：2004-11-29
申请人： Cesar Galindo-Legaria , Goetz Graefe , Milind Joshi , Ross Bunker
发明人： Cesar Galindo-Legaria , Goetz Graefe , Milind Joshi , Ross Bunker
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30501 , G06F17/3046 , G06F17/30466 , G06F17/30498 , Y10S707/99933 , Y10S707/99943
摘要： A method of satsfying a database query includes evaluating certain joins on a per-segment basis. An expression tree is produced for the query, and the expression tree is evaluated to identify joins whose operands are two instances of the same relation and whose join predicate conjunctively includes an equality comparison between two instances of the same column. When such a join is identified, it may be evaluated by segmenting the operand relation according to the columns that are compared for equality in the predicate. The join is then evaluated by performing the join operation separately on each segment. Segments may be spooled separately, thereby exploiting the efficiencies obtained by spooling even where the entire relation is too large to fit in the spool. Execution iterators are provided for spooling successive segments and for applying the join to the spooled segment.
摘要翻译：饱和数据库查询的方法包括基于每个段来评估某些联接。为查询生成表达式树，并且对表达式树进行评估，以标识其操作数是相同关系的两个实例的连接，并且其连接谓词连接地包含同一列的两个实例之间的等效比较。当识别出这样的连接时，可以通过根据在谓词中的相等性进行比较的列分割操作数关系来评估操作数关系。然后通过在每个段上分别执行连接操作来评估连接。分段可以单独地卷绕，从而利用即使在整个关系太大而不能装入卷轴的情况下通过卷绕获得的效率。提供执行迭代器用于假脱机连续的段并将连接应用到假脱机段。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式