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

1. 发明授权

US08862636B2 Scalable algorithms for mapping-based XML transformation 有权
标题翻译：用于基于映射的XML转换的可扩展算法
公开(公告)号：US08862636B2
公开(公告)日：2014-10-14
申请号：US12134029
申请日：2008-06-05
申请人： Wook-Shin Han , Ching-Tien Ho , Haifeng Jiang , Lucian Popa
发明人： Wook-Shin Han , Ching-Tien Ho , Haifeng Jiang , Lucian Popa
IPC分类号： G06F7/00 , G06F17/30 , G06F17/22 , G06F17/00
CPC分类号： G06F17/2247 , G06F17/2264 , Y10S707/957
摘要： A computer-implemented method for use with an extensible markup language (XML) document includes inputting a high-level mapping specification for a schema mapping; and generating a target XML document based on the mapping. The method may perform schema mapping-based XML transformation as a three-phase process comprising tuple extraction, XML-fragment generation, and data merging. The tuple extraction phase may be adapted to handle streamed XML data (as well as stored/indexed XML data). The data merging phase may use a hybrid method that can dynamically switch between main memory-based and disk-based algorithms based on the size of the XML data to be merged.
摘要翻译：用于可扩展标记语言（XML）文档的计算机实现的方法包括输入模式映射的高级映射规范; 并基于映射生成目标XML文档。该方法可以执行基于模式映射的XML变换作为包括元组提取，XML片段生成和数据合并的三阶段过程。元组提取阶段可以适用于处理流式XML数据（以及存储/索引的XML数据）。数据合并阶段可以使用可以基于要合并的XML数据的大小在主存储器和基于磁盘的算法之间动态切换的混合方法。

2. 发明申请

US20080235260A1 SCALABLE ALGORITHMS FOR MAPPING-BASED XML TRANSFORMATION 审中-公开
标题翻译：用于基于映射的XML转换的可扩展算法
公开(公告)号：US20080235260A1
公开(公告)日：2008-09-25
申请号：US11690639
申请日：2007-03-23
申请人： WOOK-SHIN HAN , CHING-TIEN HO , HAIFENG JIANG , LUCIAN POPA
发明人： WOOK-SHIN HAN , CHING-TIEN HO , HAIFENG JIANG , LUCIAN POPA
IPC分类号： G06F7/00
CPC分类号： G06F17/2247 , G06F17/2264 , Y10S707/957
摘要： A computer-implemented method for use with an extensible markup language (XML) document includes inputting a high-level mapping specification for a schema mapping; and generating a target XML document based on the mapping. The method may perform schema mapping-based XML transformation as a three-phase process comprising tuple extraction, XML-fragment generation, and data merging. The tuple extraction phase may be adapted to handle streamed XML data (as well as stored/indexed XML data). The data merging phase may use a hybrid method that can dynamically switch between main memory-based and disk-based algorithms based on the size of the XML data to be merged.
摘要翻译：用于可扩展标记语言（XML）文档的计算机实现的方法包括输入模式映射的高级映射规范; 并基于映射生成目标XML文档。该方法可以执行基于模式映射的XML变换作为包括元组提取，XML片段生成和数据合并的三阶段过程。元组提取阶段可以适用于处理流式XML数据（以及存储/索引的XML数据）。数据合并阶段可以使用可以基于要合并的XML数据的大小在主存储器和基于磁盘的算法之间动态切换的混合方法。

3. 发明授权

US5890151A Method and system for performing partial-sum queries on a data cube 失效
标题翻译：在数据立方体上执行部分和查询的方法和系统
公开(公告)号：US5890151A
公开(公告)日：1999-03-30
申请号：US853750
申请日：1997-05-09
申请人： Rakesh Agrawal , Jehoshua Bruck , Ching-Tien Ho
发明人： Rakesh Agrawal , Jehoshua Bruck , Ching-Tien Ho
IPC分类号： G06F17/30
CPC分类号： G06F17/30324 , G06F17/30333 , G06F17/30489 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936
摘要： Disclosed is a method and system for performing a partial-sum query in a database in which the data is represented as a multi-dimensional data cube. The data cube is partitioned into multi-dimensional blocks. One or more covering codes are then selected for each block, and a group of partial-sums is computed for each block based on its covering codes. At query time, the query result is generated by combining the partial-sums for those blocks that intersect with the query subset. To improve the query response time and reduce system storage requirements, the covering codes are preferably augmented as single-weight extended covering codes or composition-extended covering codes. Also, a second partial-sum may also be computed for each block to efficiently find its partial sum, based on the block's first partial-sums and the bit-position differences between selected codewords for the block and bit strings representing the cell indexes of the blocks intersecting with the query subset.
摘要翻译：公开了一种用于在数据库中执行部分和查询的方法和系统，其中数据被表示为多维数据立方体。数据立方体被分割成多维块。然后为每个块选择一个或多个覆盖码，并且基于其覆盖码针对每个块计算一组部分和。在查询时，通过组合与查询子集相交的那些块的部分和来生成查询结果。为了改善查询响应时间并减少系统存储要求，覆盖码优选地作为单重扩展覆盖码或组合扩展覆盖码扩充。此外，还可以针对每个块来计算第二部分和以便有效地找到其部分和，基于块的第一部分和，以及用于块的所选码字之间的比特位置差异以及表示该小区的小区索引的比特串与查询子集相交的块。

4. 发明授权

US5682470A Method and system for achieving collective consistency in detecting failures in a distributed computing system 失效
标题翻译：在分布式计算系统中实现检测故障的集体一致性的方法和系统
公开(公告)号：US5682470A
公开(公告)日：1997-10-28
申请号：US522651
申请日：1995-09-01
申请人： Cynthia Dwork , Ching-Tien Ho , Hovey Raymond Strong, Jr.
发明人： Cynthia Dwork , Ching-Tien Ho , Hovey Raymond Strong, Jr.
IPC分类号： G06F11/00 , G06F11/18
CPC分类号： G06F11/1482 , G06F11/1425
摘要： A method and apparatus are disclosed for achieving collective consistency in the detection and reporting of failures in a distributed computing system having multiple processors. Each processor is capable of being called by a parallel application for system status. Initially, each processor sends the other processors its view on the status of the processors. It then waits for similar views from other processors except those regarded as failed in its own view. If the received views are identical to the view of the processor, the processor returns its view to the parallel application. In a preferred embodiment, if the views are not identical to its view, the processor sets its view to the union of the received views and its current view. The steps are then repeated. Alternately, the steps are repeated if the processor does not have information that each of the processors not regarded as failed in its view forms an identical union view. In another preferred embodiment, the method is terminated if a quorum is not formed by the processors which are not regarded as failed. Alternatively, after sending its view, the processor waits for an exit condition. Depending on the exit condition, the processor sets its view to a quorum view and sends a "DECIDE" message to the other processors. In another embodiment, the processor updates its view and the method steps are repeated.
摘要翻译：公开了一种用于实现具有多个处理器的分布式计算系统中的故障的检测和报告中的集体一致性的方法和装置。每个处理器能够被并行应用程序调用用于系统状态。最初，每个处理器将处理器的状态发送到其他处理器。然后它等待来自其他处理器的类似视图，除了被视为在自己的视图中失败的视图。如果接收到的视图与处理器的视图相同，则处理器将其视图返回到并行应用程序。在优选实施例中，如果视图与其视图不同，则处理器将其视图设置为所接收的视图及其当前视图的并集。然后重复步骤。或者，如果处理器不具有在其视图中被认为不成功的每个处理器形成相同的联合视图的信息，则重复这些步骤。在另一个优选实施例中，如果不被认为是失败的处理器形成法定人数，则终止该方法。或者，在发送视图之后，处理器等待退出条件。根据退出条件，处理器将其视图设置为法定视图，并向其他处理器发送“决定”消息。在另一个实施例中，处理器更新其视图，并重复方法步骤。

5. 发明授权

US07512642B2 Mapping-based query generation with duplicate elimination and minimal union 失效
标题翻译：基于映射的查询生成与重复消除和最小结合
公开(公告)号：US07512642B2
公开(公告)日：2009-03-31
申请号：US11326969
申请日：2006-01-06
申请人： Mauricio Antonio Hernandez-Sherrington , Ching-Tien Ho , Lucian Popa
发明人： Mauricio Antonio Hernandez-Sherrington , Ching-Tien Ho , Lucian Popa
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F17/30587 , Y10S707/99942 , Y10S707/99943 , Y10S707/99945 , Y10S707/99955
摘要： A method and system for generating a query implementing a schema mapping. A mapping M is provided from a schema S to a schema T, where M relates S to T, and M includes a plurality of constraints. Schemas S and T each include one or more elements, and T includes at least one set type element. Mapping M is expressed in terms of at least one nested tuple-generating dependency. A query Q is generated where Q is capable of applying M to an input instance I to result in an output instance J, where I conforms to S, J conforms to T, and I and J satisfy the plurality of constraints. Instance J is in partitioned normal form (i.e., satisfies minimal union semantics) and includes no duplicate element instances.
摘要翻译：一种用于生成实现模式映射的查询的方法和系统。映射M从模式S提供到模式T，其中M将S与T相关联，并且M包括多个约束。模式S和T各自包括一个或多个元素，并且T包括至少一个集合类型元素。映射M表示为至少一个嵌套元组生成依赖关系。产生查询Q，其中Q能够将M应用于输入实例I以产生输出实例J，其中符合S，J符合T，并且I和J满足多个约束。实例J是分区正常形式（即，满足最小并集语义），并且不包括重复元素实例。

6. 发明申请

US20070174231A1 Mapping-based query generation with duplicate elimination and minimal union 失效
标题翻译：基于映射的查询生成与重复消除和最小结合
公开(公告)号：US20070174231A1
公开(公告)日：2007-07-26
申请号：US11326969
申请日：2006-01-06
申请人： Mauricio Hernandez-Sherrington , Ching-Tien Ho , Lucian Popa
发明人： Mauricio Hernandez-Sherrington , Ching-Tien Ho , Lucian Popa
IPC分类号： G06F17/30
CPC分类号： G06F17/30587 , Y10S707/99942 , Y10S707/99943 , Y10S707/99945 , Y10S707/99955
摘要： A method and system for generating a query implementing a schema mapping. A mapping M is provided from a schema S to a schema T, where M relates S to T, and M includes a plurality of constraints. Schemas S and T each include one or more elements, and T includes at least one set type element. Mapping M is expressed in terms of at least one nested tuple-generating dependency. A query Q is generated where Q is capable of applying M to an input instance I to result in an output instance J, where I conforms to S, J conforms to T, and I and J satisfy the plurality of constraints. Instance J is in partitioned normal form (i.e., satisfies minimal union semantics) and includes no duplicate element instances.
摘要翻译：一种用于生成实现模式映射的查询的方法和系统。映射M从模式S提供到模式T，其中M将S与T相关联，并且M包括多个约束。模式S和T各自包括一个或多个元素，并且T包括至少一个集合类型元素。映射M表示为至少一个嵌套元组生成依赖关系。产生查询Q，其中Q能够将M应用于输入实例I以产生输出实例J，其中符合S，J符合T，并且I和J满足多个约束。实例J是分区正常形式（即，满足最小并集语义），并且不包括重复元素实例。

7. 发明授权

US5561805A System for selectively packing together datablocks and efficiently routing independent of network topology in a parallel computer system in accordance with a selected numbering system 失效
标题翻译：用于根据所选择的编号系统选择性地将数据块打包在并行计算机系统中的与网络拓扑无关的有效路由的系统
公开(公告)号：US5561805A
公开(公告)日：1996-10-01
申请号：US965491
申请日：1992-10-22
申请人： Jehoshua Bruck , Ching-Tien Ho , Shlomo Kipnis
发明人： Jehoshua Bruck , Ching-Tien Ho , Shlomo Kipnis
IPC分类号： G06F13/12 , G06F15/173 , G06F13/00
CPC分类号： G06F15/17381
摘要： A method for routing multiple message packets to their respective destinations on a parallel system is disclosed which takes into account the value of the communication start-up time and the transmission time For the specific parallel system. The preferred embodiment involves first selecting a base using the parameters of communication start-up and transmission time and then for each datablock, subtracting the node address from the destination address of the datablock using the modulo-n subtractions to Form a relative offset and representing the relative offset in the pre-selected base before sending the datablocks to their destination nodes in phases, each phase involving scanning the individual i-th digits of the relative offset value and packing those datablocks with identical i-th digits of the relative offset together.
摘要翻译：公开了一种在并行系统上将多个消息分组路由到其各自目的地的方法，其考虑到通信启动时间和传输时间的值对于特定并行系统。优选实施例涉及使用通信启动和传输时间的参数来首先选择一个基站，然后对于每个数据块，使用模数n减法从数据块的目的地地址中减去节点地址以形成相对偏移并且表示在将数据块分阶段发送到其目的地节点之前，预先选择的基站中的相对偏移量，每个阶段涉及扫描相对偏移值的各个第i个数字，并且将具有相对偏移量的相同第i个数位的数据块打包在一起。

8. 发明申请

US20090043806A1 EFFICIENT TUPLE EXTRACTION FROM STREAMING XML DATA 审中-公开
公开(公告)号：US20090043806A1
公开(公告)日：2009-02-12
申请号：US12134080
申请日：2008-06-05
申请人： Wook-Shin Han , Ching-Tien Ho , Haifeng Jiang , Quanzhong Li
发明人： Wook-Shin Han , Ching-Tien Ho , Haifeng Jiang , Quanzhong Li
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F16/8365
摘要： A method and apparatus are disclosed for querying streaming extensible markup language (XML) data comprising: routing elements to query nodes, the elements derived from the streaming extensible markup language data; filtering out elements not conforming to one or more predetermined path query patterns; adding remaining elements to one or more dynamic element lists; accessing a decision table to select and return a query node related to a cursor element from the dynamic element lists; and processing the cursor element related to the returned query node to produce an extracted tuple output.

9. 发明申请

US20080243772A1 METHOD AND SYTSEM FOR GENERATING NESTED MAPPING SPECIFICATIONS IN A SCHEMA MAPPING FORMALISM AND FOR GENERATING TRANSFORMATION QUERIES BASED THEREON 审中-公开
标题翻译：用于在图像映射形式和用于生成基于其的变换查询中生成映射映射规范的方法和步骤
公开(公告)号：US20080243772A1
公开(公告)日：2008-10-02
申请号：US12127904
申请日：2008-05-28
申请人： Ariel Fuxman , Mauricio Antonio Hernandez-Sherrington , Ching-Tien Ho , Renee J. Miller , Paolo Papotti , Lucian Popa
发明人： Ariel Fuxman , Mauricio Antonio Hernandez-Sherrington , Ching-Tien Ho , Renee J. Miller , Paolo Papotti , Lucian Popa
IPC分类号： G06F17/30 , G06F17/00
CPC分类号： G06F17/2264 , G06F17/2785
摘要： A method and system for generating nested mapping specifications and transformation queries based thereon. Basic mappings are generated based on source and target schemas and correspondences between elements of the schemas. A directed acyclic graph (DAG) is constructed whose edges represent ways in which each basic mapping is nestable under any of the other basic mappings. Any transitively implied edges are removed from the DAG. Root mappings of the DAG are identified. Trees of mappings are automatically extracted from the DAG, where each tree of mappings is rooted at a root mapping and expresses a nested mapping specification. A transformation query is generated from the nested mapping specification by generating a first query for transforming source data into flat views of the target and a second query for nesting flat view data according to the target format. Generating the first query includes applying default Skolemization to the specification.
摘要翻译：一种用于基于此产生嵌套映射规范和转换查询的方法和系统。基于源和目标模式生成基本映射以及模式元素之间的对应关系。构造有向非循环图（DAG），其边缘表示每个基本映射在任何其他基本映射下可嵌套的方式。任何过渡性隐含边缘都从DAG中删除。确定DAG的根映射。从DAG自动提取映射树，其中每个映射树都以root映射为根，并表示嵌套映射规范。通过生成用于将源数据变换为目标的平面视图的第一查询和根据目标格式嵌套平面视图数据的第二查询，从嵌套映射规范生成转换查询。生成第一个查询包括对规范应用默认的Skolemization。

10. 发明申请

US20080243765A1 METHOD FOR GENERATING NESTED MAPPING SPECIFICATIONS IN A SCHEMA MAPPING FORMALISM 审中-公开
标题翻译：用于在图像映射形式中生成映射映射规范的方法
公开(公告)号：US20080243765A1
公开(公告)日：2008-10-02
申请号：US11693192
申请日：2007-03-29
申请人： Ariel Fuxman , Mauricio Antonio Hernandez-Sherrington , Ching-Tien Ho , Renee J. Miller , Paolo Papotti , Lucian Popa
发明人： Ariel Fuxman , Mauricio Antonio Hernandez-Sherrington , Ching-Tien Ho , Renee J. Miller , Paolo Papotti , Lucian Popa
IPC分类号： G06F7/00
CPC分类号： G06F17/2264 , G06F17/2785
摘要： A method for generating nested mapping specifications and transformation queries based thereon. Basic mappings are generated based on source and target schemas and correspondences between elements of the schemas. A directed acyclic graph (DAG) is constructed whose edges represent ways in which each basic mapping is nestable under any of the other basic mappings. Any transitively implied edges are removed from the DAG. Root mappings of the DAG are identified. Trees of mappings are automatically extracted from the DAG, where each tree of mappings is rooted at a root mapping and expresses a nested mapping specification.
摘要翻译：一种用于基于此产生嵌套映射规范和变换查询的方法。基于源和目标模式生成基本映射以及模式元素之间的对应关系。构造有向非循环图（DAG），其边缘表示每个基本映射在任何其他基本映射下可嵌套的方式。任何过渡性隐含边缘都从DAG中删除。确定DAG的根映射。从DAG自动提取映射树，其中每个映射树都以root映射为根，并表示嵌套映射规范。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式