会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Scalable storage schemes for native XML column data of relational tables
    • 关系表的本机XML列数据的可扩展存储方案
    • US08572125B2
    • 2013-10-29
    • US11209598
    • 2005-08-22
    • Yao-Ching Stephen ChenFen-Ling LinJerry MukaiKalpana ShyamJames Zu-Chia TengGuogen Zhang
    • Yao-Ching Stephen ChenFen-Ling LinJerry MukaiKalpana ShyamJames Zu-Chia TengGuogen Zhang
    • G06F17/30
    • G06F17/30595G06F17/30923
    • A method and system for providing a scalable storage scheme for native hierarchically structured data of relational tables, includes a base table with indicator columns with information pertaining to hierarchically structured data of a document, data tables for storing the hierarchically structured data corresponding to the indicator columns, and node identifier indexes corresponding to the data tables for mapping between the indicator columns and the hierarchically structured data in the data tables. In an embodiment, actual data for each hierarchically structured data (such as XML) column is stored in a separate data table, and each data table has a separate node identifier index. The node identifier index is searched with a key containing the document identifier and a logical node identifier is used, and a record identifier of a record in the data table containing the node assigned the logical node identifier is retrieved.
    • 提供用于关系表的本机分层结构化数据的可伸缩存储方案的方法和系统包括具有与文档的分层结构化数据有关的信息的指示符列的基表,用于存储对应于指示符列的分层结构化数据的数据表 ,以及与数据表对应的节点标识符索引,用于在指标列与数据表中的分层结构化数据之间进行映射。 在一个实施例中,每个分级结构化数据(例如XML)列的实际数据被存储在单独的数据表中,并且每个数据表具有单独的节点标识符索引。 使用包含文档标识符的密钥搜索节点标识符索引,并且使用逻辑节点标识符,并且检索包含分配有逻辑节点标识符的节点的数据表中的记录的记录标识符。
    • 8. 发明授权
    • Efficient XML schema validation of XML fragments using annotated automaton encoding
    • 使用注释自动机编码的XML片段的高效XML模式验证
    • US07437374B2
    • 2008-10-14
    • US10774594
    • 2004-02-10
    • Yao-Ching Stephen ChenFen-Ling LinNing WangGuogen Zhang
    • Yao-Ching Stephen ChenFen-Ling LinNing WangGuogen Zhang
    • G06F17/30
    • G06F17/2725G06F17/2229G06F17/2247Y10S707/99942Y10S707/99943
    • An XML schema is compiled into an annotated automaton encoding, which includes a parsing table for structural information and annotation for type information. The representation is extended to include a mapping from schema types to states in a parsing table. To validate a fragment against a schema type, it is necessary simply to determine the state corresponding to the schema type, and start the validation process from that state. When the process returns to the state, fragment validation has reached successful completion. This approach is more efficient than a general tree representation. Only the data representation of the schema information is handled, making it much easier than manipulating validation parser code generated by a parser generator. In addition, only one representation is needed for schema information for both document and fragment validation. This approach also provides a basis for incremental validation after update.
    • XML模式被编译成带注释的自动机编码,其包括用于结构信息的解析表和类型信息的注释。 该表示扩展为包括从模式类型到解析表中的状态的映射。 要根据模式类型验证片段,只需确定与模式类型相对应的状态,并从该状态启动验证过程。 当进程返回到状态时,片段验证已经成功完成。 这种方法比一般的树表示效率更高。 只处理模式信息的数据表示,使得它比操纵解析器生成器生成的验证解析器代码容易得多。 此外,文档和片段验证的模式信息只需要一个表示。 这种方法还为更新后的增量验证提供了基础。
    • 9. 发明授权
    • Efficient XML schema validation of XML fragments using annotated automaton encoding
    • 使用注释自动机编码的XML片段的高效XML模式验证
    • US07890479B2
    • 2011-02-15
    • US12197592
    • 2008-08-25
    • Yao-Ching Stephen ChenFen-Ling LinNing WangGuogen Zhang
    • Yao-Ching Stephen ChenFen-Ling LinNing WangGuogen Zhang
    • G06F17/30
    • G06F17/2725G06F17/2229G06F17/2247Y10S707/99942Y10S707/99943
    • An XML schema is compiled into an annotated automaton encoding, which includes a parsing table for structural information and annotation for type information. The representation is extended to include a mapping from schema types to states in a parsing table. To validate a fragment against a schema type, it is necessary simply to determine the state corresponding to the schema type, and start the validation process from that state. When the process returns to the state, fragment validation has reached successful completion. This approach is more efficient than a general tree representation. Only the data representation of the schema information is handled, making it much easier than manipulating validation parser code generated by a parser generator. In addition, only one representation is needed for schema information for both document and fragment validation. This approach also provides a basis for incremental validation after update.
    • XML模式被编译成带注释的自动机编码,其包括用于结构信息的解析表和类型信息的注释。 该表示扩展为包括从模式类型到解析表中的状态的映射。 要根据模式类型验证片段,只需确定与模式类型相对应的状态,并从该状态启动验证过程。 当进程返回到状态时,片段验证已经成功完成。 这种方法比一般的树表示效率更高。 只处理模式信息的数据表示,使得它比操纵解析器生成器生成的验证解析器代码容易得多。 此外,文档和片段验证的模式信息只需要一个表示。 这种方法还为更新后的增量验证提供了基础。
    • 10. 发明授权
    • 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.
    • 分级结构化数据节点的存储使用逻辑节点标识符来引用存储在记录数据结构内和跨记录数据结构的节点。 节点标识符索引用于将每个逻辑节点标识符映射到包含节点的记录的记录标识符。 当子树存储在单独的记录中时,代理节点用于表示父记录中的子树。 节点标识符索引中的映射反映了子树节点在单独记录中的存储。 由于记录之间的引用是通过逻辑节点标识符,只要索引被更新或重建以维持与所得到的数据页的同步,就不限于跨页面的记录移动。 这种方法具有高度可扩展性,并且比使用节点之间的明确引用的方法具有更小的存储消耗。