会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 13. 发明申请
    • PERSISTENT ITERATION OVER A DATABASE TREE STRUCTURE
    • 数据库树结构中的一致性迭代
    • US20130325902A1
    • 2013-12-05
    • US13489390
    • 2012-06-05
    • Yariv BACHARAviv KUVENTAsaf LEVY
    • Yariv BACHARAviv KUVENTAsaf LEVY
    • G06F7/00G06F17/30
    • G06F17/30961
    • Persistent iteration is performed in stages on nodes arranged according to a node identification (ID) that is increasing in order under a parent node in database tree structure. While performing the persistent iteration, storing a start node ID of the node where the persistent iteration commenced, a current node ID of the node that is undergoing the persistent iteration, a parent node ID of the node that is undergoing the persistent iteration, and a numerical value representing the current level and all levels greater than the current level of nodes that are undergoing the persistent iteration. Upon completion of the persistent iteration on the nodes that are the children of the node with the parent node ID, returning to the first node among the children of the node with the parent node ID, as ordered by increasing node ID, and performing the persistent iteration for children nodes of each node.
    • 在根据在数据库树结构中的父节点处按顺序增加的节点标识(ID)排列的节点上分阶段执行持续迭代。 在执行持续迭代时,存储持续迭代开始的节点的起始节点ID,正在经历持续迭代的节点的当前节点ID,正在经历持续迭代的节点的父节点ID,以及 表示当前级别的数值,并且所有级别大于正在进行持续迭代的当前节点级别。 在作为具有父节点ID的节点的子节点的节点上完成持续迭代时,返回到具有父节点ID的节点的子节点中的第一节点,按照增加节点ID的顺序,并执行持久性 每个节点的子节点的迭代。
    • 15. 发明申请
    • DEDUPLICATED DATA PROCESSING CONGESTION CONTROL
    • 重复数据处理控制
    • US20110273982A1
    • 2011-11-10
    • US12773136
    • 2010-05-04
    • Shay H. AKIRAVYariv BACHARAsaf LEVYEhud MEIRI
    • Shay H. AKIRAVYariv BACHARAsaf LEVYEhud MEIRI
    • H04L12/56
    • H04L47/122G06F17/30943H04L67/1095H04L67/1097
    • Various embodiments for deduplicated data processing congestion control in a computing environment are provided. In one such embodiment, a single congestion metric is determined from a sampling of a plurality of combined deduplicated data processing congestion statistics in a number of active deduplicated data processes. The congestion limit is calculated from a comparison of the single congestion metric to a congestion target setpoint, the congestion target setpoint being a virtual dimension setpoint and the congestion limit being a manipulated variable. The number of active deduplicated data processes is compared to the congestion limit. If the number of active deduplicated data processes is less than the congestion limit, a new deduplicated data process is spawned.
    • 提供了在计算环境中用于重复数据删除的数据处理拥塞控制的各种实施例。 在一个这样的实施例中,从多个主动去重复数据处理的多个组合的重复数据删除的数据处理拥塞统计的采样中确定单个拥塞度量。 从单个拥塞度量与拥塞目标设定点的比较计算拥塞限制,拥挤目标设定点是虚拟维度设定点,拥挤限制是操纵变量。 将活动重复数据消除的数据流程的数量与拥塞限制进行比较。 如果活动重复数据删除的数据流程数量小于拥塞限制,则会产生一个新的重复数据删除数据流程。