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

21. 发明申请

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

22. 发明授权

US07493603B2 Annotated automaton encoding of XML schema for high performance schema validation 有权
标题翻译：用于高性能模式验证的XML模式的注释自动机编码
公开(公告)号：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模式定义而变化，因此空间开销最小化。提供验证过程中的灵活性，而不会影响性能。

23. 发明授权

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

24. 发明申请

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

25. 发明授权

US07120864B2 Eliminating superfluous namespace declarations and undeclaring default namespaces in XML serialization processing 失效
标题翻译：在XML序列化处理中消除多余的命名空间声明和未声明的默认命名空间
公开(公告)号：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相关联。执行搜索以查找与当前前缀匹配的祖先前缀。当目前的命名空间是一个隐含的无默认命名空间，并且祖先名称空间是至少部分基于祖先前缀的显式默认命名空间时，将为当前命名空间生成序列化命名空间声明。

26. 发明授权

US07089225B2 Efficient heuristic approach in selection of materialized views when there are multiple matchings to an SQL query 有权
标题翻译：当与SQL查询有多个匹配时，选择物化视图时的高效启发式方法
公开(公告)号：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。

27. 发明授权

US07346609B2 Streaming XPath algorithm for XPath value index key generation 失效
标题翻译：用于XPath值索引密钥生成的流XPath算法
公开(公告)号：US07346609B2
公开(公告)日：2008-03-18
申请号：US10990834
申请日：2004-11-16
申请人： Yao-Ching Stephen Chen , Irene Ching-Hua Liu , Demai Ni , Guogen Zhang , Qinghua Zou
发明人： Yao-Ching Stephen Chen , Irene Ching-Hua Liu , Demai Ni , Guogen Zhang , Qinghua Zou
IPC分类号： G06F17/30
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.
摘要翻译：一种方法是通过文档的一次扫描为单索引和多索引生成分层路径索引键。对文档的每个数据节点进行扫描，并与查询节点进行匹配。如果三个条件成立，则数据节点与查询节点相匹配：如果不是根步骤，则查询前一步骤中的查询节点匹配; 数据节点匹配当前步骤的查询节点; 数据和查询节点的边缘匹配。如果数据节点不匹配且其级别小于查询的固定级别，则可以跳过数据节点的子树。然后将匹配的数据节点放置在与匹配查询节点相对应的匹配堆栈中。该方法使用匹配单位之间的传递属性来减少需要跟踪的状态数量，并显着提高路径表达式的评估。

28. 发明申请

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。

29. 发明授权

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

30. 发明申请

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

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式