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

1. 发明授权

US06889234B1 System and methods for invalidation to enable caching of dynamically generated content 失效
公开(公告)号：US06889234B1
公开(公告)日：2005-05-03
申请号：US10084630
申请日：2002-02-26
申请人： Wen-Syan Li , Kasim Selcuk Candan , Divyakant Agrawal
发明人： Wen-Syan Li , Kasim Selcuk Candan , Divyakant Agrawal
IPC分类号： G06F17/30
CPC分类号： G06F17/3056 , G06F17/30345 , G06F17/30368 , Y10S707/959 , Y10S707/99932 , Y10S707/99952 , Y10S707/99954
摘要： Various systems and methods are describe for determining dynamically generated content to be invalidated as a result of changes to underlying data. In one method, invalidation processing is performed using a delayed version of the database that reflects the state of the database at the beginning of a preceding processing cycle, and an update log that reflects all updates since the beginning of the preceding processing cycle. In another method, invalidation processing is performed by locking a database which is locked during processing so as to reflect the state of the database at the beginning of processing, and an update log that reflects all updates to the database since the beginning of the preceding processing cycle. In another method, invalidation processing uses the database while it is freely updated during said processing, and the update log of the database.

2. 发明授权

US06701316B1 Method and apparatus for intelligent network bandwidth and system resource utilization for web content fetch and refresh 有权
标题翻译：网络内容获取和刷新的智能网络带宽和系统资源利用的方法和装置
公开(公告)号：US06701316B1
公开(公告)日：2004-03-02
申请号：US09654106
申请日：2000-08-31
申请人： Wen-Syan Li , Kasim Selcuk Candan , Divyakant Agrawal
发明人： Wen-Syan Li , Kasim Selcuk Candan , Divyakant Agrawal
IPC分类号： G06F1730
CPC分类号： G06F17/30902 , Y10S707/959
摘要： A content delivery services provider is disclosed for directing the at least one proxy server to pre-fetch content from the at least one content provider original site using an optimum pre-fetch bandwidth allocation value. The content delivery services provider is part of a system for storing and delivering content, which includes a plurality of end user browsers for requesting content, at least one content provider original site for delivering the content, and at least one proxy server for storing the content. These elements are coupled over a network for communicating with each other. The content delivery services provider programmed for: (1) modeling a retrieval time of content o of size size(o) using b units of bandwidth as ret(o)=congestion×size(o)×d(b), wherein d(b) is a unit delay observed when b units of bandwidth is used for pre-fetching the content, and congestion(Util) can be represented as congestion ( Util ) = β Util θ + α + φ or congestion(Util)=&bgr;×(1.0−Util)&agr;+&phgr;; (2) modeling an amount of delay observed by the at least one proxy server for the content fetched from the at least one content provider original site at time t0 as ret ⁡ ( P ) = congestion ( P + r ⁡ ( t 0 ) B ) × r ⁡ ( t 0 ) × d , wherein P is a pre-fetch bandwidth size, B is a total bandwidth available to the system, r(t)=(1−&sgr;(P))×u(t) is an amount of bandwidth the system uses for retrieving end user browser requests for content that is not stored in the at least one proxy server, &sgr;(P) is a cache freshness and availability value given a bandwidth P, and u(t) is a user access rate; (3) calculating the optimum pre-fetch bandwidth allocation value P by solving δ ⁢ ⁢ ret ⁡ ( P ) δ ⁢ ⁢ P = 0 ; and (4) communicating the optimum pre-fetch bandwidth allocation value P to the at least one proxy server.
摘要翻译：公开了一种内容传送服务提供商，用于指导所述至少一个代理服务器使用最佳预取带宽分配值从所述至少一个内容提供商原始站点预取内容。内容传递服务提供者是用于存储和传送内容的系统的一部分，其包括用于请求内容的多个终端用户浏览器，用于递送内容的至少一个内容提供者原始站点，以及用于存储内容的至少一个代理服务器。这些元件通过网络耦合以进行通信。内容传递服务提供商编程为：（1）使用b个带宽单位对尺寸大小（o）的内容o的检索时间进行建模，如（o）= congestionxsize（o）xd（b），其中d（b）是当b个带宽单位用于预取内容时观察到的单位延迟，并且拥塞（Util）可以表示为拥塞（Util）= betax（1.0-Util）+ phi; （2）在时刻t0对从至少一个内容提供者原始站点取得的内容的至少一个代理服务器观察到的延迟量进行建模，其中P是预取带宽大小，B是可用于系统，r（t）=（1-sigma（P））xu（t）是系统用于检索最终用户浏览器对未存储在至少一个代理服务器中的内容的请求的带宽量，）是给定带宽P的缓存新鲜度和可用性值，u（t）是用户访问速率; （3）通过求解计算最佳预取带宽分配值P，并且（4）将最佳预取带宽分配值P传送给至少一个代理服务器。

3. 发明授权

US07228318B2 System and methods for invalidation to enable caching of dynamically generated content 有权
标题翻译：无效的系统和方法，以实现动态生成内容的缓存
公开(公告)号：US07228318B2
公开(公告)日：2007-06-05
申请号：US11121825
申请日：2005-05-04
申请人： Wen-Syan Li , Kasim Selcuk Candan , Divyakant Agrawal
发明人： Wen-Syan Li , Kasim Selcuk Candan , Divyakant Agrawal
IPC分类号： G06F17/30
CPC分类号： G06F17/3056 , G06F17/30345 , G06F17/30368 , Y10S707/959 , Y10S707/99932 , Y10S707/99952 , Y10S707/99954
摘要： Various systems and methods are describe for determining dynamically generated content to be invalidated as a result of changes to underlying data. In one method, invalidation processing is performed using a delayed version of the database that reflects the state of the database at the beginning of a preceding processing cycle, and an update log that reflects all updates since the beginning of the preceding processing cycle. In another method, invalidation processing is performed by locking a database which is locked during processing so as to reflect the state of the database at the beginning of processing, and an update log that reflects all updates to the database since the beginning of the preceding processing cycle. In another method, invalidation processing uses the database while it is freely updated during said processing, and the update log of the database.
摘要翻译：描述了各种系统和方法，用于确定由于底层数据的更改导致的无效的动态生成内容。在一种方法中，使用在前一处理周期开始时反映数据库的状态的数据库的延迟版本执行无效处理，以及从上一个处理周期开始以来反映所有更新的更新日志。在另一种方法中，通过锁定在处理期间被锁定的数据库来执行无效处理，以便在处理开始时反映数据库的状态，以及从上一个处理开始以来反映到数据库的所有更新的更新日志周期。在另一种方法中，无效处理在所述处理期间自由更新数据库以及数据库的更新日志时使用该数据库。

4. 发明申请

US20070294217A1 SAFETY GUARANTEE OF CONTINUOUS JOIN QUERIES OVER PUNCTUATED DATA STREAMS 审中-公开
标题翻译：连续数据流连续查询的安全保证
公开(公告)号：US20070294217A1
公开(公告)日：2007-12-20
申请号：US11691640
申请日：2007-03-27
申请人： Songting Chen , Hua-Gang Li , Junichi Tatemura , Wang-Pin Hsiung , Divyakant Agrawal , Kasim Selcuk Candan
发明人： Songting Chen , Hua-Gang Li , Junichi Tatemura , Wang-Pin Hsiung , Divyakant Agrawal , Kasim Selcuk Candan
IPC分类号： G06F17/30
CPC分类号： G06F16/24568
摘要： Systems and methods are disclosed to guarantee the safety of a continuous join query (CJQ) over one or more punctuated data streams by constructing a punctuation graph; checking whether the punctuation graph is strongly connected and if so, indicating that the CJQ is safe to execute. The system uses a generalized punctuation graph and its transformation to support arbitrary punctuation schemes. The system also provides an efficient shared purge algorithm for multi-way join operator.
摘要翻译：公开了系统和方法，以通过构造标点符号图来确保连续联接查询（CJQ）在一个或多个标点数据流上的安全性; 检查标点图是否强连接，如果是，则指示CJQ是否安全执行。系统使用广义标点符号图及其转换来支持任意的标点符号方案。该系统还为多路连接运算符提供了一种高效的共享清除算法。

5. 发明申请

US20080154860A1 EFFICIENT PROCESSING OF TREE PATTERN QUERIES OVER XML DOCUMENTS 审中-公开
标题翻译：对XML文档进行树模式查询的有效处理
公开(公告)号：US20080154860A1
公开(公告)日：2008-06-26
申请号：US11691470
申请日：2007-03-26
申请人： Songting Chen , Hua-Gang Li , Junichi Tatemura , Wang-Pin Hsiung , Divyakant Agrawal , Kasim Selcuk Candan
发明人： Songting Chen , Hua-Gang Li , Junichi Tatemura , Wang-Pin Hsiung , Divyakant Agrawal , Kasim Selcuk Candan
IPC分类号： G06F17/30
CPC分类号： G06F16/8373
摘要： Systems and methods process generalized-tree-pattern queries by processing a twig query with a bottom-up computation to generate a generalized tree pattern result; encoding the generalized tree pattern results using hierarchical stacks; enumerating the generalized tree pattern result with a top-down computation; a hybrid of top-down and bottom-up computation for early result enumeration before reaching the end of document; and a more succinct encoding scheme that replaces the hierarchical stacks to further improve the performance.
摘要翻译：系统和方法通过使用自下而上的计算处理树枝查询来生成广义树模式结果来处理广义树模式查询; 使用分层堆栈编码广义树模式结果; 使用自上而下的计算来枚举广义树模式结果; 在达到文档结束之前的早期结果枚举的自上而下和自下而上的计算的混合; 以及更简洁的编码方案，可以替代分层堆栈以进一步提高性能。

6. 发明申请

US20050192995A1 System and methods for invalidation to enable caching of dynamically generated content 有权
标题翻译：无效的系统和方法，以实现动态生成内容的缓存
公开(公告)号：US20050192995A1
公开(公告)日：2005-09-01
申请号：US11121825
申请日：2005-05-04
申请人： Wen-Syan Li , Kasim Candan , Divyakant Agrawal
发明人： Wen-Syan Li , Kasim Candan , Divyakant Agrawal
IPC分类号： G06F17/30 , G06F17/00
CPC分类号： G06F17/3056 , G06F17/30345 , G06F17/30368 , Y10S707/959 , Y10S707/99932 , Y10S707/99952 , Y10S707/99954
摘要： Various systems and methods are describe for determining dynamically generated content to be invalidated as a result of changes to underlying data. In one method, invalidation processing is performed using a delayed version of the database that reflects the state of the database at the beginning of a preceding processing cycle, and an update log that reflects all updates since the beginning of the preceding processing cycle. In another method, invalidation processing is performed by locking a database which is locked during processing so as to reflect the state of the database at the beginning of processing, and an update log that reflects all updates to the database since the beginning of the preceding processing cycle. In another method, invalidation processing uses the database while it is freely updated during said processing, and the update log of the database.
摘要翻译：描述了各种系统和方法，用于确定由于底层数据的更改导致的无效的动态生成内容。在一种方法中，使用在前一处理周期开始时反映数据库的状态的数据库的延迟版本执行无效处理，以及从上一个处理周期开始以来反映所有更新的更新日志。在另一种方法中，通过锁定在处理期间被锁定的数据库来执行无效处理，以便在处理开始时反映数据库的状态，以及从上一个处理开始以来反映到数据库的所有更新的更新日志周期。在另一种方法中，无效处理在所述处理期间自由更新数据库以及数据库的更新日志时使用该数据库。

7. 发明授权

US06591266B1 System and method for intelligent caching and refresh of dynamically generated and static web content 有权
标题翻译：用于智能缓存和刷新动态生成和静态Web内容的系统和方法
公开(公告)号：US06591266B1
公开(公告)日：2003-07-08
申请号：US09639208
申请日：2000-08-14
申请人： Wen Syan Li , Kasim Selouk Candan , Divyakant Agrawal
发明人： Wen Syan Li , Kasim Selouk Candan , Divyakant Agrawal
IPC分类号： G06F1730
CPC分类号： G06F17/30902 , Y10S707/99932 , Y10S707/99939 , Y10S707/99945
摘要： A system for updating Web pages stored in cache based on modifications to data stored in a database is disclosed. The system for updating stored Web pages may be part of a larger system having a database management system for storing data used to generate Web pages. The database management system is capable of identifying modified data stored in the database. The system for updating stored Web pages is comprised of one or more servers programmed for maintaining associations between the stored Web pages and the stored data, and receiving the identity of modified data from the memory management system. In addition, the servers are capable of determining, from the identified modified data and the maintained associations, which stored Web pages are associated with the identified modified data. Furthermore, the servers are capable of communicating an update command to the cache that contains the stored Web pages associated with the identified modified data, for the purpose of updating the stored Web pages.
摘要翻译：公开了一种基于对存储在数据库中的数据的修改来更新存储在高速缓存中的网页的系统。用于更新存储的网页的系统可以是具有用于存储用于生成网页的数据的数据库管理系统的较大系统的一部分。数据库管理系统能够识别存储在数据库中的修改数据。用于更新存储的网页的系统包括被编程用于维护所存储的网页与所存储的数据之间的关联以及从存储器管理系统接收修改的数据的身份的一个或多个服务器。此外，服务器能够根据所识别的修改数据和维护的关联来确定哪些存储的网页与所识别的修改数据相关联。此外，为了更新存储的网页，服务器能够向包含与识别的修改数据相关联的存储的网页的缓存传送更新命令。

8. 发明申请

US20070079004A1 Method and apparatus for distributed indexing 审中-公开
标题翻译：分布式索引的方法和装置
公开(公告)号：US20070079004A1
公开(公告)日：2007-04-05
申请号：US11240068
申请日：2005-09-30
申请人： Junichi Tatemura , Kasim Candan , Liping Chen , Divyakant Agrawal , Dirceu Cavendish
发明人： Junichi Tatemura , Kasim Candan , Liping Chen , Divyakant Agrawal , Dirceu Cavendish
IPC分类号： G06F15/173
CPC分类号： G06F9/5044
摘要： Disclosed is a method and apparatus for providing range based queries over distributed network nodes. Each of a plurality of distributed network nodes stores at least a portion of a logical index tree. The nodes of the logical index tree are mapped to the network nodes based on a hash function. Load balancing is addressed by replicating the logical index tree nodes in the distributed physical nodes in the network. In one embodiment the logical index tree comprises a plurality of logical nodes for indexing available resources in a grid computing system. The distributed network nodes are broker nodes for assigning grid computing resources to requesting users. Each of the distributed broker nodes stores at least a portion of the logical index tree.
摘要翻译：公开了一种用于在分布式网络节点上提供基于范围的查询的方法和装置。多个分布式网络节点中的每一个存储逻辑索引树的至少一部分。基于散列函数将逻辑索引树的节点映射到网络节点。通过复制网络中分布式物理节点中的逻辑索引树节点来解决负载平衡问题。在一个实施例中，逻辑索引树包括用于索引网格计算系统中的可用资源的多个逻辑节点。分布式网络节点是用于向请求用户分配网格计算资源的代理节点。每个分布式代理节点存储逻辑索引树的至少一部分。

9. 发明申请

US20090265325A1 Adaptive multi-channel content selection with behavior-aware query analysis 有权
标题翻译：自适应多通道内容选择与行为感知查询分析
公开(公告)号：US20090265325A1
公开(公告)日：2009-10-22
申请号：US12148190
申请日：2008-04-16
申请人： Orhan Camoglu , Wahid Chrabakh , Lei Ding , Jingheo Miao , Divyakant Agrawal , Neeraj Bhatnagar , Tao Yang
发明人： Orhan Camoglu , Wahid Chrabakh , Lei Ding , Jingheo Miao , Divyakant Agrawal , Neeraj Bhatnagar , Tao Yang
IPC分类号： G06F7/06 , G06F17/30
CPC分类号： G06F17/30867
摘要： Systems and methods for selecting content from a plurality of channels in response to a received query are described. The systems and methods optimize content selection based on received queries and an identification of the user together with analysis of historical data.
摘要翻译：描述了用于响应于所接收的查询从多个信道中选择内容的系统和方法。系统和方法根据接收的查询和用户的识别以及历史数据的分析优化内容选择。

10. 发明申请

US20080097959A1 SCALABLE XML FILTERING WITH BOTTOM UP PATH MATCHING AND ENCODED PATH JOINS 审中-公开
标题翻译：可扩展的XML过滤与底部路径匹配和编码路径加入
公开(公告)号：US20080097959A1
公开(公告)日：2008-04-24
申请号：US11691655
申请日：2007-03-27
申请人： Songting Chen , Junichi Tatemura , Wang-Pin Hsiung , Divyakant Agrawal , Kasim Candan , Hua-Gang Li
发明人： Songting Chen , Junichi Tatemura , Wang-Pin Hsiung , Divyakant Agrawal , Kasim Candan , Hua-Gang Li
IPC分类号： G06F17/30
CPC分类号： G06F16/8358 , G06F16/8373
摘要： Systems and methods to provide two bottom up path matching solutions and one post processing solution for evaluating value predicates and tree pattern queries. The first path matching method triggers the matching whenever a leaf query step is seen and stores the prefix sub-matches in a cache for reuse. The second path matching method is an NFA (non-deterministic finite state automata) based solution through a post-order traversal of the XML document tree. The post processing method relies on a compact encoding the path results, which avoids redundant value predicate, join evaluations and any duplicate elimination, sort and grouping operations.
摘要翻译：提供两个自下而上路径匹配解决方案的系统和方法以及用于评估价值谓词和树型查询的一个后处理解决方案。第一个路径匹配方法在查看叶查询步骤时触发匹配，并将前缀子匹配存储在缓存中以供重用。第二路径匹配方法是通过XML文档树的后续遍历的基于NFA（非确定性有限状态自动机）的解决方案。后处理方法依赖于紧凑编码路径结果，避免了冗余值谓词，连接评估以及任何重复的排除，排序和分组操作。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式