专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20050177543A1 Efficient XML schema validation of XML fragments using annotated automaton encoding 失效
标题翻译：使用注释自动机编码的XML片段的高效XML模式验证
公开(公告)号：US20050177543A1
公开(公告)日：2005-08-11
申请号：US10774594
申请日：2004-02-10
申请人： Yao-Ching Chen , Fen-Ling Lin , Ning Wang , Guogen Zhang
发明人： Yao-Ching Chen , Fen-Ling Lin , Ning Wang , Guogen Zhang
IPC分类号： G06F7/00 , G06F17/22 , G06F17/27
CPC分类号： G06F17/2725 , G06F17/2229 , G06F17/2247 , Y10S707/99942 , Y10S707/99943
摘要： A method and system for Extensible Markup Language (XML) schema validation, includes: loading an XML document into a runtime validation engine, where the runtime validation engine includes an XML schema validation parser; loading an annotated automaton encoding (AAE) for an XML schema definition into the XML schema validation parser; and validating the XML document against the XML schema definition by the XML schema validation parser utilizing the annotated automaton encoding. Each XML schema definition is compiled once into the AAE format, rather than being compiled each time an XML document is validated, and thus significant time is saved. The code for the runtime validation engine is fixed and does not vary depending on the XML schema definition, rather than varying for each XML schema definition, and thus space overhead is minimized. Flexibility in the validation process is provided without compromising performance.
摘要翻译：可扩展标记语言（XML）模式验证的方法和系统包括：将XML文档加载到运行时验证引擎中，运行时验证引擎包含XML模式验证解析器; 将用于XML模式定义的带注释的自动机编码（AAE）加载到XML模式验证解析器中; 并通过使用带注释的自动机编码的XML模式验证解析器根据XML模式定义验证XML文档。每个XML模式定义都被编译为AAE格式，而不是每次验证XML文档时被编译，因此节省了大量的时间。运行时验证引擎的代码是固定的，并且不会根据XML模式定义而变化，而不是因为每个XML模式定义而变化，因此空间开销最小化。提供验证过程中的灵活性，而不会影响性能。

2. 发明申请

US20070043743A1 Packing nodes into records to store XML XQuery data model and other hierarchically structured data 失效
标题翻译：将节点包装到记录中以存储XML XQuery数据模型和其他分层结构化数据
公开(公告)号：US20070043743A1
公开(公告)日：2007-02-22
申请号：US11209997
申请日：2005-08-22
申请人： Yao-Ching Chen , Yue Huang , Fen-Ling Lin , Brian Tran , Guogen Zhang
发明人： Yao-Ching Chen , Yue Huang , Fen-Ling Lin , Brian Tran , Guogen Zhang
IPC分类号： G06F7/00
CPC分类号： G06F17/30917 , G06F17/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.
摘要翻译：分级结构化数据节点的存储使用逻辑节点标识符来引用存储在记录数据结构内和跨记录数据结构的节点。节点标识符索引用于将每个逻辑节点标识符映射到包含节点的记录的记录标识符。当子树存储在单独的记录中时，代理节点用于表示父记录中的子树。节点标识符索引中的映射反映了子树节点在单独记录中的存储。由于记录之间的引用是通过逻辑节点标识符，只要索引被更新或重建以维持与所得到的数据页的同步，就不限于跨页面的记录移动。这种方法具有高度可扩展性，并且比使用节点之间的明确引用的方法具有更小的存储消耗。

3. 发明申请

US20070043751A1 Scalable storage schemes for native XML column data of relational tables 有权
标题翻译：关系表的本机XML列数据的可扩展存储方案
公开(公告)号：US20070043751A1
公开(公告)日：2007-02-22
申请号：US11209598
申请日：2005-08-22
申请人： Yao-Ching Chen , Fen-Ling Lin , Jerry Mukai , Kalpana Shyam , James Teng , Guogen Zhang
发明人： Yao-Ching Chen , Fen-Ling Lin , Jerry Mukai , Kalpana Shyam , James Teng , Guogen Zhang
IPC分类号： G06F7/00
CPC分类号： G06F17/30595 , G06F17/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）列的实际数据被存储在单独的数据表中，并且每个数据表具有单独的节点标识符索引。使用包含文档标识符的密钥搜索节点标识符索引，并且使用逻辑节点标识符，并且检索包含分配有逻辑节点标识符的节点的数据表中的记录的记录标识符。

4. 发明申请

US20050027690A1 Dynamic selection of optimal grouping sequence at runtime for grouping sets, rollup and cube operations in SQL query processing 审中-公开
标题翻译：运行时动态选择最佳分组序列，以便在SQL查询处理中进行分组，汇总和多维数据集操作
公开(公告)号：US20050027690A1
公开(公告)日：2005-02-03
申请号：US10629459
申请日：2003-07-29
申请人： Guogen Zhang , Fen-Ling Lin , Jung-Hsin Hu , Yao-Ching Chen , Yun Wang , Glenn Yuki
发明人： Guogen Zhang , Fen-Ling Lin , Jung-Hsin Hu , Yao-Ching Chen , Yun Wang , Glenn Yuki
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F16/24537
摘要： A method, apparatus, and article of manufacture for optimizing a query in a computer system. During compilation of the query, a GROUP BY clause with one or more GROUPING SETS, ROLLUP or CUBE operations is maintained in its original form until after query rewrite. The GROUP BY clause with the GROUPING SETS, ROLLUP or CUBE operations is then translated into a plurality of levels having one or more grouping sets. After compilation of the query, a grouping sets sequence is dynamically determined for the GROUP BY clause with the GROUPING SETS, ROLLUP or CUBE operations based on intermediate grouping sets, in order to optimize the grouping sets sequence. The execution of the grouping sets sequence is optimized by selecting a smallest grouping set from a previous one of the levels as an input to a grouping set on a next one of the levels. Finally, a UNION ALL operation is performed on the grouping sets.
摘要翻译：一种用于优化计算机系统中的查询的方法，装置和制品。在编译查询期间，具有一个或多个GROUPING SETS，ROLLUP或CUBE操作的GROUP BY子句将保持其原始格式，直到查询重写为止。然后将具有GROUPING SETS，ROLLUP或CUBE操作的GROUP BY子句转换为具有一个或多个分组集合的多个级别。在编译查询之后，基于中间分组集合的GROUP BY子句动态确定分组集序列，并使用GROUPING GROUP，ROLLUP或CUBE操作，以优化分组集序列。通过从先前的一个级别中选择最小的分组集作为在下一个级别上的分组集合的输入来优化分组集序列的执行。最后，对分组集执行UNION ALL操作。

5. 发明授权

US07657570B2 Optimizing aggregate processing 失效
标题翻译：优化聚合处理
公开(公告)号：US07657570B2
公开(公告)日：2010-02-02
申请号：US11738406
申请日：2007-04-20
申请人： Yun Wang , Fen-Ling Lin , Yao-Ching Chen , Mengchu Cai , Jason Alexander Cu , Allan Benjamin Lebovitz , Li-Mey Lee , Guogen Zhang
发明人： Yun Wang , Fen-Ling Lin , Yao-Ching Chen , Mengchu Cai , Jason Alexander Cu , Allan Benjamin Lebovitz , Li-Mey Lee , Guogen Zhang
IPC分类号： G06F17/00
CPC分类号： G06F17/30286 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99948
摘要： Disclosed is method for processing an aggregate function. Rows that contain a reference to intermediate result structures are grouped to form groups. For each group, aggregate element structures are formed from the intermediate result structures and, if the aggregate function specifies ordering, the aggregate element structures are sorted based on a sort key.
摘要翻译：公开了一种处理聚合函数的方法。包含对中间结果结构的引用的行被分组以形成组。对于每个组，从中间结果结构形成聚合元素结构，并且如果聚合函数指定排序，则基于排序关键字对聚合元素结构进行排序。

6. 发明授权

US07890479B2 Efficient XML schema validation of XML fragments using annotated automaton encoding 失效
标题翻译：使用注释自动机编码的XML片段的高效XML模式验证
公开(公告)号：US07890479B2
公开(公告)日：2011-02-15
申请号：US12197592
申请日：2008-08-25
申请人： Yao-Ching Stephen Chen , Fen-Ling Lin , Ning Wang , Guogen Zhang
发明人： Yao-Ching Stephen Chen , Fen-Ling Lin , Ning Wang , Guogen Zhang
IPC分类号： G06F17/30
CPC分类号： G06F17/2725 , G06F17/2229 , G06F17/2247 , Y10S707/99942 , Y10S707/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模式被编译成带注释的自动机编码，其包括用于结构信息的解析表和类型信息的注释。该表示扩展为包括从模式类型到解析表中的状态的映射。要根据模式类型验证片段，只需确定与模式类型相对应的状态，并从该状态启动验证过程。当进程返回到状态时，片段验证已经成功完成。这种方法比一般的树表示效率更高。只处理模式信息的数据表示，使得它比操纵解析器生成器生成的验证解析器代码容易得多。此外，文档和片段验证的模式信息只需要一个表示。这种方法还为更新后的增量验证提供了基础。

7. 发明授权

US07437374B2 Efficient XML schema validation of XML fragments using annotated automaton encoding 失效
标题翻译：使用注释自动机编码的XML片段的高效XML模式验证
公开(公告)号：US07437374B2
公开(公告)日：2008-10-14
申请号：US10774594
申请日：2004-02-10
申请人： Yao-Ching Stephen Chen , Fen-Ling Lin , Ning Wang , Guogen Zhang
发明人： Yao-Ching Stephen Chen , Fen-Ling Lin , Ning Wang , Guogen Zhang
IPC分类号： G06F17/30
CPC分类号： G06F17/2725 , G06F17/2229 , G06F17/2247 , Y10S707/99942 , Y10S707/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模式被编译成带注释的自动机编码，其包括用于结构信息的解析表和类型信息的注释。该表示扩展为包括从模式类型到解析表中的状态的映射。要根据模式类型验证片段，只需确定与模式类型相对应的状态，并从该状态启动验证过程。当进程返回到状态时，片段验证已经成功完成。这种方法比一般的树表示效率更高。只处理模式信息的数据表示，使得它比操纵解析器生成器生成的验证解析器代码容易得多。此外，文档和片段验证的模式信息只需要一个表示。这种方法还为更新后的增量验证提供了基础。

8. 发明申请

US20080313234A1 EFFICIENT XML SCHEMA VALIDATION OF XML FRAGMENTS USING ANNOTATED AUTOMATON ENCODING 失效
标题翻译：使用ANNOTATED AUTOMATON编码的XML片段的有效XML模式验证
公开(公告)号：US20080313234A1
公开(公告)日：2008-12-18
申请号：US12197592
申请日：2008-08-25
申请人： Yao-Ching Stephen CHEN , Fen-Ling Lin , Ning Wang , Guogen Zhang
发明人： Yao-Ching Stephen CHEN , Fen-Ling Lin , Ning Wang , Guogen Zhang
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/2725 , G06F17/2229 , G06F17/2247 , Y10S707/99942 , Y10S707/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. 发明申请

US20050177578A1 Efficient type annontation of XML schema-validated XML documents without schema validation 审中-公开
标题翻译： XML模式验证的XML文档的无效模式验证
公开(公告)号：US20050177578A1
公开(公告)日：2005-08-11
申请号：US10774584
申请日：2004-02-10
申请人： Yao-Ching Chen , Ning Wang , Guogen Zhang
发明人： Yao-Ching Chen , Ning Wang , Guogen Zhang
IPC分类号： G06F7/00
CPC分类号： G06F17/272 , G06F16/83 , G06F17/2247
摘要： Type annotation record information storage for annotated automaton encoding for high-performance XML schema validation is optimized in a space efficient aspect. Subsequent to type annotation record information organization, type annotation records are used for type annotation of validated XML documents, either by implementing annotation records and type annotation part of an algorithm only, or by skipping one or more validation steps in a full validation implementation. Given a schema context, a type annotation may be performed for a validated XML fragment as opposed to an entire document. In addition, default features such as attribute and type are supported.
摘要翻译：用于高性能XML模式验证的注释自动机编码的类型注释记录信息存储在空间有效的方面进行了优化。在类型注释记录信息组织之后，类型注释记录用于经验证的XML文档的类型注释，无论是通过实现注释记录和仅对算法类型注释部分，或者通过跳过完整验证实现中的一个或多个验证步骤。给定模式上下文，对于经过验证的XML片段，可以对整个文档执行类型注释。此外，还支持默认功能，如属性和类型。

10. 发明申请

US20070198479A1 Streaming XPath algorithm for XPath expressions with predicates 审中-公开
标题翻译：具有谓词的XPath表达式的流式XPath算法
公开(公告)号：US20070198479A1
公开(公告)日：2007-08-23
申请号：US11356366
申请日：2006-02-16
申请人： Mengchu Cai , Jason Cu , Fen-Ling Lin , Guogen Zhang , Qinghua Zou
发明人： Mengchu Cai , Jason Cu , Fen-Ling Lin , Guogen Zhang , Qinghua Zou
IPC分类号： G06F17/30
CPC分类号： G06F16/8373
摘要： A method and system for evaluating a path query are disclosed. The path query corresponds to a query tree including a plurality of query nodes. At least one query node corresponds to at least one predicate and is at a level. The predicate(s) are evaluated for previous query node(s). The method and system include scanning data nodes of a document and determining if the data nodes match the query nodes. The method and system also include placing data related to the data node in match stacks corresponding to matched query nodes. The data for the query node(s) include attribute(s) corresponding to the predicate(s). The method and system further include propagating a matching of the at least one query node backward to a matching of the at least one previous query node.
摘要翻译：公开了一种用于评估路径查询的方法和系统。路径查询对应于包括多个查询节点的查询树。至少一个查询节点对应于至少一个谓词并处于一个级别。对先前的查询节点评估谓词。该方法和系统包括扫描文档的数据节点并确定数据节点是否匹配查询节点。该方法和系统还包括将与数据节点相关的数据放置在与匹配查询节点相对应的匹配堆栈中。查询节点的数据包括对应于谓词的属性。所述方法和系统还包括将所述至少一个查询节点的匹配向后传播到所述至少一个先前查询节点的匹配。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式