公开(公告)号：US07523091B2

公开(公告)日：2009-04-21

申请号：US11108940

申请日：2005-04-19

申请人： Olga Kapitskaia ,  Raymond Ng ,  Divesh Srivastava

发明人： Olga Kapitskaia ,  Raymond Ng ,  Divesh Srivastava

IPC分类号： G06F17/30

CPC分类号： G06F17/30457 ,  G06F17/3048 ,  H04L29/06 ,  H04L61/1517 ,  H04L61/1523 ,  H04L67/2852 ,  H04L67/289 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99935 ,  Y10S707/99939 ,  Y10S707/99953

摘要： The present invention discloses the use of generalized queries, referred to as query templates, obtained by generalizing individual user queries, as the semantic basis for low overhead, high benefit directory caches for handling declarative queries. Caching effectiveness can be improved by maintaining a set of generalizations of queries and admitting such generalizations into the cache when their estimated benefits are sufficiently high. In a preferred embodiment of the invention, the admission of query templates into the cache can be done in what is referred to by the inventors as a “revolutionary” fashion—followed by stable periods where cache admission and replacement can be done incrementally in an evolutionary fashion. The present invention can lead to considerably higher hit rates and lower server-side execution and communication costs than conventional caching of directory queries—while keeping the clientside computational overheads comparable to query caching.

摘要翻译： 本发明公开了通过将各个用户查询概括化而获得的通用查询（称为查询模板）作为用于处理声明式查询的低开销，高效益目录高速缓存的语义基础。 可以通过维护一组查询的概括来将高速缓存的有效性提高，并且当它们的估计收益足够高时，将这种泛化允许缓存。 在本发明的优选实施例中，将查询模板准许到高速缓存中可以在本发明人被称为“革命性”方式的情况下完成 - 其次是稳定的时期，其中缓存允许和替换可以在进化中逐步地完成 时尚。 与传统的目录查询缓存相比，本发明可以导致相当高的命中率和较低的服务器端执行和通信成本，同时保持客户端计算开销与查询缓存相当。

公开(公告)号：US20050203897A1

公开(公告)日：2005-09-15

申请号：US11108940

申请日：2005-04-19

申请人： Olga Kapitskaia ,  Raymond Ng ,  Divesh Srivastava

发明人： Olga Kapitskaia ,  Raymond Ng ,  Divesh Srivastava

IPC分类号： G06F17/30 ,  H04L9/00 ,  H04L29/06 ,  H04L29/08 ,  H04L29/12

CPC分类号： G06F17/30457 ,  G06F17/3048 ,  H04L29/06 ,  H04L61/1517 ,  H04L61/1523 ,  H04L67/2852 ,  H04L67/289 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99935 ,  Y10S707/99939 ,  Y10S707/99953

摘要： The present invention discloses the use of generalized queries, referred to as query templates, obtained by generalizing individual user queries, as the semantic basis for low overhead, high benefit directory caches for handling declarative queries. Caching effectiveness can be improved by maintaining a set of generalizations of queries and admitting such generalizations into the cache when their estimated benefits are sufficiently high. In a preferred embodiment of the invention, the admission of query templates into the cache can be done in what is referred to by the inventors as a “revolutionary” fashion—followed by stable periods where cache admission and replacement can be done incrementally in an evolutionary fashion. The present invention can lead to considerably higher hit rates and lower server-side execution and communication costs than conventional caching of directory queries—while keeping the clientside computational overheads comparable to query caching.

公开(公告)号：US06904433B2

公开(公告)日：2005-06-07

申请号：US09841834

申请日：2001-04-25

申请人： Olga Kapitskaia ,  Raymond Ng ,  Divesh Srivastava

发明人： Olga Kapitskaia ,  Raymond Ng ,  Divesh Srivastava

IPC分类号： G06F17/30 ,  H04L9/00 ,  H04L29/06 ,  H04L29/08 ,  H04L29/12

CPC分类号： G06F17/30457 ,  G06F17/3048 ,  H04L29/06 ,  H04L61/1517 ,  H04L61/1523 ,  H04L67/2852 ,  H04L67/289 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99935 ,  Y10S707/99939 ,  Y10S707/99953

摘要： The present invention discloses the use of generalized queries, referred to as query templates, obtained by generalizing individual user queries, as the semantic basis for low overhead, high benefit directory caches for handling declarative queries. Caching effectiveness can be improved by maintaining a set of generalizations of queries and admitting such generalizations into the cache when their estimated benefits are sufficiently high. In a preferred embodiment of the invention, the admission of query templates into the cache can be done in what is referred to by the inventors as a “revolutionary” fashion—followed by stable periods where cache admission and replacement can be done incrementally in an evolutionary fashion. The present invention can lead to considerably higher hit rates and lower server-side execution and communication costs than conventional caching of directory queries—while keeping the clientside computational overheads comparable to query caching.

摘要翻译： 本发明公开了通过将各个用户查询概括化而获得的通用查询（称为查询模板）作为用于处理声明式查询的低开销，高效益目录高速缓存的语义基础。 可以通过维护一组查询的概括来将高速缓存的有效性提高，并且当它们的估计收益足够高时，将这种泛化允许缓存。 在本发明的优选实施例中，将查询模板准许到高速缓存中可以在本发明人被称为“革命性”方式的情况下完成 - 其次是稳定的时期，其中缓存允许和替换可以在进化中逐步地完成 时尚。 与传统的目录查询缓存相比，本发明可以导致相当高的命中率和较低的服务器端执行和通信成本，同时保持客户端计算开销与查询缓存相当。