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

31. 发明授权

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）当分析步骤指示组合的谓词导致空的结果时，不产生连接。

32. 发明申请

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）当分析步骤指示组合的谓词导致空的结果时，不产生连接。

33. 发明授权

US08972377B2 Efficient method of using XML value indexes without exact path information to filter XML documents for more specific XPath queries 有权
标题翻译：使用XML值索引的高效方法，而不需要确切的路径信息来过滤XML文档以获取更多特定的XPath查询
公开(公告)号：US08972377B2
公开(公告)日：2015-03-03
申请号：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.
摘要翻译：提供了一种用于查询处理的系统和方法，包括：创建数据库的索引并且基于一组启发式规则将索引候选的索引从索引排序到列表中。然后将定义查询路径的查询简化为单路径表达式列表。每个索引候选者根据索引候选者的顺序与单个路径表达式的列表进行匹配。还验证匹配的候选节点以确保它们满足查询路径。

34. 发明授权

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

35. 发明授权

US08161004B2 XML sub-document versioning method in XML databases using record storages 失效
标题翻译：使用记录存储的XML数据库中的XML子文档版本控制方法
公开(公告)号：US08161004B2
公开(公告)日：2012-04-17
申请号：US12126712
申请日：2008-05-23
申请人： James Zu-Chia Teng , Guogen Zhang , Qinghua Zou
发明人： James Zu-Chia 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更新提供有效的机制。记录边界和虚拟切点将二维空间分开，横轴表示文档顺序中的节点标识符和表示版本号的垂直轴，成矩形。矩形的底角用于表示矩形，并将角的相应信息添加到搜索树索引。

36. 发明申请

US20080256045A1 XML SUB-DOCUMENT VERSIONING METHOD IN XML DATABASES USING RECORD STORAGES 失效
标题翻译：使用记录存储的XML数据库中的XML子文档版本方法
公开(公告)号：US20080256045A1
公开(公告)日：2008-10-16
申请号：US12126712
申请日：2008-05-23
申请人： James Zu-Chia TENG , Guogen Zhang , Qinghua Zou
发明人： James Zu-Chia TENG , Guogen Zhang , Qinghua Zou
IPC分类号： G06F7/06 , 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更新提供有效的机制。记录边界和虚拟切点将二维空间分开，横轴表示文档顺序中的节点标识符和表示版本号的垂直轴，成矩形。矩形的底角用于表示矩形，并将角的相应信息添加到搜索树索引。

37. 发明申请

US20070050436A1 Order-preserving encoding formats of floating-point decimal numbers for efficient value comparison 有权
标题翻译：浮点十进制数的订单保留编码格式，用于有效的价值比较
公开(公告)号：US20070050436A1
公开(公告)日：2007-03-01
申请号：US11213551
申请日：2005-08-26
申请人： Yao-Ching Chen , Michael Cowlishaw , Christopher Crone , Fung Lee , Ronald Smith , Guogen Zhang , Qinghua Zou
发明人： Yao-Ching Chen , Michael Cowlishaw , Christopher Crone , Fung Lee , Ronald Smith , Guogen Zhang , Qinghua Zou
IPC分类号： G06F7/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.
摘要翻译：已经公开了用于在十进制浮点数和订单保留格式之间进行转换的方法。该方法将十进制浮点格式的数字编码为保留值排序的格式。该编码允许对两个值进行快速和直接的字符串比较。这样的编码提供十进制浮点数的归一化表示，并且支持类型不敏感的比较。类型不敏感的比较通常用于数据库管理系统，其中数据类型未指定用于比较的值。另外，原始的十进制浮点格式可以从订单保留格式中恢复。

38. 发明申请

US20060004858A1 Self-Adaptive Prefix Encoding for Stable Node Identifiers 失效
标题翻译：用于稳定节点标识符的自适应前缀编码
公开(公告)号：US20060004858A1
公开(公告)日：2006-01-05
申请号：US10709415
申请日：2004-05-04
申请人： Brian Tran , Guogen Zhang
发明人： Brian Tran , Guogen Zhang
IPC分类号： G06F17/00
CPC分类号： G06F17/30908
摘要： A variable-length binary string is utilized to encode node identifiers in a tree for an XML document object model. A general prefix encoding scheme is followed; a node identifier is generated by the concatenation of encodings at each level of a tree along a path from a root node to another particular node. Arbitrary insertions are supported without change to existing node identifier encodings. In addition, the method provides for document order when unsigned binary string comparison is used to compare encoded node identifiers. In support of sub-document concurrency control, prefix encoding provides a way to derive ancestor-descendant relationships among nodes in a tree. Lastly, the encoding method provides a natural pre-order clustering sequence, also known as depth-first clustering. If a prefix is applied to an encoding with a level number, starting with zero at the root, width-first clustering will result. A mixed clustering can also be supported.
摘要翻译：使用可变长度的二进制字符串来编码用于XML文档对象模型的树中的节点标识符。遵循一般的前缀编码方案; 通过沿着从根节点到另一个特定节点的路径的树的每个级别的编码的级联来生成节点标识符。支持任意插入，而不改变现有的节点标识符编码。此外，当使用无符号二进制字符串比较来比较编码节点标识符时，该方法提供了文档顺序。为了支持子文档并发控制，前缀编码提供了一种在树中节点之间派生祖先 - 后代关系的方法。最后，编码方法提供了一种自然的预购聚类序列，也称为深度优先聚类。如果将前缀应用于具有级号的编码，则从根开始为零，将导致宽度优先聚类。也可以支持混合群集。

39. 发明申请

US20050166140A1 Eliminating superfluous namespace declarations and undeclaring default namespaces in XML serialization processing 失效
标题翻译：在XML序列化处理中消除多余的命名空间声明和未声明的默认命名空间
公开(公告)号：US20050166140A1
公开(公告)日：2005-07-28
申请号：US10766764
申请日：2004-01-27
申请人： Mengchu Cai , Jason Cu , Yue Huang , Guogen Zhang
发明人： Mengchu Cai , Jason Cu , Yue Huang , Guogen Zhang
IPC分类号： G06F17/00 , G06F17/30
CPC分类号： G06F17/30941
摘要： In one embodiment, at least a portion of an object model having at least one namespace is serialized. An ancestor namespace is searched for based on a current namespace declaration. The ancestor namespace is associated with an ancestor prefix and an ancestor uniform resource indicator (URI). The current namespace is associated with a current prefix and current URI. The search is performed to find an ancestor prefix matches the current prefix. When the current namespace is an implicit no default namespace and the ancestor namespace is an explicit default namespace based on, at least in part, the ancestor prefix, a serialized namespace declaration is generated for the current namespace.
摘要翻译：在一个实施例中，具有至少一个命名空间的对象模型的至少一部分被序列化。根据当前的命名空间声明来搜索祖先命名空间。祖先命名空间与祖先前缀和祖先统一资源指示符（URI）相关联。当前的命名空间与当前的前缀和当前的URI相关联。执行搜索以查找与当前前缀匹配的祖先前缀。当目前的命名空间是一个隐含的无默认命名空间，并且祖先名称空间是至少部分基于祖先前缀的显式默认命名空间时，将为当前命名空间生成序列化命名空间声明。

40. 发明申请

US20140019472A1 ENCODED DATA PROCESSING 失效
标题翻译：编码数据处理
公开(公告)号：US20140019472A1
公开(公告)日：2014-01-16
申请号：US13545522
申请日：2012-07-10
申请人： 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/30
CPC分类号： G06F17/30286 , G06F17/30076 , G06F17/30339 , H03M7/30
摘要： Techniques for encoded data processing which allow 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.
摘要翻译：用于编码数据处理的技术，其允许作为编码数据的连续数据处理改变。数据被分解为一个或多个块，每个块包含至少一个数据记录。使用从一个或多个编码过程中选择的第一编码过程对给定块内的至少一个数据记录进行编码。第一编码过程与给定的数据块相关联。技术评估在给定块中更新给定数据记录时是否实现给定块的编码更改。响应于评估，给定的块用第二编码过程重新编码。响应于重新编码，给定块的关联更新。形成地图以将用第一编码处理编码的给定数据记录转换为第二编码处理，以便保持给定数据记录的比较关系。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式