会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明申请
    • SYSTEMS AND METHODS FOR HIERARCHICAL REFERENCE COUNTING VIA SIBLING TREES
    • 用于通过记录纸进行分层参考计数的系统和方法
    • US20140156601A1
    • 2014-06-05
    • US14085656
    • 2013-11-20
    • NetApp, Inc.
    • John StrunkDouglas SantrySriram VenketaramanVaijayanti Bharadwaj
    • G06F3/06G06F17/30
    • G06F3/0641G06F3/0619G06F3/067G06F17/30088G06F17/30094
    • Systems and methods for hierarchical reference counting via sibling trees are provided. The hierarchical data structure, together with its associated operations, can efficiently maintain reference counts and significantly reduce input/output (IO) operations compared to traditional techniques. The data structure presented here is applicable to any directed acyclic graph (DAG-type) structure where reference counts are used. Various embodiments of the present invention use a data structure to maintain a “sibling pointer” (pointing to the sibling node as a way to avoid reference count updates) and a “sibling count.” When nodes in the tree diverge, the sibling pointer and sibling count are updated as opposed to directly manipulating the reference counts of the children of the diverging nodes. Various other embodiments can use additional entries or fields that allow for improved efficiency and advantages.
    • 提供了通过兄弟树分级引用计数的系统和方法。 与传统技术相比,层次数据结构及其相关操作可以有效地保持参考计数并显着降低输入/输出(IO)操作。 这里呈现的数据结构适用于使用参考计数的任何有向无环图(DAG型)结构。 本发明的各种实施例使用数据结构来保持“同级指针”(指向同级节点作为避免参考计数更新的方式)和“兄弟数量”。当树中的节点发散时,兄弟节点指针和 兄弟姐妹计数被更新,而不是直接操纵分歧节点的孩子的参考计数。 各种其他实施例可以使用允许提高效率和优点的附加条目或字段。