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

11. 发明授权

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.
摘要翻译：公开了一种用于处理聚合函数的方法，系统和程序。包含对中间结果结构的引用的行被分组以形成组。对于每个组，从中间结果结构形成聚合元素结构，并且如果聚合函数指定排序，则基于排序关键字对聚合元素结构进行排序。

12. 发明申请

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更新提供有效的机制。记录边界和虚拟切点将二维空间分开，横轴表示文档顺序中的节点标识符和表示版本号的垂直轴，成矩形。矩形的底角用于表示矩形，并将角的相应信息添加到搜索树索引。

13. 发明申请

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。

14. 发明授权

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.
摘要翻译：提供了一种用于处理包括对从两个结果表上的集合操作导出的表的查询操作的查询的方法，系统和程序。对每个结果表分别执行查询操作，以生成两个中间结果表。然后将集合运算符应用于两个中间结果表，以产生最终结果表，该最终结果表是通过对从两个结果表执行的集合操作导出的表执行查询操作而产生的相同结果表。

15. 发明授权

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.
摘要翻译：公开了一种用于在多列表和至少两个具有连接条件的卫星表上执行加入操作的方法，系统和程序。每个卫星表由多行和至少一个连接列组成。多列表由多行和至少一列对应于每个卫星表中的连接列组成。对卫星表的行执行加入操作，以生成卫星表的级联行。其中一个连接的行被连接到多列表，并且从多列表中返回的条目被接收。然后确定返回的条目是否与搜索条件匹配。如果是，则确定卫星表中的一个是否具有在返回的匹配条目的连接列中的值的重复，或者多列表在连接列中具有重复条目。为卫星表中的每个重复值和多列表中的重复条目生成返回的匹配条目。

16. 发明授权

US08832046B2 Encoded data processing 有权
标题翻译：编码数据处理
公开(公告)号：US08832046B2
公开(公告)日：2014-09-09
申请号：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分类号： G06F17/00 , G06F17/30 , H03M7/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.
摘要翻译：为编码数据处理提供技术，其允许作为编码数据变化的连续数据处理。数据被分解为一个或多个块，每个块包含至少一个数据记录。使用从一个或多个编码过程中选择的第一编码过程对给定块内的至少一个数据记录进行编码。第一编码过程与给定的数据块相关联。技术评估在给定块中更新给定数据记录时是否实现给定块的编码更改。响应于评估，给定的块用第二编码过程重新编码。响应于重新编码，给定块的关联更新。形成地图以将用第一编码处理编码的给定数据记录转换为第二编码处理，以便保持给定数据记录的比较关系。

17. 发明授权

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

18. 发明申请

US20090112858A1 EFFICIENT METHOD OF USING XML VALUE INDEXES WITHOUT EXACT PATH INFORMATION TO FILTER XML DOCUMENTS FOR MORE SPECIFIC XPATH QUERIES 有权
标题翻译：使用XML值索引的有效方法，没有明确的路径信息来过滤XML文档以获得更具体的XPATH QUERIES
公开(公告)号：US20090112858A1
公开(公告)日：2009-04-30
申请号：US11923652
申请日：2007-10-25
申请人： Guogen Zhang , Ruiping Li , Mengchu Cai
发明人： Guogen Zhang , Ruiping Li , Mengchu Cai
IPC分类号： G06F17/30
CPC分类号： G06F17/30911 , G06F17/30938
摘要： A system and method is provided for query processing comprises: creating an index of a database and ordering a set of index candidates from the index into a list based on a set of heuristic rules. A query defining a query path is then reduced into a list of single path expressions. Each index candidate is matched against the list of single path expressions according to the ordering of the index candidates. The matched candidate nodes are also verified to insure that they satisfy the query path.
摘要翻译：提供了一种用于查询处理的系统和方法，包括：创建数据库的索引并且基于一组启发式规则将索引候选的索引从索引排序到列表中。然后将定义查询路径的查询简化为单路径表达式列表。每个索引候选者根据索引候选者的顺序与单个路径表达式的列表进行匹配。还验证匹配的候选节点以确保它们满足查询路径。

19. 发明申请

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.
摘要翻译：公开了一种用于评估路径查询的方法和系统。路径查询对应于包括多个查询节点的查询树。至少一个查询节点对应于至少一个谓词并处于一个级别。对先前的查询节点评估谓词。该方法和系统包括扫描文档的数据节点并确定数据节点是否匹配查询节点。该方法和系统还包括将与数据节点相关的数据放置在与匹配查询节点相对应的匹配堆栈中。查询节点的数据包括对应于谓词的属性。所述方法和系统还包括将所述至少一个查询节点的匹配向后传播到所述至少一个先前查询节点的匹配。

20. 发明申请

US20070192285A1 OPTIMIZING AGGREGATE PROCESSING 失效
标题翻译：优化综合处理
公开(公告)号：US20070192285A1
公开(公告)日：2007-08-16
申请号：US11738406
申请日：2007-04-20
申请人： Yun WANG , Fen-Ling LIN , Yao Ching CHEN , Mengchu CAI , Jason CU , Allan LEBOVITZ , Li-Mey LEE , Guogen ZHANG
发明人： Yun WANG , Fen-Ling LIN , Yao Ching CHEN , Mengchu CAI , Jason CU , Allan LEBOVITZ , Li-Mey LEE , Guogen ZHANG
IPC分类号： G06F17/30
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.
摘要翻译：公开了一种处理聚合函数的方法。包含对中间结果结构的引用的行被分组以形成组。对于每个组，从中间结果结构形成聚合元素结构，并且如果聚合函数指定排序，则基于排序关键字对聚合元素结构进行排序。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式