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

1. 发明申请

US20140019422A1 ENCODED DATA PROCESSING 有权
标题翻译：编码数据处理
公开(公告)号：US20140019422A1
公开(公告)日：2014-01-16
申请号：US13617614
申请日：2012-09-14
申请人： Hubertus Franke , Balakrishna R. Iyer , Hong Min , Terence P. Purcell , Guogen Zhang
发明人： Hubertus Franke , Balakrishna R. Iyer , Hong Min , Terence P. Purcell , Guogen Zhang
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30286 , G06F17/30076 , G06F17/30339 , H03M7/30
摘要： Techniques are provided for encoded data processing which allows for continuous data processing as encoded data changes. Data is decomposed into one or more blocks with each block containing at least one data record. At least one data record within a given block is encoded with a first encoding process selected from one or more encoding processes. The first encoding process is associated with the given data block. Techniques evaluate whether or not to implement an encoding change for a given block when updating a given data record in the given block. Responsive to the evaluation, the given block is re-encoded with a second encoding process. Responsive to the re-encoding, the association of the given block is updated. A map is formed to convert the given data record encoded with the first encoding process to the second encoding process so as to preserve comparative relationships of the given data record.
摘要翻译：为编码数据处理提供技术，其允许作为编码数据变化的连续数据处理。数据被分解为一个或多个块，每个块包含至少一个数据记录。使用从一个或多个编码过程中选择的第一编码过程对给定块内的至少一个数据记录进行编码。第一编码过程与给定的数据块相关联。技术评估在给定块中更新给定数据记录时是否实现给定块的编码更改。响应于评估，给定的块用第二编码过程重新编码。响应于重新编码，给定块的关联更新。形成地图以将用第一编码处理编码的给定数据记录转换为第二编码处理，以便保持给定数据记录的比较关系。

2. 发明授权

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）列的实际数据被存储在单独的数据表中，并且每个数据表具有单独的节点标识符索引。使用包含文档标识符的密钥搜索节点标识符索引，并且使用逻辑节点标识符，并且检索包含分配有逻辑节点标识符的节点的数据表中的记录的记录标识符。

3. 发明申请

US20120226693A1 DYNAMIC SELECTION OF OPTIMAL GROUPING SEQUENCE AT RUNTIME FOR GROUPING SETS, ROLLUP AND CUBE OPERATIONS IN SQL QUERY PROCESSING 审中-公开
标题翻译：在SQL查询处理中动态选择最佳分组序列，用于分组集合，滚动和CUBE操作
公开(公告)号：US20120226693A1
公开(公告)日：2012-09-06
申请号：US13443997
申请日：2012-04-11
申请人： Guogen Zhang , Fen-Ling Lin , Jung-Hsin Hu , Yao-Ching S. Chen , Yun Wang , Glenn M. Yuki
发明人： Guogen Zhang , Fen-Ling Lin , Jung-Hsin Hu , Yao-Ching S. Chen , Yun Wang , Glenn M. Yuki
IPC分类号： G06F17/30
CPC分类号： G06F17/30454
摘要： 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操作。

4. 发明授权

US07685214B2 Order-preserving encoding formats of floating-point decimal numbers for efficient value comparison 有权
标题翻译：浮点十进制数的订单保留编码格式，用于有效的价值比较
公开(公告)号：US07685214B2
公开(公告)日：2010-03-23
申请号：US11213551
申请日：2005-08-26
申请人： Yao-Ching Stephen Chen , Michael Frederic Cowlishaw , Christopher J. Crone , Fung Lee , Ronald Morton Smith, Sr. , Guogen Zhang , Qinghua Zou
发明人： Yao-Ching Stephen Chen , Michael Frederic Cowlishaw , Christopher J. Crone , Fung Lee , Ronald Morton Smith, Sr. , Guogen Zhang , Qinghua Zou
IPC分类号： G06F7/00 , G06F15/00 , G06F7/38 , H03M5/00
CPC分类号： G06F7/026 , G06F7/491 , G06F2207/4911 , G11B2020/1457 , H03M7/24
摘要： A method for conversion between a decimal floating-point number and an order-preserving format has been disclosed. The method encodes numbers in the decimal floating-point format into a format which preserves value ordering. This encoding allows for fast and direct string comparison of two values. Such an encoding provides normalized representations for decimal floating-point numbers and supports type-insensitive comparisons. Type-insensitive comparisons are often used in database management systems, where the data type is not specified for values to compare. In addition, the original decimal floating-point format can be recovered from the order-preserving format.
摘要翻译：已经公开了用于在十进制浮点数和订单保留格式之间进行转换的方法。该方法将十进制浮点格式的数字编码为保留值排序的格式。该编码允许对两个值进行快速和直接的字符串比较。这样的编码提供十进制浮点数的归一化表示，并且支持类型不敏感的比较。类型不敏感的比较通常用于数据库管理系统，其中数据类型未指定用于比较的值。另外，原始的十进制浮点格式可以从订单保留格式中恢复。

5. 发明申请

US20080313136A1 METHOD AND APPARATUS FOR PRODUCING UP-TO-DATE QUERY RESULTS FROM TABLES INCLUDING DATA FROM A DATA WAREHOUSE 审中-公开
标题翻译：用于从包括数据仓库中的数据的表生成日期查询结果的方法和装置
公开(公告)号：US20080313136A1
公开(公告)日：2008-12-18
申请号：US11848164
申请日：2007-08-30
申请人： Guogen ZHANG
发明人： Guogen ZHANG
IPC分类号： G06F17/30
CPC分类号： G06F16/24534
摘要： Methods, systems, and computer program products for answering a query to be executed on a database comprising a first table and a second table, and in which the second table includes data from the first table. In one implementation, the method includes refreshing the data in the second table with corresponding data in the first table at a first time, receiving a first query on the first table at a second time that is subsequent to the first time, rewriting the first query into a second query on the first table and a third query on the second table, and executing the second query and the third query respectively on the first table and the second table to generate results for the first query.
摘要翻译：用于回答要在包括第一表和第二表的数据库上执行的查询的方法，系统和计算机程序产品，并且其中第二表包括来自第一表的数据。在一个实现中，该方法包括在第一表中刷新第二表中的数据与第一表中的相应数据，在第一次之后的第二时间接收关于第一表的第一查询，重写第一查询在第一表和第二表上的第三查询中分别进行第二查询，并分别在第一表和第二表上执行第二查询和第三查询以生成第一查询的结果。

6. 发明授权

US07188098B2 Query transformation for union all view join queries using join predicates for pruning and distribution 有权
标题翻译：联合所有视图的查询转换使用连接谓词进行修剪和分发
公开(公告)号：US07188098B2
公开(公告)日：2007-03-06
申请号：US10669749
申请日：2003-09-24
申请人： Yao-Ching S. Chen , Ding-Wei L. Chieh , Huong T. Tran , Yumi K. Tsuji , Guogen Zhang
发明人： Yao-Ching S. Chen , Ding-Wei L. Chieh , Huong T. Tran , Yumi K. Tsuji , Guogen Zhang
IPC分类号： G06F7/00 , G06F17/00 , G06F17/30
CPC分类号： G06F17/30454 , Y10S707/99932 , Y10S707/99934 , Y10S707/99943
摘要： A method, apparatus, and article of manufacture for optimizing a query in a computer system, wherein the query is performed by the computer system to retrieve data from a database stored on the computer system. The optimization includes: (a) combining join predicates from a query with local predicates from each branch of one or more UNION ALL views referenced by the query; (b) analyzing the combined predicates; and (c) not generating the join when the analysis step indicates that the combined predicates lead to an empty result.
摘要翻译：一种用于优化计算机系统中的查询的方法，装置和制品，其中所述查询由所述计算机系统执行以从存储在所述计算机系统上的数据库中检索数据。优化包括：（a）将来自查询的连接谓词与来自查询引用的一个或多个UNION ALL视图的每个分支的本地谓词组合; （b）分析合并谓词; 和（c）当分析步骤指示组合的谓词导致空的结果时，不产生连接。

7. 发明申请

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）列的实际数据被存储在单独的数据表中，并且每个数据表具有单独的节点标识符索引。使用包含文档标识符的密钥搜索节点标识符索引，并且使用逻辑节点标识符，并且检索包含分配有逻辑节点标识符的节点的数据表中的记录的记录标识符。

8. 发明申请

US20050065926A1 Query transformation for union all view join queries using join predicates for pruning and distribution 有权
标题翻译：联合所有视图的查询转换使用连接谓词进行修剪和分发
公开(公告)号：US20050065926A1
公开(公告)日：2005-03-24
申请号：US10669749
申请日：2003-09-24
申请人： Yao-Ching Chen , Ding-Wei Chieh , Huong Tran , Yumi Tsuji , Guogen Zhang
发明人： Yao-Ching Chen , Ding-Wei Chieh , Huong Tran , Yumi Tsuji , Guogen Zhang
IPC分类号： G06F17/30
CPC分类号： G06F17/30454 , Y10S707/99932 , Y10S707/99934 , Y10S707/99943
摘要： A method, apparatus, and article of manufacture for optimizing a query in a computer system, wherein the query is performed by the computer system to retrieve data from a database stored on the computer system. The optimization includes: (a) combining join predicates from a query with local predicates from each branch of one or more UNION ALL views referenced by the query; (b) analyzing the combined predicates; and (c) not generating the join when the analysis step indicates that the combined predicates lead to an empty result.
摘要翻译：一种用于优化计算机系统中的查询的方法，装置和制品，其中所述查询由所述计算机系统执行以从存储在所述计算机系统上的数据库中检索数据。优化包括：（a）将来自查询的连接谓词与来自查询引用的一个或多个UNION ALL视图的每个分支的本地谓词组合; （b）分析合并谓词; 和（c）当分析步骤指示组合的谓词导致空的结果时，不产生连接。

9. 发明授权

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

10. 发明授权

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.
摘要翻译：一种方法是通过文档的一次扫描为单索引和多索引生成分层路径索引键。对文档的每个数据节点进行扫描，并与查询节点进行匹配。如果三个条件成立，则数据节点与查询节点相匹配：如果不是根步骤，则查询前一步骤中的查询节点匹配; 数据节点匹配当前步骤的查询节点; 数据和查询节点的边缘匹配。如果数据节点不匹配且其级别小于查询的固定级别，则可以跳过数据节点的子树。然后将匹配的数据节点放置在与匹配查询节点相对应的匹配堆栈中。该方法使用匹配单位之间的传递属性来减少需要跟踪的状态数量，并显着提高路径表达式的评估。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式