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

1. 发明授权

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

2. 发明授权

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

3. 发明授权

US07243098B2 Method, system, and program for optimizing aggregate processing 失效
标题翻译：用于优化聚合处理的方法，系统和程序
公开(公告)号：US07243098B2
公开(公告)日：2007-07-10
申请号：US10325854
申请日：2002-12-19
申请人： Yun Wang , Fen-Ling Lin , Yao Ching Stephen Chen , Mengchu Cai , Jason Alexander Cu , Allan Benjamin Lebovitz , Li-Mey Lee , Guogen Zhang
发明人： Yun Wang , Fen-Ling Lin , Yao Ching Stephen Chen , Mengchu Cai , Jason Alexander Cu , Allan Benjamin Lebovitz , Li-Mey Lee , Guogen Zhang
IPC分类号： G06F17/30 , G06F15/16
CPC分类号： G06F17/30286 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99948
摘要： Disclosed is a method, system, and program 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.
摘要翻译：公开了一种用于处理聚合函数的方法，系统和程序。包含对中间结果结构的引用的行被分组以形成组。对于每个组，从中间结果结构形成聚合元素结构，并且如果聚合函数指定排序，则基于排序关键字对聚合元素结构进行排序。

4. 发明申请

US20070043686A1 XML SUB-DOCUMENT VERSIONING METHOD IN XML DATABASES USING RECORD STORAGES 失效
标题翻译：使用记录存储的XML数据库中的XML子文档版本方法
公开(公告)号：US20070043686A1
公开(公告)日：2007-02-22
申请号：US11161908
申请日：2005-08-22
申请人： JAMES TENG , GUOGEN ZHANG , QINGHUA ZOU
发明人： JAMES TENG , GUOGEN ZHANG , QINGHUA ZOU
IPC分类号： G06F17/30
CPC分类号： G06F17/30923 , Y10S707/99931 , Y10S707/99937 , Y10S707/99953
摘要： A new sub-document versioning method for record storages of XML documents which uses virtual cutting points to ensure that a search tree is able to support multiple versions of sub-documents and provide efficient mechanisms for XML updating. Record boundaries and virtual cut points divide the two-dimensional space, the horizontal axis representing node identifiers in document order and vertical axis representing version numbers, into rectangles. The bottom corner of the rectangle is used to represent the rectangles and the corresponding information of the corner is added to the search tree index.
摘要翻译：一种用于记录XML文档存储的新的子文档版本控制方法，它使用虚拟切割点来确保搜索树能够支持多个版本的子文档，并为XML更新提供有效的机制。记录边界和虚拟切点将二维空间分开，横轴表示文档顺序中的节点标识符和表示版本号的垂直轴，成矩形。矩形的底角用于表示矩形，并将角的相应信息添加到搜索树索引。

5. 发明申请

US20050114307A1 Efficient heuristic approach in selection of materialized views when there are multiple matchings to an SQL query 有权
标题翻译：当与SQL查询有多个匹配时，选择物化视图时的高效启发式方法
公开(公告)号：US20050114307A1
公开(公告)日：2005-05-26
申请号：US10720252
申请日：2003-11-25
申请人： Ruiping Li , Irene Liu , Lee-Chin Liu , Guogen Zhang
发明人： Ruiping Li , Irene Liu , Lee-Chin Liu , Guogen Zhang
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30457 , Y02D10/45 , Y10S707/99932 , Y10S707/99933
摘要： A heuristic approach is used to order materialized view (MW) candidates in a list based on descending order of their reduction power. A query (e.g., SQL query) is then matched with the MVs in the list order, wherein searching is stopped as soon as good enough matching has been found. The query is matched with materialized views in the ordered list by identifying a materialized view candidate as follows: identifying an MV that is not locked by a REFRESH process; identifying a matching MV that does not require a regroup; identifying a matching MV that does not require a rejoin; identifying a matching MV that does not require a residual join; or identifying an MV with largest reduction power from the list of candidates.
摘要翻译：使用启发式方法根据其降低功率的降序对列表中的物化视图（MW）候选进行排序。然后，查询（例如，SQL查询）以列表顺序与MV匹配，其中一旦找到足够好的匹配，就停止搜索。该查询与有序列表中的物化视图匹配，通过识别物化视图候选如下：识别未被REFRESH进程锁定的MV; 识别不需要重组的匹配MV; 识别不需要重新加入的匹配MV; 识别不需要残留连接的匹配MV; 或从候选列表中识别具有最大减少功率的MV。

6. 发明授权

US06792420B2 Method, system, and program for optimizing the processing of queries involving set operators 有权
标题翻译：用于优化涉及集合运算符的查询处理的方法，系统和程序
公开(公告)号：US06792420B2
公开(公告)日：2004-09-14
申请号：US09896453
申请日：2001-06-29
申请人： Yao Ching Stephen Chen , Yumi Kimura Tsuji , Yun Wang , Guogen Zhang
发明人： Yao Ching Stephen Chen , Yumi Kimura Tsuji , Yun Wang , Guogen Zhang
IPC分类号： G06F1730
CPC分类号： G06F17/30454 , G06F17/30495 , Y10S707/99933
摘要： Provided is a method, system, and program for processing a query including a query operation on a table derived from a set operation on two result tables. The query operation is performed on each result table separately to produce two intermediate result tables. The set operator is then applied to the two intermediate result tables to produce a final result table that is a same result table that would have been produced by performing the query operation on the table derived from the set operation performed on the two result tables.
摘要翻译：提供了一种用于处理包括对从两个结果表上的集合操作导出的表的查询操作的查询的方法，系统和程序。对每个结果表分别执行查询操作，以生成两个中间结果表。然后将集合运算符应用于两个中间结果表，以产生最终结果表，该最终结果表是通过对从两个结果表执行的集合操作导出的表执行查询操作而产生的相同结果表。

7. 发明授权

US06374235B1 Method, system, and program for a join operation on a multi-column table and satellite tables including duplicate values 有权
标题翻译：在多列表和包含重复值的卫星表中的连接操作的方法，系统和程序
公开(公告)号：US06374235B1
公开(公告)日：2002-04-16
申请号：US09344731
申请日：1999-06-25
申请人： Stephen Yao Ching Chen , Patrick Michael Malone , Jerry Mukai , Jeffrey Ralph Ruggles , Desai Paramesh Sampatrai , Yun Wang , Guogen Zhang
发明人： Stephen Yao Ching Chen , Patrick Michael Malone , Jerry Mukai , Jeffrey Ralph Ruggles , Desai Paramesh Sampatrai , Yun Wang , Guogen Zhang
IPC分类号： G06F1730
CPC分类号： G06F17/30466 , G06F17/30498 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934
摘要： Disclosed is a method, system, and program for performing a join operation on a multi-column table and at least two satellite tables having a join condition. Each satellite table is comprised of multiple rows and at least one join column. The multi-column table is comprised of multiple rows and at least one column corresponding to the join column in each satellite table. A join operation is performed on the rows of the satellite tables to generate concatenated rows of the satellite tables. One of the concatenated rows is joined to the multi-column table and a returned entry from the multi-column table is received. A determination is then made as to whether the returned entry matches the search criteria. If so, a determination is made as to whether one of the satellite tables has duplicates of values in the join column of the returned matching entry or the multi-column table has duplicate entries in the join columns. Returned matching entries are generated for each duplicate value in the satellite tables and duplicate entry in the multi-column table.
摘要翻译：公开了一种用于在多列表和至少两个具有连接条件的卫星表上执行加入操作的方法，系统和程序。每个卫星表由多行和至少一个连接列组成。多列表由多行和至少一列对应于每个卫星表中的连接列组成。对卫星表的行执行加入操作，以生成卫星表的级联行。其中一个连接的行被连接到多列表，并且从多列表中返回的条目被接收。然后确定返回的条目是否与搜索条件匹配。如果是，则确定卫星表中的一个是否具有在返回的匹配条目的连接列中的值的重复，或者多列表在连接列中具有重复条目。为卫星表中的每个重复值和多列表中的重复条目生成返回的匹配条目。

8. 发明申请

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.
摘要翻译：为编码数据处理提供技术，其允许作为编码数据变化的连续数据处理。数据被分解为一个或多个块，每个块包含至少一个数据记录。使用从一个或多个编码过程中选择的第一编码过程对给定块内的至少一个数据记录进行编码。第一编码过程与给定的数据块相关联。技术评估在给定块中更新给定数据记录时是否实现给定块的编码更改。响应于评估，给定的块用第二编码过程重新编码。响应于重新编码，给定块的关联更新。形成地图以将用第一编码处理编码的给定数据记录转换为第二编码处理，以便保持给定数据记录的比较关系。

9. 发明授权

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

10. 发明申请

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操作。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式