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

31. 发明申请

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.
摘要翻译：已经公开了用于在十进制浮点数和订单保留格式之间进行转换的方法。该方法将十进制浮点格式的数字编码为保留值排序的格式。该编码允许对两个值进行快速和直接的字符串比较。这样的编码提供十进制浮点数的归一化表示，并且支持类型不敏感的比较。类型不敏感的比较通常用于数据库管理系统，其中数据类型未指定用于比较的值。另外，原始的十进制浮点格式可以从订单保留格式中恢复。

32. 发明授权

US07124137B2 Method, system, and program for optimizing processing of nested functions 有权
标题翻译：用于优化嵌套函数处理的方法，系统和程序
公开(公告)号：US07124137B2
公开(公告)日：2006-10-17
申请号：US10325781
申请日：2002-12-19
申请人： Fen-Ling Lin , Yao Ching Stephen Chen , Yun Wang , Guogen Zhang , Mengchu Cai , Jason Alexander Cu , Li-Mey Lee
发明人： Fen-Ling Lin , Yao Ching Stephen Chen , Yun Wang , Guogen Zhang , Mengchu Cai , Jason Alexander Cu , Li-Mey Lee
IPC分类号： G06F17/30 , G06F15/177
CPC分类号： G06F17/30917 , Y10S707/99934
摘要： Disclosed is a method, system, and program for processing a function. A set of nested functions are received. A composite function is generated for the set of nested functions. A tagging template is generated for the set of nested functions that corresponds to the composite function. A result is produced by evaluating the composite function using the tagging template.
摘要翻译：公开了一种用于处理功能的方法，系统和程序。接收一组嵌套函数。为嵌套函数集生成一个复合函数。为与复合函数对应的嵌套函数集生成标记模板。通过使用标签模板评估复合函数产生结果。

33. 发明申请

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文档对象模型的树中的节点标识符。遵循一般的前缀编码方案; 通过沿着从根节点到另一个特定节点的路径的树的每个级别的编码的级联来生成节点标识符。支持任意插入，而不改变现有的节点标识符编码。此外，当使用无符号二进制字符串比较来比较编码节点标识符时，该方法提供了文档顺序。为了支持子文档并发控制，前缀编码提供了一种在树中节点之间派生祖先 - 后代关系的方法。最后，编码方法提供了一种自然的预购聚类序列，也称为深度优先聚类。如果将前缀应用于具有级号的编码，则从根开始为零，将导致宽度优先聚类。也可以支持混合群集。

34. 发明申请

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相关联。执行搜索以查找与当前前缀匹配的祖先前缀。当目前的命名空间是一个隐含的无默认命名空间，并且祖先名称空间是至少部分基于祖先前缀的显式默认命名空间时，将为当前命名空间生成序列化命名空间声明。

35. 发明申请

US20050027690A1 Dynamic selection of optimal grouping sequence at runtime for grouping sets, rollup and cube operations in SQL query processing 审中-公开
标题翻译：运行时动态选择最佳分组序列，以便在SQL查询处理中进行分组，汇总和多维数据集操作
公开(公告)号：US20050027690A1
公开(公告)日：2005-02-03
申请号：US10629459
申请日：2003-07-29
申请人： Guogen Zhang , Fen-Ling Lin , Jung-Hsin Hu , Yao-Ching Chen , Yun Wang , Glenn Yuki
发明人： Guogen Zhang , Fen-Ling Lin , Jung-Hsin Hu , Yao-Ching Chen , Yun Wang , Glenn Yuki
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F16/24537
摘要： 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操作。

36. 发明授权

US09535952B2 Dynamic selection of optimal grouping sequence at runtime for grouping sets, rollup and cube operations in SQL query processing 有权
标题翻译：运行时动态选择最佳分组序列，以便在SQL查询处理中进行分组，汇总和多维数据集操作
公开(公告)号：US09535952B2
公开(公告)日：2017-01-03
申请号：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. Grouping operations are optimized during execution of the query in the computer system by: (1) translating the grouping operations into a plurality of levels, wherein each of the levels is comprised of one or more grouping sets with the same number of grouping expressions; (2) deriving the grouping sets on a level-by-level basis, wherein the grouping sets in a base level are obtained from the database and the grouping sets in a next one of the levels are derived by selecting as an input a smallest one of the grouping sets in a previous one of the levels with which it has a derivation relationship; and (3) combining the derived grouping sets into an output for the query.
摘要翻译：一种用于优化计算机系统中的查询的方法，装置和制品。在计算机系统中执行查询期间优化分组操作：（1）将分组操作转换成多个级别，其中每个级别由具有相同数目的分组表达式的一个或多个分组集合组成; （2）逐级导出分组集合，其中从数据库获得基本级别中的分组集合，并且通过选择作为输入的最小的一个来导出下一个级别中的分组集合的分组集合在与其具有派生关系的前一个级别中; 和（3）将导出的分组集合合成用于查询的输出。

37. 发明申请

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

38. 发明授权

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

39. 发明申请

US20110302195A1 Multi-Versioning Mechanism for Update of Hierarchically Structured Documents Based on Record Storage 审中-公开
标题翻译：基于记录存储的层次结构化文档更新的多版本化机制
公开(公告)号：US20110302195A1
公开(公告)日：2011-12-08
申请号：US12796599
申请日：2010-06-08
申请人： Mengchu Cai , Eric N. Katayama , Guogen Zhang , Shirley Zhou
发明人： Mengchu Cai , Eric N. Katayama , Guogen Zhang , Shirley Zhou
IPC分类号： G06F17/30
CPC分类号： G06F16/83
摘要： A method for multi-versioning data of a hierarchically structured document stored in data records includes: changing document data in one or more data records, each data record assigned a record identifier, the data record including a plurality of nodes assigned a node identifier, and the document assigned a document identifier; storing an update timestamp in a base table row referencing the document identifier; storing in each changed data record a start timestamp for a start of a validity period for the changed data record and an end timestamp for an end of the validity period; and storing the start timestamp and the end timestamp in one or more node identifier index entries referencing the document identifier, the record identifier, and the node identifier. A version of the document may be obtained using node identifier index entries satisfying a version timestamp.
摘要翻译：一种存储在数据记录中的分层结构化文档的数据多版本化方法包括：在一个或多个数据记录中改变文档数据，每个数据记录分配记录标识符，数据记录包括分配有节点标识符的多个节点，以及该文件分配了文件标识符; 将更新时间戳存储在引用文档标识符的基表行中; 在每个改变的数据记录中存储用于所述改变的数据记录的有效期的开始的开始时间戳和所述有效期的结束的结束时间戳; 并将开始时间戳和结束时间戳存储在引用文档标识符，记录标识符和节点标识符的一个或多个节点标识符索引条目中。可以使用满足版本时间戳的节点标识符索引条目来获得文档的版本。

40. 发明授权

US08019779B2 Efficient locking protocol for sub-document concurrency control using prefix encoded node identifiers in XML databases 有权
标题翻译：在XML数据库中使用前缀编码节点标识符的子文档并发控制的高效锁定协议
公开(公告)号：US08019779B2
公开(公告)日：2011-09-13
申请号：US10709416
申请日：2004-05-04
申请人： James Zu-Chia Teng , Brian Shaun Vickery , Guogen Zhang
发明人： James Zu-Chia Teng , Brian Shaun Vickery , Guogen Zhang
IPC分类号： G06F17/30
CPC分类号： G06F17/30362
摘要： A system and method for concurrency control of hierarchically structured data is provided. Lock requests on a target node are processed by exploiting ancestor-descendant information encoded into prefix encoded node identifiers (IDs). A set of implicit locks on ancestor nodes along a path from an immediate parent of a target node to a root node is derived from an explicit lock request on a target node. A logical lock tree describing existing lock modes for ancestor nodes is consulted to determine compatibility with the derived set of implicit locks. If existing lock modes for ancestor nodes are compatible with the derived set of implicit locks, a lock request on a target node is granted. Otherwise, the lock request is denied. A lock release request follows the reverse process; a target node in a particular transaction is released, as are subsequent locks on its ancestors made by the same transaction.
摘要翻译：提供了一种用于分级结构化数据并发控制的系统和方法。通过利用编码为前缀编码节点标识符（ID）的祖先 - 后代信息来处理目标节点上的锁定请求。从目标节点的直接父节点到根节点的路径上的祖先节点上的一组隐式锁派生自目标节点上的显式锁定请求。查询描述祖先节点的现有锁模式的逻辑锁树，以确定与导出的隐式锁定集的兼容性。如果祖先节点的现有锁定模式与导出的隐式锁定集合兼容，则会授予目标节点上的锁定请求。否则，锁请求被拒绝。锁定释放请求遵循相反的过程; 特定事务中的目标节点被释放，同一事务由其祖先的后续锁也被释放。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式