-
公开(公告)号：US09052956B2
公开(公告)日：2015-06-09
申请号：US13599869
申请日：2012-08-30
CPC分类号： G06F9/5038 , G06F9/5055
摘要： Disclosed herein are techniques for selecting execution environments. Each operation in a sequence of operations is implemented using a selected execution environment. Each operation is converted into code executable in the selected execution environment. If some operations in the sequence were implemented in different execution environments, execution of the operations is coordinated.
摘要翻译： 这里公开了用于选择执行环境的技术。 使用所选择的执行环境来实现一系列操作中的每个操作。 每个操作都会在选定的执行环境中转换为可执行代码。 如果序列中的某些操作在不同的执行环境中实现，则协调执行操作。
-
公开(公告)号：US08719769B2
公开(公告)日：2014-05-06
申请号：US12543357
申请日：2009-08-18
CPC分类号： G06F17/30592 , G06F9/4494
摘要： A method for quality objective-based ETL pipeline optimization is provided. An improvement objective is obtained from user input into a computing system. The improvement objective represents a priority optimization desired by a user for improved ETL flows for an application designed to run in memory of the computing system. An ETL flow is created in the memory of the computing system. The ETL flow is restructured for flow optimization with a processor of the computing system. The flow restructuring is based on the improvement objective. Flow restructuring can include application of flow rewriting optimization or application of an algebraic rewriting optimization. The optimized ETL flow is stored as executable code on a computer readable storage medium.
摘要翻译： 提供了一种基于质量目标的ETL流水线优化方法。 从用户输入计算系统获得改进目标。 改进目标表示用户期望的改进ETL流的优先级优化，用于设计为在计算系统的存储器中运行的应用。 在计算系统的存储器中创建ETL流。 ETL流程通过计算系统的处理器进行重组以进行流量优化。 流程重组是基于改进目标。 流程重组可以包括流重写优化的应用或代数重写优化的应用。 优化的ETL流程作为可执行代码存储在计算机可读存储介质上。
-
公开(公告)号：US08719722B2
公开(公告)日：2014-05-06
申请号：US12721431
申请日：2010-03-10
CPC分类号： G06F17/30445 , G06F17/30463
摘要： A method of producing a representation of the progress of a process being performed on a database may be embodied in a data processing system. The method may include obtaining for each of a plurality of subprocesses included in the database process an estimated rate of using a system resource during execution of the subprocess and an estimated volume of data to be processed. The actual rate of using the first system resource and the actual volume of data processed during execution of the at least one subprocess may be determined for at least one of the plurality of subprocesses. An output signal may be generated that is representative of the estimated and actual rates and the estimated and actual volumes of data for the at least one subprocess.
摘要翻译： 可以在数据处理系统中实现产生对数据库执行的进程的进展的表示的方法。 该方法可以包括：在包含在数据库处理过程中的多个子过程中的每一个获取在子处理的执行期间使用系统资源的估计速率和估计的要处理的数据量。 可以为多个子处理中的至少一个确定使用第一系统资源的实际速率和在执行至少一个子过程期间处理的数据的实际体积。 可以生成代表估计和实际速率以及至少一个子过程的估计和实际数据量的输出信号。
-
公开(公告)号：US20140068056A1
公开(公告)日：2014-03-06
申请号：US13605665
申请日：2012-09-06
IPC分类号： G06F15/173
CPC分类号： G06F9/5011 , G06F9/5072 , G06F9/5094 , G06F2209/5014 , G06F2209/508 , Y02D10/22 , Y02D10/36
摘要： A computer cluster with objectives-based resource sharing. The cluster includes cloud nodes each with one or more resources, a terminal, data storage, and an allocation node to monitor cloud node resources, provide information descriptive of the cloud node resources to a customer through the terminal, receive a reservation for cloud node resources from the customer, store the reservation in the data storage, determine assignments of the cloud node resources for the reservation and any other pending reservations according to one or more objectives, and allocate the cloud node resources to customers according to the resource assignments.
摘要翻译： 具有基于目标的资源共享的计算机集群。 集群包括每个具有一个或多个资源的云节点，终端，数据存储和分配节点，用于监视云节点资源，通过终端向客户提供描述云节点资源的信息，接收云节点资源的预留 根据一个或多个目标，从客户将预留存储在数据存储器中，确定用于预留的云节点资源的分配和任何其他挂起的预留，并且根据资源分配将云节点资源分配给客户。
-
公开(公告)号：US20130290296A1
公开(公告)日：2013-10-31
申请号：US13457093
申请日：2012-04-26
IPC分类号： G06F17/30
CPC分类号： G06F17/30386 , G06F17/30501 , G06F17/30958
摘要： A system, method, and non-transitory computer readable medium are provided to access a graph comprising a plurality of nodes and at least one edge. Each node is associated with at least one database operation. Computer code is constructed that corresponds to the graph in accordance with a nesting level. The nesting level represents a degree of temporary storage to be allocated for intermediate output produced by the at least one database operation.
摘要翻译： 提供了一种系统，方法和非暂时计算机可读介质来访问包括多个节点和至少一个边缘的图形。 每个节点与至少一个数据库操作相关联。 根据嵌套级别构建对应于图形的计算机代码。 嵌套级别表示要分配给由至少一个数据库操作产生的中间输出的临时存储的程度。
-
公开(公告)号：US20130097604A1
公开(公告)日：2013-04-18
申请号：US13274317
申请日：2011-10-15
IPC分类号： G06F9/46
CPC分类号： G06F9/46 , G06F17/30563 , G06Q10/06
摘要： A computer implemented method and apparatus calculate a freshness cost for each of a plurality of information integration flow graphs and select one of the plurality of information integration flow graphs based upon the calculated freshness cost.
摘要翻译： 计算机实现的方法和装置计算多个信息集成流程图中的每一个的新鲜度成本，并且基于计算的新鲜度成本来选择多个信息集成流程图中的一个。
-
公开(公告)号：US20130097592A1
公开(公告)日：2013-04-18
申请号：US13274316
申请日：2011-10-15
IPC分类号： G06F9/45
CPC分类号： G06Q10/0633 , G06F8/10
摘要： A computer implemented method and apparatus display an information integration flow graph, receive user input selecting a modification to apply to the displayed information integration flow graph and modify the information integration flow graph based on the selected modification to form a modified information integration flow graph, wherein the modified information integration flow graph is displayed.
摘要翻译： 计算机实现的方法和装置显示信息集成流程图，接收用户输入选择适用于显示的信息集成流程图的修改，并且基于所选择的修改来修改信息集成流程图以形成修改的信息集成流程图，其中 显示修改后的信息集成流程图。
-
8.发明申请SYSTEM AND METHOD FOR DETERMINING INTERVALS OF A SPACE FILLING CURVE IN A QUERY BOX 有权用于确定查询器中空间填充曲线的间隔的系统和方法公开(公告)号：US20100185692A1
公开(公告)日：2010-07-22
申请号：US12356479
申请日：2009-01-20
申请人： Bin Zhang , William K. Wilkinson
发明人： Bin Zhang , William K. Wilkinson
IPC分类号： G06F17/30
CPC分类号： G06F17/30333 , G06F17/30327
摘要： A system and method is disclosed for determining intervals of a space filling curve in a query box. The method includes the operation of providing a range query-box contained within a data set, wherein the data set has a plurality of elements in N dimensions. A space filling curve is applied to the data set. The space filling curve contacts each of the elements in the N dimensions. The space filling curve is also applied to a range-query box contained within the data set. An entry point of the space filling curve into the query box is determined. A first endpoint box is formed to cover an hquad of the space filling curve at the entry point that includes P×P elements, with a first value of P selected as one. The value of P is increased to expand the endpoint box around a next larger hquad of the space filling curve, until a size of the endpoint box is maximized without exiting the range-query box. The interval of the space filling curve in the endpoint box can then be determined.
摘要翻译： 公开了一种用于确定查询框中空间填充曲线的间隔的系统和方法。 该方法包括提供包含在数据集中的范围查询框的操作，其中数据集具有N维中的多个元素。 空间填充曲线应用于数据集。 空间填充曲线接触N维中的每个元素。 空间填充曲线也应用于数据集中包含的范围查询框。 确定查询框中空格填充曲线的入口点。 第一端点盒形成为覆盖包括P×P元素在内的入口点处的空间填充曲线的四分之一，其中P的第一值被选择为一。 增加P的值，以扩大空格填充曲线的下一个更大的h的四边形框，直到端点框的大小最大化，而不退出范围查询框。 然后可以确定端点框中空间填充曲线的间隔。
-
公开(公告)号：US08745038B2
公开(公告)日：2014-06-03
申请号：US12712943
申请日：2010-02-25
IPC分类号： G06F17/30
CPC分类号： G06Q10/06
摘要： Computer-based methods, computer-readable storage media and computer systems are provided for optimizing integration flow plans. An initial integration flow plan, one or more objectives and/or an objective function related to the one or more objectives may be received as input. A computing cost of the initial integration flow plan may be compared with the objective function. Using one or more heuristics, a set of close-to-optimal integration flow plans may be identified from all possible integration flow plans that are functionally equivalent to the initial integration flow plan. A close-to-optimal integration flow plan with a lowest computing cost may be selected from the set as a replacement for the initial integration flow plan.
摘要翻译： 提供基于计算机的方法，计算机可读存储介质和计算机系统，用于优化集成流程图。 可以接收初始集成流程图，与一个或多个目标相关的一个或多个目标和/或目标函数作为输入。 可以将初始集成流程图的计算成本与目标函数进行比较。 使用一个或多个启发式，可以从功能上等同于初始集成流程图的所有可能的集成流程图中识别出一组接近最优化的集成流程图。 可以从集合中选择具有最低计算成本的接近最优的集成流程计划，作为初始集成流程图的替代。
-
公开(公告)号：US20130226939A1
公开(公告)日：2013-08-29
申请号：US13406090
申请日：2012-02-27
申请人： William K. Wilkinson
发明人： William K. Wilkinson
IPC分类号： G06F17/30
CPC分类号： G06F17/30648 , G06F17/30696 , G06F17/30705
摘要： A search method includes the step of creating a list of candidate probe words. For each candidate probe word, the number of item descriptions that contain the candidate probe word is counted. Q probe words are chosen whose word count most equally divides the number of remaining item descriptions into q+1 subgroups. The q probe words are presented for selection. Based on the selection, the list of probe words is pruned to eliminate items that that were not selected. The counting step, choosing step, presenting step and pruning step are repeated until a final list of items remain.
摘要翻译： 搜索方法包括创建候选探测词列表的步骤。 对于每个候选探测字，计数包含候选探测字的项目描述的数量。 选择Q个探测词，其词数最多等于将剩余项目描述数分成q + 1个子组。 提供q探测词供选择。 根据选择，修剪探测单词列表以消除未选择的项目。 重复计数步骤，选择步骤，呈现步骤和修剪步骤，直到最后的项目列表保留。
-
-
-
-
-
-
-
-
-
搜索结果
46 条记录 (耗时 0.03 秒)
