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

1. 发明授权

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模式被编译成带注释的自动机编码，其包括用于结构信息的解析表和类型信息的注释。该表示扩展为包括从模式类型到解析表中的状态的映射。要根据模式类型验证片段，只需确定与模式类型相对应的状态，并从该状态启动验证过程。当进程返回到状态时，片段验证已经成功完成。这种方法比一般的树表示效率更高。只处理模式信息的数据表示，使得它比操纵解析器生成器生成的验证解析器代码容易得多。此外，文档和片段验证的模式信息只需要一个表示。这种方法还为更新后的增量验证提供了基础。

2. 发明授权

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模式被编译成带注释的自动机编码，其包括用于结构信息的解析表和类型信息的注释。该表示扩展为包括从模式类型到解析表中的状态的映射。要根据模式类型验证片段，只需确定与模式类型相对应的状态，并从该状态启动验证过程。当进程返回到状态时，片段验证已经成功完成。这种方法比一般的树表示效率更高。只处理模式信息的数据表示，使得它比操纵解析器生成器生成的验证解析器代码容易得多。此外，文档和片段验证的模式信息只需要一个表示。这种方法还为更新后的增量验证提供了基础。

3. 发明授权

US08572125B2 Scalable storage schemes for native XML column data of relational tables 有权
标题翻译：关系表的本机XML列数据的可扩展存储方案
公开(公告)号：US08572125B2
公开(公告)日：2013-10-29
申请号：US11209598
申请日：2005-08-22
申请人： Yao-Ching Stephen Chen , Fen-Ling Lin , Jerry Mukai , Kalpana Shyam , James Zu-Chia Teng , Guogen Zhang
发明人： Yao-Ching Stephen Chen , Fen-Ling Lin , Jerry Mukai , Kalpana Shyam , James Zu-Chia Teng , Guogen Zhang
IPC分类号： G06F17/30
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. 发明授权

US08543614B2 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 Chen , Yue Huang , Fen-Ling Lin , Brian Thinh-Vinh Tran , Guogen Zhang
发明人： Yao-Ching Stephen Chen , Yue Huang , Fen-Ling Lin , Brian Thinh-Vinh Tran , Guogen Zhang
IPC分类号： G06F17/30
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.
摘要翻译：分级结构化数据节点的存储使用逻辑节点标识符来引用存储在记录数据结构内和跨记录数据结构的节点。节点标识符索引用于将每个逻辑节点标识符映射到包含节点的记录的记录标识符。当子树存储在单独的记录中时，代理节点用于表示父记录中的子树。节点标识符索引中的映射反映了子树节点在单独记录中的存储。由于记录之间的引用是通过逻辑节点标识符，只要索引被更新或重建以维持与所得到的数据页的同步，就不限于跨页面的记录移动。这种方法具有高度可扩展性，并且比使用节点之间的明确引用的方法具有更小的存储消耗。

5. 发明授权

US07840552B2 Cost-based subquery correlation and decorrelation 有权
标题翻译：基于成本的子查询相关和去相关
公开(公告)号：US07840552B2
公开(公告)日：2010-11-23
申请号：US12104379
申请日：2008-04-16
申请人： Thomas Abel Beavin , Mengchu Cai , Yao-Ching Stephen Chen , Hsiuying Yen Cheng , Fen-Ling Lin , Irene Ching-Hua Liu , Jerry Mukai , Demai Ni , Yoichi Tsuji , Li Xia , Ying Zeng
发明人： Thomas Abel Beavin , Mengchu Cai , Yao-Ching Stephen Chen , Hsiuying Yen Cheng , Fen-Ling Lin , Irene Ching-Hua Liu , Jerry Mukai , Demai Ni , Yoichi Tsuji , Li Xia , Ying Zeng
IPC分类号： G06F17/30
CPC分类号： G06F17/30436 , G06F17/30442 , Y10S707/99933 , Y10S707/99934 , Y10S707/99943
摘要： Techniques are provided that determine that a query includes at least one subquery that may be correlated or decorrelated. An internal representation of the query that represents the subquery in both correlated and decorrelated form is generated, wherein the internal representation includes at least one virtual table.
摘要翻译：提供了确定查询包括至少一个可以相关或解相关的子查询的技术。生成表示相关和解相关形式的子查询的查询的内部表示，其中内部表示包括至少一个虚拟表。

6. 发明授权

US06385603B1 Joined table expression optimization by query transformation 有权
标题翻译：通过查询转换加入表表达式优化
公开(公告)号：US06385603B1
公开(公告)日：2002-05-07
申请号：US09332544
申请日：1999-06-14
申请人： Yao-Ching Stephen Chen , Fen-Ling Lin , Jerry Mukai , Hong Tie , Yun Wang
发明人： Yao-Ching Stephen Chen , Fen-Ling Lin , Jerry Mukai , Hong Tie , Yun Wang
IPC分类号： G06F1730
CPC分类号： G06F17/30466 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： A query optimizer analyzes a query and triggers a sequence of transformations to achieve optimal performance for joined table expressions. The transformations include pushing down predicates for joined table expressions and pushing down non-null predicates to simplify join operators for joined table expressions.
摘要翻译：查询优化器分析查询并触发一系列转换，以实现连接表表达式的最佳性能。转换包括按下联合表表达式的谓词并按下非空谓词来简化连接表表达式的连接运算符。

7. 发明授权

US07376646B2 Cost-based subquery correlation and decorrelation 失效
标题翻译：基于成本的子查询相关和去相关
公开(公告)号：US07376646B2
公开(公告)日：2008-05-20
申请号：US11156500
申请日：2005-06-17
申请人： Thomas Abel Beavin , Mengchu Cai , Yao-Ching Stephen Chen , Hsiuying Yen Cheng , Fen-Ling Lin , Irene Ching-Hua Liu , Jerry Mukai , Demai Ni , Yoichi Tsuji , Li Xia , Ying Zeng
发明人： Thomas Abel Beavin , Mengchu Cai , Yao-Ching Stephen Chen , Hsiuying Yen Cheng , Fen-Ling Lin , Irene Ching-Hua Liu , Jerry Mukai , Demai Ni , Yoichi Tsuji , Li Xia , Ying Zeng
IPC分类号： G06F17/30
CPC分类号： G06F17/30436 , G06F17/30442 , Y10S707/99933 , Y10S707/99934 , Y10S707/99943
摘要： Techniques are provided that determine that a query includes at least one subquery that may be correlated or decorrelated. An internal representation of the query that represents the subquery in both correlated and decorrelated form is generated, wherein the internal representation includes at least one virtual table.
摘要翻译：提供了确定查询包括至少一个可以相关或解相关的子查询的技术。生成表示相关和解相关形式的子查询的查询的内部表示，其中内部表示包括至少一个虚拟表。

8. 发明授权

US06421663B1 Optimization of joined table expressions by extended access path selection 有权
标题翻译：通过扩展访问路径选择优化连接表表达式
公开(公告)号：US06421663B1
公开(公告)日：2002-07-16
申请号：US09332600
申请日：1999-06-14
申请人： Yao-Ching Stephen Chen , Fen-Ling Lin , Jerry Mukai , Hong Tie , Yun Wang
发明人： Yao-Ching Stephen Chen , Fen-Ling Lin , Jerry Mukai , Hong Tie , Yun Wang
IPC分类号： G06F1730
CPC分类号： G06F17/30436 , G06F17/30466 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： A method, apparatus, and article of manufacture for analyzing a query and extending an access path selection for the query, in order to optimize joined table expressions and complex join operations in the query. The extension of the access path selection occurs in two phases: (1) an access path selection router analyzes and divides the query into portions, so that the overall access path selection is divided into smaller access path selections for processing by a join enumerator; and (2) the join enumerator is provided to handle joined table expressions and complex join operators, wherein the join enumerator can be continuously enhanced as more powerful query optimization techniques become available.
摘要翻译：一种用于分析查询并扩展查询的访问路径选择的方法，装置和制品，以便优化查询中的连接表表达式和复杂连接操作。访问路径选择的扩展分为两个阶段：（1）访问路径选择路由器分析并将查询划分为多个部分，使得整体访问路径选择被分为较小的访问路径选择以供联合枚举器处理; 和（2）提供连接枚举器来处理连接的表表达式和复杂的连接运算符，其中当更强大的查询优化技术变得可用时，连接枚举器可以不断地增强。

9. 发明授权

US07346609B2 Streaming XPath algorithm for XPath value index key generation 失效
标题翻译：用于XPath值索引密钥生成的流XPath算法
公开(公告)号：US07346609B2
公开(公告)日：2008-03-18
申请号：US10990834
申请日：2004-11-16
申请人： Yao-Ching Stephen Chen , Irene Ching-Hua Liu , Demai Ni , Guogen Zhang , Qinghua Zou
发明人： Yao-Ching Stephen Chen , Irene Ching-Hua Liu , Demai Ni , Guogen Zhang , Qinghua Zou
IPC分类号： G06F17/30
CPC分类号： G06F17/30595 , Y10S707/99932 , Y10S707/99933 , Y10S707/99936
摘要： A method generates hierarchical path index keys for single and multiple indexes with one scan of a document. Each data node of the document is scanned and matches to query nodes are identified. A data node matches a query node if the three conditions hold: if it is not the root step, there is a match for the query node in the previous step of the query; the data node matches the query node of the current step; and the edges of the data and query nodes match. A sub-tree of a data node can be skipped if the data node is not matched and its level is less than the fixed levels of the query. The matched data node is then placed in the match stacks corresponding to the match query nodes. The method uses transitivity properties among matching units to reduce the number of states that need to be tracked and to improve the evaluation of path expressions significantly.
摘要翻译：一种方法是通过文档的一次扫描为单索引和多索引生成分层路径索引键。对文档的每个数据节点进行扫描，并与查询节点进行匹配。如果三个条件成立，则数据节点与查询节点相匹配：如果不是根步骤，则查询前一步骤中的查询节点匹配; 数据节点匹配当前步骤的查询节点; 数据和查询节点的边缘匹配。如果数据节点不匹配且其级别小于查询的固定级别，则可以跳过数据节点的子树。然后将匹配的数据节点放置在与匹配查询节点相对应的匹配堆栈中。该方法使用匹配单位之间的传递属性来减少需要跟踪的状态数量，并显着提高路径表达式的评估。

10. 发明授权

US07246115B2 Materialized view signature and efficient identification of materialized view candidates for queries 失效
标题翻译：物化视图签名和有效识别用于查询的物化视图候选
公开(公告)号：US07246115B2
公开(公告)日：2007-07-17
申请号：US10324800
申请日：2002-12-19
申请人： Guogen Zhang , Irene Ching-Hua Liu , Ding-Wei Chieh , Lee-Chin Hsu Liu , Yao-Ching Stephen Chen , Hsuiying Yen Cheng , Brian Thinh-Vinh Tran , Yun Wang , Ruiping Li
发明人： Guogen Zhang , Irene Ching-Hua Liu , Ding-Wei Chieh , Lee-Chin Hsu Liu , Yao-Ching Stephen Chen , Hsuiying Yen Cheng , Brian Thinh-Vinh Tran , Yun Wang , Ruiping Li
IPC分类号： G06F17/30
CPC分类号： G06F17/30457 , Y10S707/99933 , Y10S707/99934 , Y10S707/99942 , Y10S707/99943
摘要： A method and system for efficiently identifying materialized view candidates for queries filters materialized views using certain criteria, using the materialized view signatures. This filtering rejects some of the unqualified materialized views prior to the performance of the query rewrite matching algorithm, resulting in a group of materialized view candidates. The query rewrite matching algorithm is then performed on the materialized view candidates. By first filtering the materialized views based on their signatures, the number of materialized views on which the query rewrite matching algorithm is performed is significantly reduced, improving performance.
摘要翻译：用于有效地识别用于查询的物化视图候选的方法和系统使用特定的视图签名使用特定标准过滤物化视图。该过滤在执行查询重写匹配算法之前拒绝一些不合格的物化视图，导致一组物化视图候选。然后对物化视图候选进行查询重写匹配算法。通过首先根据其签名过滤物化视图，大大减少了执行查询重写匹配算法的物化视图数量，从而提高了性能。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式