会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 6. 发明申请
    • Transient Range Versioning Based on Redirection
    • 基于重定向的瞬态范围版本控制
    • US20060075000A1
    • 2006-04-06
    • US10711808
    • 2004-10-06
    • James KleeweinEdison Ting
    • James KleeweinEdison Ting
    • G06F17/30
    • G06F17/30309
    • A mechanism is described for transient versioning in architectures that manage node ranges, wherein each node is assigned a node ID value and a set of nodes form a range of node IDs called a node range. Each entry in the index describes one range and points to where the range is located. Individual nodes are located by finding the correct range in the index. When nodes are added to or deleted from a node range, the range of nodes are versioned by copying the nodes before changes, to transient storage, and then the original nodes are modified. Different versions are tracked by assigning timestamps to each copy of the node range. Each entry in the node ID range index points to the location of the nodes in a range called the range identifier or RID. Before changes are made in a range, the nodes in a range are copied to a Version Hash Table based on the RID. Copies of the range including the current one is assigned a timestamp or LSN. New readers after a change, access the current nodes through RID, while old readers access the old nodes through the same RID, but hashing it to find the shadowed copy in the Version Hash Table. If changes causes nodes in the range to be moved to a new RID, previous readers need to be redirected from the new RID to the old RID.
    • 描述了用于管理节点范围的架构中的瞬态版本化的机制,其中每个节点被分配有节点ID值,并且一组节点形成称为节点范围的节点ID的范围。 索引中的每个条目都描述一个范围,并指出范围所在的位置。 通过在索引中找到正确的范围来定位各个节点。 当节点被添加到或从节点范围中删除时,节点的范围通过将更改之前的节点复制到临时存储,然后修改原始节点进行版本控制。 通过为节点范围的每个副本分配时间戳来跟踪不同的版本。 节点ID范围索引中的每个条目指向称为范围标识符或RID的范围内的节点的位置。 在范围内进行更改之前,将范围内的节点根据RID复制到版本散列表中。 分配包括当前范围的范围的副本被分配了时间戳或LSN。 新读者在更改后,通过RID访问当前节点,而旧读者通过相同的RID访问旧节点,但是可以在“版本哈希表”中查找阴影副本。 如果更改导致该范围内的节点移动到新的RID,则以前的读者需要从新的RID重定向到旧的RID。
    • 7. 发明申请
    • Use of pseudo keys in node ID range based storage architecture
    • 在基于节点ID范围的存储架构中使用伪密钥
    • US20060004791A1
    • 2006-01-05
    • US10870923
    • 2004-06-21
    • James KleeweinEdison Ting
    • James KleeweinEdison Ting
    • G06F17/00
    • G06F16/9027
    • A method of computing pseudo keys facilitates the bounding of node ID ranges. Pseudo keys are computed to facilitate node location in node ID ranges that have been split. A pseudo previous high key is computed by decrementing the last digit of the lowest node ID value in a newly formed node ID range by one and by appending ‘x’.‘x’. A computed pseudo key has no previous siblings or descendants of previous sibling having a node ID higher in value than a computed pseudo previous high key. Pseudo keys are also computed to define boundaries of a sub-tree. The range determined by a pseudo previous high key for a highest valued root node and a pseudo sub-tree high key bounds a sub-tree. Sub-tree pseudo keys are also comprised of a pseudo sub-tree low key and a pseudo end of document key.
    • 计算伪密钥的方法有助于节点ID范围的界限。 计算伪密钥以便于已经拆分的节点ID范围内的节点位置。 通过将新形成的节点ID范围中的最低节点ID值的最后一位递减1并通过追加“x”。x'来计算伪先前高密钥。 计算的伪密钥没有先前兄弟姐妹的先前兄弟姐妹或后代,其节点ID的值高于计算的伪先前高密钥。 还计算伪密钥以定义子树的边界。 由用于最高值根节点的伪先前高密钥确定的范围和伪子树高密钥限制子树。 子树伪密钥也由伪子树低密钥和文档密钥的伪尾组成。