公开(公告)号：US20070043743A1

公开(公告)日：2007-02-22

申请号：US11209997

申请日：2005-08-22

申请人： Yao-Ching Chen ,  Yue Huang ,  Fen-Ling Lin ,  Brian Tran ,  Guogen Zhang

发明人： Yao-Ching Chen ,  Yue Huang ,  Fen-Ling Lin ,  Brian Tran ,  Guogen Zhang

IPC分类号： G06F7/00

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.

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

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

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

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

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

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

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

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

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

公开(公告)号：US07120864B2

公开(公告)日：2006-10-10

申请号：US10766764

申请日：2004-01-27

申请人： Mengchu Cai ,  Jason Alexander Cu ,  Yue Huang ,  Guogen Zhang

发明人： Mengchu Cai ,  Jason Alexander Cu ,  Yue Huang ,  Guogen Zhang

IPC分类号： G06F17/00

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

公开(公告)号：US07089225B2

公开(公告)日：2006-08-08

申请号：US10720252

申请日：2003-11-25

申请人： Ruiping Li ,  Irene Ching-Hua Liu ,  Lee-Chin Hsu Liu ,  Guogen Zhang

发明人： Ruiping Li ,  Irene Ching-Hua Liu ,  Lee-Chin Hsu Liu ,  Guogen Zhang

IPC分类号： G06F7/00 ,  G06F17/00

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 when 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。

公开(公告)号：US20060106758A1

公开(公告)日：2006-05-18

申请号：US10990834

申请日：2004-11-16

申请人： Yao-Ching Chen ,  Irene Liu ,  Demai Ni ,  Guogen Zhang ,  Qinghua Zou

发明人： Yao-Ching Chen ,  Irene Liu ,  Demai Ni ,  Guogen Zhang ,  Qinghua Zou

IPC分类号： G06F17/00

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.

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

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