公开(公告)号：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.

摘要翻译： 提供了一种用于查询处理的系统和方法，包括：创建数据库的索引并且基于一组启发式规则将索引候选的索引从索引排序到列表中。 然后将定义查询路径的查询简化为单路径表达式列表。 每个索引候选者根据索引候选者的顺序与单个路径表达式的列表进行匹配。 还验证匹配的候选节点以确保它们满足查询路径。

公开(公告)号：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.

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

公开(公告)号：US07493603B2

公开(公告)日：2009-02-17

申请号：US10418658

申请日：2003-04-16

申请人： You-Chin Fuh ,  Ning Wang ,  Yun Wang ,  Guogen Zhang

发明人： You-Chin Fuh ,  Ning Wang ,  Yun Wang ,  Guogen Zhang

IPC分类号： G06F9/44

CPC分类号： G06F17/272 ,  G06F17/227

摘要： A method and system for Extensible Markup Language (XML) schema validation, includes: loading an XML document into a runtime validation engine, where the runtime validation engine includes an XML schema validation parser; loading an annotated automaton encoding (AAE) for an XML schema definition into the XML schema validation parser; and validating the XML document against the XML schema definition by the XML schema validation parser utilizing the annotated automaton encoding. Each XML schema definition is compiled once into the AAE format, rather than being compiled each time an XML document is validated, and thus significant time is saved. The code for the runtime validation engine is fixed and does not vary depending on the XML schema definition, rather than varying for each XML schema definition, and thus space overhead is minimized. Flexibility in the validation process is provided without compromising performance.

摘要翻译： 可扩展标记语言（XML）模式验证的方法和系统包括：将XML文档加载到运行时验证引擎中，运行时验证引擎包含XML模式验证解析器; 将用于XML模式定义的带注释的自动机编码（AAE）加载到XML模式验证解析器中; 并通过使用带注释的自动机编码的XML模式验证解析器根据XML模式定义验证XML文档。 每个XML模式定义都被编译为AAE格式，而不是每次验证XML文档时被编译，因此节省了大量的时间。 运行时验证引擎的代码是固定的，并且不会根据XML模式定义而变化，而不是因为每个XML模式定义而变化，因此空间开销最小化。 提供验证过程中的灵活性，而不会影响性能。

公开(公告)号：US07246115B2

公开(公告)日：2007-07-17

申请号：US10324800

申请日：2002-12-19

申请人： Guogen Zhang ,  Irene Ching-Hua Liu ,  Ding-Wei Chieh ,  Lee-Chin Hsu Liu ,  Yao-Ching Stephen Chen ,  Hsuiying Yen Cheng ,  Brian Thinh-Vinh Tran ,  Yun Wang ,  Ruiping Li

发明人： Guogen Zhang ,  Irene Ching-Hua Liu ,  Ding-Wei Chieh ,  Lee-Chin Hsu Liu ,  Yao-Ching Stephen Chen ,  Hsuiying Yen Cheng ,  Brian Thinh-Vinh Tran ,  Yun Wang ,  Ruiping Li

IPC分类号： G06F17/30

CPC分类号： G06F17/30457 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99942 ,  Y10S707/99943

摘要： A method and system for efficiently identifying materialized view candidates for queries filters materialized views using certain criteria, using the materialized view signatures. This filtering rejects some of the unqualified materialized views prior to the performance of the query rewrite matching algorithm, resulting in a group of materialized view candidates. The query rewrite matching algorithm is then performed on the materialized view candidates. By first filtering the materialized views based on their signatures, the number of materialized views on which the query rewrite matching algorithm is performed is significantly reduced, improving performance.

摘要翻译： 用于有效地识别用于查询的物化视图候选的方法和系统使用特定的视图签名使用特定标准过滤物化视图。 该过滤在执行查询重写匹配算法之前拒绝一些不合格的物化视图，导致一组物化视图候选。 然后对物化视图候选进行查询重写匹配算法。 通过首先根据其签名过滤物化视图，大大减少了执行查询重写匹配算法的物化视图数量，从而提高了性能。

公开(公告)号：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.

摘要翻译： 公开了一种用于处理功能的方法，系统和程序。 接收一组嵌套函数。 为嵌套函数集生成一个复合函数。 为与复合函数对应的嵌套函数集生成标记模板。 通过使用标签模板评估复合函数产生结果。

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

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

公开(公告)号：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）将导出的分组集合合成用于查询的输出。

公开(公告)号：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.

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

公开(公告)号：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.

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