Object metamodel comprising views on a join graph
    31.
    发明申请
    Object metamodel comprising views on a join graph 有权
    对象元模型包含连接图上的视图

    公开(公告)号:US20070192343A1

    公开(公告)日:2007-08-16

    申请号:US11357402

    申请日:2006-02-16

    Abstract: A method is disclosed for modeling application-level objects in terms of join graphs defined over tables containing structured data residing in a relational database. In accordance with the disclosed metamodel, each object is modeled logically as a join graph. A query received from an application that requests the return of objects meeting certain conditions is reformulated to refer to the metamodel. The metamodel includes an index structure having a plurality of indexes and a set of join conditions that specify relationships between the indexes. Some series of join conditions form join paths, such that each join path originates on an anchor table and ends on a table corresponding to one of the plurality of indexes. The metamodel further includes at least one view representing a subgraph of the join graph having at least one anchor table as a key.

    Abstract translation: 公开了一种用于根据驻留在关系数据库中的包含结构化数据的表定义的连接图来对应用程序级对象进行建模的方法。 根据所公开的元模型,每个对象被逻辑地建模为连接图。 从请求返回满足某些条件的对象的应用程序接收到的查询被重新配置为引用元模型。 元模型包括具有多个索引的索引结构和指定索引之间的关系的一组连接条件。 一些连接条件的一系列形成连接路径,使得每个连接路径起始于锚定表,并且结束于与多个索引之一相对应的表。 元模型还包括表示具有至少一个锚表作为关键字的连接图的子图的至少一个视图。

    Mapping data structures
    32.
    发明申请
    Mapping data structures 有权
    映射数据结构

    公开(公告)号:US20070136323A1

    公开(公告)日:2007-06-14

    申请号:US11302855

    申请日:2005-12-13

    CPC classification number: G06F17/30592 Y10S707/99943

    Abstract: Systems and techniques for mapping data structures in a data processing environment to help ensure the accessibility of stored information. In one implementation, an article includes a machine-readable medium storing instructions. The instructions are operable to cause one or more machines to perform operations. The operations include receiving a first data storage schema in which a characteristic in a first dimension table is mapped by a first table and a second table and generating a second data storage schema. The first table maps the characteristic to a first object that include attributes to which time information is irrelevant to data processing activities and the second table maps the characteristic to a second object that include attributes to which time information is relevant to data processing activities. The second data storage schema includes a fact table including at least some facts drawn from the first data storage schema and a second dimension table that includes at least some characteristics drawn from at least one of the first object and the second object.

    Abstract translation: 用于在数据处理环境中映射数据结构的系统和技术,以帮助确保存储信息的可访问性。 在一个实现中,物品包括存储指令的机器可读介质。 该指令可操作以使一个或多个机器执行操作。 操作包括接收第一数据存储模式,其中通过第一表和第二表映射第一维表中的特征,并生成第二数据存储模式。 第一表将特征映射到第一对象,其包括时间信息与数据处理活动无关的属性,第二表将特征映射到第二对象,第二对象包括时间信息与数据处理活动相关的属性。 第二数据存储模式包括包括从第一数据存储模式中提取的至少一些事实的事实表以及包括从第一对象和第二对象中的至少一个绘制的至少一些特征的第二维度表。

    Test and verification framework
    34.
    发明授权
    Test and verification framework 有权
    测试和验证框架

    公开(公告)号:US07185235B2

    公开(公告)日:2007-02-27

    申请号:US10306797

    申请日:2002-11-27

    CPC classification number: G06F11/3688

    Abstract: Systems and techniques to test a software product in one or more computer systems. In general, in one implementation, the technique includes calling components in a first computer system during execution of a test, recording the calls, and rerunning the recorded calls in a second computer system in order to recreate the behavior of the first computer system during execution of the test.

    Abstract translation: 在一个或多个计算机系统中测试软件产品的系统和技术。 通常,在一个实现中,该技术包括在执行测试期间在第一计算机系统中呼叫组件,记录呼叫,以及在第二计算机系统中重新运行所记录的呼叫,以便在执行期间重新创建第一计算机系统的行为 的测试。

    Fast search with very large result set
    35.
    发明申请
    Fast search with very large result set 有权
    快速搜索非常大的结果集

    公开(公告)号:US20050222984A1

    公开(公告)日:2005-10-06

    申请号:US10816011

    申请日:2004-03-31

    Abstract: Methods and apparatus, including computer systems and program products, for executing a query on a subset of data, for example, to facilitate a fast search with a very large result set. In one general aspect, a method of executing a query includes receiving a query for execution on data in the data repository; generating an estimate of a number of results of the query; defining a subset of data in the data repository; determining whether to execute the query on the subset of the data; executing the query on the subset of the data to generate a partial set of results if the query is to be executed on the subset of the data, otherwise executing the query on the data repository to generate a complete set of results; and providing query results.

    Abstract translation: 用于执行关于数据子集的查询的方法和装置,包括计算机系统和程序产品,以便于用非常大的结果集进行快速搜索。 在一个一般方面,执行查询的方法包括:接收对数据存储库中的数据执行的查询; 产生查询结果的数量估计值; 定义数据存储库中的数据子集; 确定是否对数据子集执行查询; 如果要在数据的子集上执行查询,则对数据的子集执行查询以生成部分结果集合,否则在数据存储库上执行查询以生成完整的一组结果; 并提供查询结果。

    Automatic reduction of table memory footprint using column cardinality information
    36.
    发明申请
    Automatic reduction of table memory footprint using column cardinality information 有权
    使用列基数信息自动减少表内存占用

    公开(公告)号:US20050192998A1

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

    申请号:US10789370

    申请日:2004-02-26

    CPC classification number: G06F17/30321 G06F17/30312 Y10S707/99942

    Abstract: In a business system, one or more methods can be used to reduce an amount of redundancy in the storage of data. One implementation includes a method of reducing a memory footprint of a database table having multiple rows and one or more columns, in which each of the one or more columns has a cardinality, and the cardinality is a total number of different values in the rows of each column. The method includes comparing the cardinality with a total number of possible values in the rows of at least one column based on a width of the column. The method also includes reducing the width of the column if the cardinality is less than a threshold based on the total number of possible values in the rows of the column.

    Abstract translation: 在业务系统中,可以使用一种或多种方法来减少数据存储中的冗余量。 一个实施方案包括一种减少具有多个行和一个或多个列的数据库表的存储器占用的方法,其中一个或多个列中的每一个具有基数,并且基数是行中的不同值的总数 每列。 该方法包括基于列的宽度将基数与至少一列的行中的可能值的总数进行比较。 如果基数小于阈值,则该方法还包括基于列的行中的可能值的总数来减小列的宽度。

    COMPRESSION OF TABLES BASED ON OCCURRENCE OF VALUES
    37.
    发明申请
    COMPRESSION OF TABLES BASED ON OCCURRENCE OF VALUES 有权
    基于价值观的表格压缩

    公开(公告)号:US20140250090A1

    公开(公告)日:2014-09-04

    申请号:US14275709

    申请日:2014-05-12

    CPC classification number: G06F17/30324 G06F17/30477 H03M7/30

    Abstract: Methods and apparatus, including computer program products, for compression of tables based on occurrence of values. In general, a number representing an amount of occurrences of a frequently occurring value in a group of adjacent rows of a column is generated, a vector representing whether the frequently occurring value exists in a row of the column is generated, and the number and the vector are stored to enable searches of the data represented by the number and the vector. The vector may omit a portion representing the group of adjacent rows. The values may be dictionary-based compression values representing business data such as business objects. The compression may be performed in-memory, in parallel, to improve memory utilization, network bandwidth consumption, and processing performance.

    Abstract translation: 方法和装置,包括计算机程序产品,用于根据值的发生压缩表。 通常,生成表示列的相邻行的频繁发生值的出现次数的数字,生成表示列的行中是否存在频繁出现的值的向量,并且生成数量和 存储矢量以使得能够搜索由数字和矢量表示的数据。 向量可以省略表示相邻行的组的部分。 这些值可以是表示业务数据(例如业务对象)的基于字典的压缩值。 可以并行地在内存中执行压缩,以提高存储器利用率,网络带宽消耗和处理性能。

    Block compression of tables with repeated values
    38.
    发明授权
    Block compression of tables with repeated values 有权
    用重复的值块压缩表

    公开(公告)号:US07769729B2

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

    申请号:US11805186

    申请日:2007-05-21

    Abstract: Methods and apparatus, including computer program products, for block compression of tables with repeated values. In general, value identifiers representing a compressed column of data may be sorted to render repeated values contiguous, and block dictionaries may be generated. A block dictionary may be generated for each block of value identifiers. Each block dictionary may include a list of block identifiers, where each block identifier is associated with a value identifier and there is a block identifier for each unique value in a block. Blocks may have standard sizes and block dictionaries may be reused for multiple blocks.

    Abstract translation: 方法和装置,包括计算机程序产品,用于块重复值压缩表。 通常,表示压缩数据列的值标识符可以被排序以使重复值连续,并且可以生成块字典。 可以为每个值标识符块生成块字典。 每个块字典可以包括块标识符的列表,其中每个块标识符与值标识符相关联,并且在块中存在每个唯一值的块标识符。 块可以具有标准尺寸,并且块字典可以重用于多个块。

    Fast aggregation of compressed data using full table scans
    40.
    发明授权
    Fast aggregation of compressed data using full table scans 有权
    使用全表扫描快速聚合压缩数据

    公开(公告)号:US07650326B2

    公开(公告)日:2010-01-19

    申请号:US11780013

    申请日:2007-07-19

    Abstract: Methods and apparatus, including computer systems and program products, relating to an information management system and aggregating data by performing table scans. In general, in one aspect, the technique includes receiving a query for a response to a search on a database, loading data from the database into memory, filtering the data based on the query to generate a list of results, buffering at least one key figure corresponding to a result, buffering at least one dimension value corresponding to each key figure, aggregating the dimension values to generate an aggregate key, aggregating key figures corresponding to the sane aggregate key to generate one or more aggregate key figures, and displaying the response to the search on a display device. Loading the data may include compressing the data. Filtering the data may be performed blockwise.

    Abstract translation: 涉及信息管理系统的方法和装置,包括计算机系统和程序产品,并通过执行表扫描来聚合数据。 通常,在一个方面,该技术包括接收对数据库上的搜索的响应的查询,将数据从数据库加载到存储器中,基于查询过滤数据以生成结果列表,缓冲至少一个密钥 图形对应于结果,缓冲对应于每个关键字图形的至少一个维度值,聚合维度值以生成聚合密钥,聚合对应于合理聚合密钥的关键字数据,以生成一个或多个聚合密钥数字,以及显示响应 在显示设备上进行搜索。 加载数据可能包括压缩数据。 数据的过滤可以是块状的。

Patent Agency Ranking