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

1. 发明授权

US07028030B2 Cluster caching with concurrency checking 有权
公开(公告)号：US07028030B2
公开(公告)日：2006-04-11
申请号：US10211713
申请日：2002-08-02
申请人： Dean Bernard Jacobs , Rob Woollen , Adam Messinger , Seth White
发明人： Dean Bernard Jacobs , Rob Woollen , Adam Messinger , Seth White
IPC分类号： G06F17/30
CPC分类号： G06F17/30902 , G06Q20/04 , G06Q20/389 , G07F19/201 , H04L67/1095 , H04L67/2852 , H04L67/288 , H04L69/329 , Y10S707/99938
摘要： Concurrency can be maintained in cluster caching when processing an update request on network server that is storing a local copy of a data item. The request can be processed using the local copy of the data item. A predicated update request can be sent to a network database storing the data item, wherein the database can commit the update if the local copy is current with the data item. If the local copy is not current, the network server can request a new copy, process the request using the current copy, and try another predicated request. The process can continue until the update is committed to the database or aborted. Once committed, any other servers in the cluster can be notified that the data item has been updated. Those other servers can drop any local copy of the data item and can request an updated copy of the data item.

2. 发明授权

US07328322B2 System and method for optimistic caching 有权
标题翻译：用于乐观缓存的系统和方法
公开(公告)号：US07328322B2
公开(公告)日：2008-02-05
申请号：US11339180
申请日：2006-01-25
申请人： Seth White , Adam Messinger , Dean Bernard Jacobs , Rob Woollen
发明人： Seth White , Adam Messinger , Dean Bernard Jacobs , Rob Woollen
IPC分类号： G06F12/00
CPC分类号： G06F12/0815 , Y10S707/99938 , Y10S707/99952
摘要： Transactions are granted concurrent access to a data item through the use of an optimistic concurrency algorithm. Each transaction gets its own instance of the data item, such as in a cache or in an entity bean, such that it is not necessary to lock the data. The instances can come from the data or from other instances. When a transaction updates the data item, the optimistic concurrency algorithm ensures that the other instances are notified that the data item has been changed and that it is necessary to read a new instance, from the database or from an update instance.
摘要翻译：通过使用乐观并发算法，允许事务同时访问数据项。每个事务获取其自己的数据项实例，例如缓存或实体bean，这样就不需要锁定数据。这些实例可以来自数据或其他实例。当事务更新数据项时，乐观并发算法确保通知其他实例数据项已被更改，并且需要从数据库或更新的实例读取新的实例。

3. 发明授权

US07444333B2 Cluster caching with concurrency checking 有权
标题翻译：具有并发检查的群集缓存
公开(公告)号：US07444333B2
公开(公告)日：2008-10-28
申请号：US11338969
申请日：2006-01-25
申请人： Dean Bernard Jacobs , Rob Woollen , Adam Messinger , Seth White
发明人： Dean Bernard Jacobs , Rob Woollen , Adam Messinger , Seth White
IPC分类号： G06F17/30
CPC分类号： G06F17/30902 , G06Q20/04 , G06Q20/389 , G07F19/201 , H04L67/1095 , H04L67/2852 , H04L67/288 , H04L69/329 , Y10S707/99938
摘要： Concurrency can be maintained in cluster caching when processing an update request on network server that is storing a local copy of a data item. The request can be processed using the local copy of the data item. A predicated update request can be sent to a network database storing the data item, wherein the database can commit the update if the local copy is current with the data item. If the local copy is not current, the network server can request a new copy, process the request using the current copy, and try another predicated request. The process can continue until the update is committed to the database or aborted. Once committed, any other servers in the cluster can be notified that the data item has been updated. Those other servers can drop any local copy of the data item and can request an updated copy of the data item.
摘要翻译：在存储数据项的本地副本的网络服务器上处理更新请求时，可以在群集缓存中维护并发性。可以使用数据项的本地副本处理请求。可以将预测的更新请求发送到存储数据项的网络数据库，其中如果本地副本与数据项目当前一起，则数据库可以提交更新。如果本地副本不是当前副本，则网络服务器可以请求新的副本，使用当前副本处理请求，并尝试另一个预定请求。该过程可以继续，直到更新提交到数据库或中止。一旦提交，群集中的任何其他服务器都可以通知数据项目已被更新。那些其他服务器可以删除数据项的任何本地副本，并可以请求数据项的更新副本。

4. 发明授权

US07020684B2 System and method for optimistic caching 有权
公开(公告)号：US07020684B2
公开(公告)日：2006-03-28
申请号：US10340023
申请日：2003-01-10
申请人： Seth White , Adam Messinger , Dean Bernard Jacobs , Rob Woollen
发明人： Seth White , Adam Messinger , Dean Bernard Jacobs , Rob Woollen
IPC分类号： G06F12/00
CPC分类号： G06F12/0815 , Y10S707/99938 , Y10S707/99952
摘要： Transactions are granted concurrent access to a data item through the use of an optimistic concurrency algorithm. Each transaction gets its own instance of the data item, such as in a cache or in an entity bean, such that it is not necessary to lock the data. The instances can come from the data or from other instances. When a transaction updates the data item, the optimistic concurrency algorithm ensures that the other instances are notified that the data item has been changed and that it is necessary to read a new instance, from the database or from an updated instance.This description is not intended to be a complete description of, or limit the scope of, the invention. Other features, aspects, and objects of the invention can be obtained from a review of the specification, the figures, and the claims.

5. 发明申请

US20060123199A1 System and method for optimistic caching 有权
公开(公告)号：US20060123199A1
公开(公告)日：2006-06-08
申请号：US11339180
申请日：2006-01-25
申请人： Seth White , Adam Messinger , Dean Jacobs , Rob Woollen
发明人： Seth White , Adam Messinger , Dean Jacobs , Rob Woollen
IPC分类号： G06F13/00
CPC分类号： G06F12/0815 , Y10S707/99938 , Y10S707/99952
摘要： Transactions are granted concurrent access to a data item through the use of an optimistic concurrency algorithm. Each transaction gets its own instance of the data item, such as in a cache or in an entity bean, such that it is not necessary to lock the data. The instances can come from the data or from other instances. When a transaction updates the data item, the optimistic concurrency algorithm ensures that the other instances are notified that the data item has been changed and that it is necessary to read a new instance, from the database or from an updated instance. This description is not intended to be a complete description of, or limit the scope of, the invention. Other features, aspects, and objects of the invention can be obtained from a review of the specification, the figures, and the claims.

6. 发明申请

US20060123066A1 Cluster caching with concurrency checking 有权
公开(公告)号：US20060123066A1
公开(公告)日：2006-06-08
申请号：US11338969
申请日：2006-01-25
申请人： Dean Jacobs , Rob Woollen , Adam Messinger , Seth White
发明人： Dean Jacobs , Rob Woollen , Adam Messinger , Seth White
IPC分类号： G06F17/30
CPC分类号： G06F17/30902 , G06Q20/04 , G06Q20/389 , G07F19/201 , H04L67/1095 , H04L67/2852 , H04L67/288 , H04L69/329 , Y10S707/99938
摘要： Concurrency can be maintained in cluster caching when processing an update request on network server that is storing a local copy of a data item. The request can be processed using the local copy of the data item. A predicated update request can be sent to a network database storing the data item, wherein the database can commit the update if the local copy is current with the data item. If the local copy is not current, the network server can request a new copy, process the request using the current copy, and try another predicated request. The process can continue until the update is committed to the database or aborted. Once committed, any other servers in the cluster can be notified that the data item has been updated. Those other servers can drop any local copy of the data item and can request an updated copy of the data item.

7. 发明申请

US20080097997A1 SYSTEM AND METHOD FOR OPTIMISTIC CACHING 审中-公开
标题翻译：用于最佳速度的系统和方法
公开(公告)号：US20080097997A1
公开(公告)日：2008-04-24
申请号：US11955229
申请日：2007-12-12
申请人： Seth White , Adam Messinger , Dean Jacobs , Rob Woollen
发明人： Seth White , Adam Messinger , Dean Jacobs , Rob Woollen
IPC分类号： G06F17/00
CPC分类号： G06F12/0815 , Y10S707/99938 , Y10S707/99952
摘要： Transactions are granted concurrent access to a data item through the use of an optimistic concurrency algorithm. Each transaction gets its own instance of the data item, such as in a cache or in an entity bean, such that it is not necessary to lock the data. The instances can come from the data or from other instances. When a transaction updates the data item, the optimistic concurrency algorithm ensures that the other instances are notified that the data item has been changed and that it is necessary to read a new instance, from the database or from an updated instance.
摘要翻译：通过使用乐观并发算法，允许事务同时访问数据项。每个事务获取其自己的数据项实例，例如缓存或实体bean，这样就不需要锁定数据。这些实例可以来自数据或其他实例。当事务更新数据项时，乐观并发算法确保通知其他实例数据项已被更改，并且需要从数据库或更新的实例读取新的实例。

8. 发明授权

US07702791B2 Hardware load-balancing apparatus for session replication 有权
标题翻译：用于会话复制的硬件负载平衡设备
公开(公告)号：US07702791B2
公开(公告)日：2010-04-20
申请号：US10000709
申请日：2001-10-31
申请人： Eric M. Halpern , Prasad Peddada , Adam Messinger , Dean Bernard Jacobs , Sam Pullara
发明人： Eric M. Halpern , Prasad Peddada , Adam Messinger , Dean Bernard Jacobs , Sam Pullara
IPC分类号： G06F15/16
CPC分类号： H04L67/1008 , H04L29/06 , H04L67/1002 , H04L67/1017 , H04L67/1029 , H04L67/1034 , H04L2029/06054
摘要： A session replication system provides real-time data replication without unnecessarily slowing down the user experience. A system in accordance with the present invention may utilize a primary server to serve requests from a network client, as well as a secondary server to replicate the session information. When a request is received on the session, an attempt may be made to serve the request on the primary server. If the primary is unable to receive or respond to the request, the request may be served on the secondary server or on a new primary server. If the secondary server receives the request, the secondary server may become the new primary server. If a new primary server is selected, the new primary may request the session information from the secondary server.
摘要翻译：会话复制系统提供实时数据复制，而不必不必要地减慢用户体验。根据本发明的系统可以利用主服务器来服务来自网络客户端的请求，以及副服务器来复制会话信息。当会话接收到请求时，可能会尝试在主服务器上提供请求。如果主服务器无法接收或响应该请求，则该请求可能会在辅助服务器或新的主服务器上提供。如果辅助服务器接收到请求，则辅助服务器可能会成为新的主服务器。如果选择了新的主服务器，则新的主服务器可以从辅助服务器请求会话信息。

9. 发明授权

US07409420B2 Method and apparatus for session replication and failover 有权
标题翻译：会话复制和故障切换的方法和设备
公开(公告)号：US07409420B2
公开(公告)日：2008-08-05
申请号：US10000708
申请日：2001-10-31
申请人： Sam Pullara , Eric M. Halpern , Prasad Peddada , Adam Messinger , Dean Bernard Jacobs
发明人： Sam Pullara , Eric M. Halpern , Prasad Peddada , Adam Messinger , Dean Bernard Jacobs
IPC分类号： G06F15/16
CPC分类号： G06F11/2035 , G06F11/2028 , G06F11/2046 , G06F11/2097 , H04L29/06 , H04L67/1002 , H04L67/1008 , H04L67/1017 , H04L67/1021 , H04L67/1027 , H04L67/1031 , H04L67/1034 , H04L2029/06054
摘要： A session replication system provides real-time data replication without unnecessarily slowing down the user experience. A system in accordance with the present invention may utilize a primary server to serve requests from a network client, as well as a secondary server to replicate the session information. When a request is received on the session, an attempt may be made to serve the request on the primary server. If the primary is unable to receive or respond to the request, the request may be served on the secondary application server or on a new primary server. If the secondary server receives the request, the secondary server may become the new primary server. If a new primary server is selected, the new primary may request the session information from the secondary server.
摘要翻译：会话复制系统提供实时数据复制，而不必不必要地减慢用户体验。根据本发明的系统可以利用主服务器来服务来自网络客户端的请求，以及副服务器来复制会话信息。当会话接收到请求时，可能会尝试在主服务器上提供请求。如果主服务器无法接收或响应请求，则请求可能会在辅助应用程序服务器或新的主服务器上提供。如果辅助服务器接收到请求，则辅助服务器可能会成为新的主服务器。如果选择了新的主服务器，则新的主服务器可以从辅助服务器请求会话信息。

10. 发明授权

US06748373B2 System and method for adaptively optimizing queries 有权
标题翻译：用于自适应优化查询的系统和方法
公开(公告)号：US06748373B2
公开(公告)日：2004-06-08
申请号：US10244884
申请日：2002-09-17
申请人： Adam Messinger , Seth White
发明人： Adam Messinger , Seth White
IPC分类号： G06F1730
CPC分类号： G06F17/30306 , Y10S707/99932 , Y10S707/99933 , Y10S707/99943 , Y10S707/99944
摘要： The performance of a database system can be improved by tracking the way in which data is accessed. By tracking such information, it is possible to load frequently-accessed fields of an entity bean, as well as related beans that are frequently accessed, by optimizing a field group for that entity bean. It is also possible to use the tracking information to prevent infrequently accessed fields from being automatically loaded. Information to be monitored can include how often each field is accessed, how many times a particular entity or application accesses a field, and how often a field is accessed for a given transaction context. By using this information to periodically optimize field groups, the fields and associated entity beans that are most often accessed, such as by the entity and/or transaction causing the entity bean to be loaded, can be automatically loaded when an entity bean is loaded into a container. This lowers database traffic and the volume of data transfer by simultaneously loading the fields most likely to be accessed, and not loading data unlikely to be accessed.
摘要翻译：通过跟踪访问数据的方式可以提高数据库系统的性能。通过跟踪此类信息，可以通过优化该实体bean的字段组来加载实体bean的频繁访问字段以及经常访问的相关bean。还可以使用跟踪信息来防止不经常访问的字段被自动加载。要监视的信息可以包括每个字段被访问的频率，特定实体或应用程序访问字段的次数以及给定事务上下文访问字段的频率。通过使用此信息来定期优化字段组，可以在实体bean加载时自动加载最常访问的字段和关联的实体bean，例如通过导致实体bean加载的实体和/或事务的关联实体bean 一个容器通过同时加载最可能被访问的字段，并且不加载不太可能被访问的数据，这降低了数据库流量和数据传输量。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式