Iterate-aggregate query parallelization
    21.
    发明授权
    Iterate-aggregate query parallelization 有权
    迭代聚合查询并行化

    公开(公告)号:US07680765B2

    公开(公告)日:2010-03-16

    申请号:US11616712

    申请日:2006-12-27

    IPC分类号: G06F17/30

    摘要: Iterate-aggregate shape queries are executable in an efficient parallel manner. Techniques are utilized that leverage properties of aggregations to implement such a query in a highly parallelized manner utilizing one or both of vertical and horizontal parallelism. More specifically, queries can be recursively evaluated in parallel utilizing partitioning and repartitioning mechanisms. Distributed query execution results over a subset of input data are repartitioned and aggregated to produce a final result.

    摘要翻译: 迭代聚合形状查询可以以高效的并行方式执行。 利用利用聚合的属性来利用垂直和水平并行度中的一个或两个以高度并行化的方式实现这种查询的技术。 更具体地,可以使用分区和重新分配机制来并行地递归地评估查询。 重新分区和聚合输入数据子集上的分布式查询执行结果,以产生最终结果。

    Profile-driven data layout optimization
    22.
    发明授权
    Profile-driven data layout optimization 有权
    配置文件驱动的数据布局优化

    公开(公告)号:US07496909B2

    公开(公告)日:2009-02-24

    申请号:US11069232

    申请日:2005-02-28

    IPC分类号: G06F9/45 G06F12/00

    摘要: Data layout optimization arranges data members within memory to enhance software performance. Profiling data is consulted to determine how to group data members for an object class into groups. One technique groups the data members based on how frequently the data members are referenced in memory. Another technique groups the data members based on their affinities for one another in time as determined by observing when references to the data members take place. A variety of options when collecting the profiling data and grouping the data members is supported. The data member grouping is recorded in metadata associated with a definition of the object class. At runtime, a class loader places the data members of an object in memory according to the metadata. Data members of different groups can be placed in separately-loadable units of memory in the memory system. Subsequently, when the data members are referenced in memory, more frequently referenced data members, including those that tend to be referenced at times close to each other, reside at neighboring locations in the memory system.

    摘要翻译: 数据布局优化将数据成员安排在内存中以增强软件性能。 查询分析数据以确定如何将对象类的数据成员分组。 一种技术根据数据成员在内存中引用的频率来对数据成员进行分组。 另一种方法是根据数据成员的相关性在时间上对数据成员进行分组,通过观察对数据成员的引用进行确定。 支持收集分析数据和分组数据成员时的各种选项。 数据成员分组被记录在与对象类的定义相关联的元数据中。 在运行时,类加载器根据元数据将对象的数据成员放置在内存中。 不同组的数据成员可以被放置在存储器系统中的可分离的存储单元中。 随后,当在存储器中引用数据成员时,更频繁地引用的数据成员(包括倾向于在彼此接近的时间被引用的数据成员)驻留在存储器系统中的相邻位置处。

    SEPARABLE INTEGRATION VIA HIGHER-ORDER PROGRAMMING
    23.
    发明申请
    SEPARABLE INTEGRATION VIA HIGHER-ORDER PROGRAMMING 审中-公开
    通过高级编程可分离整合

    公开(公告)号:US20090030659A1

    公开(公告)日:2009-01-29

    申请号:US11781519

    申请日:2007-07-23

    IPC分类号: G06F17/10

    CPC分类号: G06F17/5009

    摘要: Separable integration is provided for simulation contexts where modeling and integration can be considered separately when programmatically implementing the simulations, for example. Thus, modeling concepts can be defined relating to the simulation, and integration of the modeling concept can happen separately to provide more variety to meet modeling specifications. In one embodiment, a state-space form equation can be computed for a modeling concept equation (an equation of motion, for example) and an integration scheme can be applied to the state-space form equation regardless of the modeling equation from which it was computed. In this regard, integration can be focused on to provide a plurality of schemes for different contexts, for example.

    摘要翻译: 提供了可分离的集成,用于模拟上下文,例如,当以编程方式实现模拟时,可以单独考虑建模和集成。 因此,可以定义与模拟相关的建模概念,并且建模概念的集成可以单独发生,以提供更多种类以满足建模规范。 在一个实施例中,可以针对建模概念方程(例如运动方程)计算状态空间形式方程,并且可以将积分方案应用于状态空间形式方程,而不管其是哪个建模方程 计算。 在这方面,例如,集成可以集中于为不同的上下文提供多个方案。

    TIER SPLITTING SUPPORT FOR DISTRIBUTED EXECUTION ENVIRONMENTS
    24.
    发明申请
    TIER SPLITTING SUPPORT FOR DISTRIBUTED EXECUTION ENVIRONMENTS 有权
    分散执行环境的分层支持

    公开(公告)号:US20080196025A1

    公开(公告)日:2008-08-14

    申请号:US11674041

    申请日:2007-02-12

    IPC分类号: G06F9/445

    CPC分类号: G06F8/45

    摘要: A spectrum of tier-splitting mechanisms facilitates distributed programming. A rich application model and associated tools enable programmers to write rich distributed applications that can run anywhere. A program can be developed simply as a single tier or tier agnostic application. Subsequently or concurrently, the program can be sliced into multiple tiers in different ways to reflect, for instance, capabilities and/or constraints of a server, client and/or network.

    摘要翻译: 一系列分层机制有助于分布式编程。 丰富的应用程序模型和相关工具使程序员能够编写可在任何地方运行的丰富的分布式应用程序。 一个程序可以简单地被开发为单层或一层不可知应用程序。 随后或同时地,程序可以以不同的方式被分成多个层,以反映例如服务器,客户机和/或网络的能力和/或约束。

    CONCEPT OF RELATIONSHIPSETS IN ENTITY DATA MODEL (EDM)
    26.
    发明申请
    CONCEPT OF RELATIONSHIPSETS IN ENTITY DATA MODEL (EDM) 审中-公开
    实体数据模型(EDM)中的关系概念

    公开(公告)号:US20070266041A1

    公开(公告)日:2007-11-15

    申请号:US11468008

    申请日:2006-08-29

    IPC分类号: G06F17/30 G06F7/00

    CPC分类号: G06F16/288

    摘要: The claimed subject matter provides a system and/or a method that facilitates addressing complex modeling. An entity data model that can receive data via an interface and that formalizes a notion of at least one of a Relationship, a Relationship instance, and a Relationship Set in a manner substantially similar to at least one of an Entity type, an Entity instance, and an entity-set respectively, wherein a semantic related to the at least one of the Relationship, the Relationship instance, and the Relationship Set are captured as metadata in the same manner as metadata is captured for at least one of the Entity type, the Entity instance, and the Entity-set, respectively.

    摘要翻译: 所要求保护的主题提供了有助于寻址复杂建模的系统和/或方法。 实体数据模型,其可以经由接口接收数据并以与实体类型,实体实例中的至少一个实质上相似的方式形式化关系,关系实例和关系集中的至少一个的概念, 以及实体集合,其中与所述关系,所述关系实例和所述关系集合中的至少一个相关的语义以与为所述实体类型,所述实体集合中的至少一个被捕获的元数据相同的方式被捕获为元数据 实体实例和实体集。

    Profile-driven data layout optimization

    公开(公告)号:US07013459B2

    公开(公告)日:2006-03-14

    申请号:US10987408

    申请日:2004-11-12

    IPC分类号: G06F9/45 G06F12/00

    摘要: Data layout optimization arranges data members within memory to enhance software performance. Profiling data is consulted to determine how to group data members for an object class into groups. One technique groups the data members based on how frequently the data members are referenced in memory. Another technique groups the data members based on their affinities for one another in time as determined by observing when references to the data members take place. A variety of options when collecting the profiling data and grouping the data members is supported. The data member grouping is recorded in metadata associated with a definition of the object class. At runtime, a class loader places the data members of an object in memory according to the metadata. Data members of different groups can be placed in separately-loadable units of memory in the memory system. Subsequently, when the data members are referenced in memory, more frequently referenced data members, including those that tend to be referenced at times close to each other, reside at neighboring locations in the memory system.

    Profile-driven data layout optimization

    公开(公告)号:US06862729B1

    公开(公告)日:2005-03-01

    申请号:US09542525

    申请日:2000-04-04

    摘要: Data layout optimization arranges data members within memory to enhance software performance. Profiling data is consulted to determine how to group data members for an object class into groups. One technique groups the data members based on how frequently the data members are referenced in memory. Another technique groups the data members based on their affinities for one another in time as determined by observing when references to the data members take place. A variety of options when collecting the profiling data and grouping the data members is supported. The data member grouping is recorded in metadata associated with a definition of the object class. At runtime, a class loader places the data members of an object in memory according to the metadata. Data members of different groups can be placed in separately-loadable units of memory in the memory system. Subsequently, when the data members are referenced in memory, more frequently referenced data members, including those that tend to be referenced at times close to each other, reside at neighboring locations in the memory system.

    Representation of an interactive document as a graph of entities
    29.
    发明授权
    Representation of an interactive document as a graph of entities 有权
    将交互式文档表示为实体图

    公开(公告)号:US09336184B2

    公开(公告)日:2016-05-10

    申请号:US12972205

    申请日:2010-12-17

    IPC分类号: G06F17/00 G06F17/21 G06F17/24

    CPC分类号: G06F17/21 G06F17/246

    摘要: Techniques for representing and publishing an interactive document useful for analyzing data. The document may be represented as a directed acyclic graph of entities interconnected by edges. The entities may be of multiple types. Yet, a broad range of interactive documents may be represented by a limited number of types of entities and the capabilities to interconnect entities of different types and to share a data schema across entities of different types. A tool may enable a user to author such documents. The tool may also facilitate publishing of the document. For publishing, the document may be converted to an executable form. Prior to such a conversion, the graph may be modified for more efficient processing. The graph may also be partitioned such that portions of the graph, when distributed across tiers of a computing system, such as a cloud-based platform, execute on computing devices that provide efficient operation.

    摘要翻译: 用于表示和发布用于分析数据的交互式文档的技术。 文档可以被表示为通过边缘互连的实体的有向非循环图。 实体可以是多种类型。 然而,广泛的交互式文档可以由有限数量的实体类型表示,并且能够互连不同类型的实体并且跨越不同类型的实体共享数据模式。 一个工具可以使用户能够提供这样的文档。 该工具还可以促进文档的发布。 对于发布,文档可能会转换为可执行形式。 在进行这种转换之前,可以修改图表以进行更有效的处理。 该图也可以被分区,使得当分布在诸如基于云的平台的计算系统的层上时,图的部分在提供有效操作的计算设备上执行。

    Assisted filtering of multi-dimensional data
    30.
    发明授权
    Assisted filtering of multi-dimensional data 有权
    辅助过滤多维数据

    公开(公告)号:US08965907B2

    公开(公告)日:2015-02-24

    申请号:US12819493

    申请日:2010-06-21

    IPC分类号: G06F17/00 G06F17/30

    摘要: Interactive and dynamic exploring of filter criteria for large amounts of numerical data having multiple dimensions is described. Exploration occurs without excessive amounts of computation or querying of a database based on a data set summary that may be obtained from a server in a search system and applied by a client device. A data set is summarized so as to capture relationships between distributions of items in the data set along multiple dimensions. To explore filter criteria, a user may interactively adjust a range of values that act as a filter criteria along a dimension and determine an effect on a distribution of items along another dimension. The client device may apply the data summary in reverse to determine, based on user input specifying aspects of a distribution along one dimension, filter criteria for another dimension that would result in the specified distribution.

    摘要翻译: 描述了具有多个维度的大量数值数据的过滤器标准的交互和动态探索。 基于可以从搜索系统中的服务器获得并由客户端设备应用的数据集摘要,发现没有过多的计算或查询数据库的探索。 总结数据集,以便捕获沿着多维的数据集中的项目的分布之间的关系。 为了探索过滤标准,用户可以交互地调整一系列值,这些值作为沿尺寸的过滤标准,并确定对另一维的物品分布的影响。 客户端设备可以相反地应用数据摘要,以基于指定沿着一个维度的分布的方面的用户输入来确定导致指定分布的另一个维度的过滤标准。