公开(公告)号：US20140207825A1

公开(公告)日：2014-07-24

申请号：US14223785

申请日：2014-03-24

Applicant: Open Text S.A.

Inventor： Adison Hana Wongkar ,  Shaival Gupta

IPC: G06F17/30

CPC classification number: H04L63/0281 ,  G06F17/30091 ,  G06F17/30327 ,  H04L7/0008 ,  H04L67/2852

Abstract: Embodiments disclosed herein provide a “lazy” approach in caching a hierarchical navigation tree with one or more associated permission trees. In one embodiment, only a portion of a cached permission tree is updated. One embodiment of a method may comprise determining whether a dirty node exists by comparing tree timestamps of the permission tree and the master tree. If the tree timestamp of the master tree is temporally more recent than the tree timestamp of the permission tree, the permission tree has a dirty node and the method may operate to check node timestamps of the master and permission trees. This process may be repeated until the dirty node is found, at which time a portion of the permission tree associated with the dirty node may be reconstructed, rather than the entire permission tree itself, thereby eliminating or significantly reducing access time to the cached permission tree.

Abstract translation: 本文公开的实施例提供了一种“延迟”方法来缓存具有一个或多个相关权限树的层次导航树。 在一个实施例中，仅更新缓存许可树的一部分。 方法的一个实施例可以包括通过比较权限树和主树的树时间戳来确定是否存在脏节点。 如果主树的树时间戳在时间上比权限树的树时间戳更新，则权限树具有脏节点，并且该方法可以操作以检查主节点和权限树的节点时间戳。 可以重复该过程，直到找到脏节点，此时可以重建与脏节点相关联的许可树的一部分而不是整个权限树本身，从而消除或显着减少到缓存的权限树的访问时间 。

公开(公告)号：US20160043999A1

公开(公告)日：2016-02-11

申请号：US14920265

申请日：2015-10-22

Applicant: Open Text S.A.

Inventor： Adison Hana Wongkar ,  Shaival Gupta

IPC: H04L29/06 ,  H04L7/00 ,  H04L29/08

CPC classification number: H04L63/0281 ,  G06F17/30091 ,  G06F17/30327 ,  H04L7/0008 ,  H04L67/2852

Abstract: Embodiments disclosed herein provide a “lazy” approach in caching a hierarchical navigation tree with one or more associated permission trees. In one embodiment, only a portion of a cached permission tree is updated. One embodiment of a method may comprise determining whether a dirty node exists by comparing tree timestamps of the permission tree and the master tree. If the tree timestamp of the master tree is temporally more recent than the tree timestamp of the permission tree, the permission tree has a dirty node and the method may operate to check node timestamps of the master and permission trees. This process may be repeated until the dirty node is found, at which time a portion of the permission tree associated with the dirty node may be reconstructed, rather than the entire permission tree itself, thereby eliminating or significantly reducing access time to the cached permission tree.

Abstract translation: 本文公开的实施例提供了一种“延迟”方法来缓存具有一个或多个相关权限树的层次导航树。 在一个实施例中，仅更新缓存许可树的一部分。 方法的一个实施例可以包括通过比较权限树和主树的树时间戳来确定是否存在脏节点。 如果主树的树时间戳在时间上比权限树的树时间戳更新，则权限树具有脏节点，并且该方法可以操作以检查主节点和权限树的节点时间戳。 可以重复该过程，直到找到脏节点，此时可以重建与脏节点相关联的许可树的一部分而不是整个权限树本身，从而消除或显着减少到缓存的权限树的访问时间 。

公开(公告)号：US09183241B2

公开(公告)日：2015-11-10

申请号：US14223785

申请日：2014-03-24

Applicant: Open Text S.A.

Inventor： Adison Hana Wongkar ,  Shaival Gupta

IPC: G06F7/00 ,  G06F17/30

CPC classification number: H04L63/0281 ,  G06F17/30091 ,  G06F17/30327 ,  H04L7/0008 ,  H04L67/2852

Abstract: Embodiments disclosed herein provide a “lazy” approach in caching a hierarchical navigation tree with one or more associated permission trees. In one embodiment, only a portion of a cached permission tree is updated. One embodiment of a method may comprise determining whether a dirty node exists by comparing tree timestamps of the permission tree and the master tree. If the tree timestamp of the master tree is temporally more recent than the tree timestamp of the permission tree, the permission tree has a dirty node and the method may operate to check node timestamps of the master and permission trees. This process may be repeated until the dirty node is found, at which time a portion of the permission tree associated with the dirty node may be reconstructed, rather than the entire permission tree itself, thereby eliminating or significantly reducing access time to the cached permission tree.

Abstract translation: 本文公开的实施例提供了一种“延迟”方法来缓存具有一个或多个相关权限树的层次导航树。 在一个实施例中，仅更新缓存许可树的一部分。 方法的一个实施例可以包括通过比较权限树和主树的树时间戳来确定是否存在脏节点。 如果主树的树时间戳在时间上比权限树的树时间戳更新，则权限树具有脏节点，并且该方法可以操作以检查主节点和权限树的节点时间戳。 可以重复该过程，直到找到脏节点，此时可以重建与脏节点相关联的许可树的一部分而不是整个权限树本身，从而消除或显着减少到缓存的权限树的访问时间 。