会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Packing nodes into records to store XML XQuery data model and other hierarchically structured data
    • 将节点包装到记录中以存储XML XQuery数据模型和其他分层结构化数据
    • US08543614B2
    • 2013-09-24
    • US11209997
    • 2005-08-22
    • Yao-Ching Stephen ChenYue HuangFen-Ling LinBrian Thinh-Vinh TranGuogen Zhang
    • Yao-Ching Stephen ChenYue HuangFen-Ling LinBrian Thinh-Vinh TranGuogen Zhang
    • G06F17/30
    • G06F17/30917G06F17/30911
    • A storage of nodes of hierarchically structured data uses logical node identifiers to reference the nodes stored within and across record data structures. A node identifier index is used to map each logical node identifier to a record identifier for the record that contains the node. When a sub-tree is stored in a separate record, a proxy node is used to represent the sub-tree in the parent record. The mapping in the node identifier index reflects the storage of the sub-tree nodes in the separate record. Since the references between the records are through logical node identifiers, there is no limitation to the moving of records across pages, as long as the indices are updated or rebuilt to maintain synchronization with the resulting data pages. This approach is highly scalable and has a much smaller storage consumption than approaches that use explicit references between nodes.
    • 分级结构化数据节点的存储使用逻辑节点标识符来引用存储在记录数据结构内和跨记录数据结构的节点。 节点标识符索引用于将每个逻辑节点标识符映射到包含节点的记录的记录标识符。 当子树存储在单独的记录中时,代理节点用于表示父记录中的子树。 节点标识符索引中的映射反映了子树节点在单独记录中的存储。 由于记录之间的引用是通过逻辑节点标识符,只要索引被更新或重建以维持与所得到的数据页的同步,就不限于跨页面的记录移动。 这种方法具有高度可扩展性,并且比使用节点之间的明确引用的方法具有更小的存储消耗。
    • 4. 发明授权
    • Self-adaptive prefix encoding for stable node identifiers
    • 用于稳定节点标识符的自适应前缀编码
    • US07937413B2
    • 2011-05-03
    • US10709415
    • 2004-05-04
    • Brian Thinh-Vinh TranGuogen Zhang
    • Brian Thinh-Vinh TranGuogen Zhang
    • G06F17/30
    • G06F17/30908
    • A variable-length binary string is utilized to encode node identifiers in a tree for an XML document object model. A general prefix encoding scheme is followed; a node identifier is generated by the concatenation of encodings at each level of a tree along a path from a root node to another particular node. Arbitrary insertions are supported without change to existing node identifier encodings. In addition, the method provides for document order when unsigned binary string comparison is used to compare encoded node identifiers. In support of sub-document concurrency control, prefix encoding provides a way to derive ancestor-descendant relationships among nodes in a tree. Lastly, the encoding method provides a natural pre-order clustering sequence, also known as depth-first clustering. If a prefix is applied to an encoding with a level number, starting with zero at the root, width-first clustering will result. A mixed clustering can also be supported.
    • 使用可变长度的二进制字符串来编码用于XML文档对象模型的树中的节点标识符。 遵循一般的前缀编码方案; 通过沿着从根节点到另一个特定节点的路径的树的每个级别的编码的级联来生成节点标识符。 支持任意插入,而不改变现有的节点标识符编码。 此外,当使用无符号二进制字符串比较来比较编码节点标识符时,该方法提供了文档顺序。 为了支持子文档并发控制,前缀编码提供了一种在树中节点之间派生祖先 - 后代关系的方法。 最后,编码方法提供了一种自然的预购聚类序列,也称为深度优先聚类。 如果将前缀应用于具有级号的编码,则从根开始为零,将导致宽度优先聚类。 也可以支持混合群集。