公开(公告)号：US20120158793A1

公开(公告)日：2012-06-21

申请号：US13406405

申请日：2012-02-27

Applicant: Jens-Peter Dittrich ,  Olaf Meincke ,  Guenter Radestock ,  Andrew Ross

Inventor： Jens-Peter Dittrich ,  Olaf Meincke ,  Guenter Radestock ,  Andrew Ross

IPC: G06F17/30

CPC classification number: G06F16/284 ,  Y10S707/99942

Abstract: In business systems, one or more methods can be used to reduce an amount of redundant data. In one implementation, a method to reduce redundancy within a data model in a database, in which the data model is represented by at least one table, includes determining a number of distinct values of partial keys in a table. Each partial key represents at least one row in the table. The method includes reordering one or more columns of the table by cardinality of partial keys, in which the cardinality of a partial key represents a number of distinct values of the partial key. The method further includes determining whether pairs of partial keys are functionally dependent and eliminating one or more columns having functional dependencies from the table.

Abstract translation: 在业务系统中，可以使用一种或多种方法来减少冗余数据量。 在一个实现中，减少数据库中的数据模型中的冗余的方法，其中数据模型由至少一个表表示，包括确定表中部分密钥的不同值的数量。 每个部分键表示表中的至少一行。 该方法包括通过部分键的基数对表的一个或多个列重新排序，其中部分键的基数表示部分键的不同值的数量。 该方法还包括确定部分密钥对是否在功能上相关并且消除具有来自该表的功能依赖性的一个或多个列。

公开(公告)号：US08126855B2

公开(公告)日：2012-02-28

申请号：US13219499

申请日：2011-08-26

Applicant: Franz Faerber ,  Guenter Radestock ,  Andrew Ross

Inventor： Franz Faerber ,  Guenter Radestock ,  Andrew Ross

IPC: G06F17/30

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

公开(公告)号：US08073834B2

公开(公告)日：2011-12-06

申请号：US12813041

申请日：2010-06-10

Applicant: Franz X. Faerber ,  Christian M. Bartholomae ,  Erich Marschall ,  Stefan Dipper ,  Guenter Radestock

Inventor： Franz X. Faerber ,  Christian M. Bartholomae ,  Erich Marschall ,  Stefan Dipper ,  Guenter Radestock

IPC: G06F17/30

CPC classification number: G06F17/30501 ,  Y10S707/99933

Abstract: A query having multiple parts may be processed to form an intermediate results set. This intermediate results set may be partitioned into a plurality of groups. Thereafter, the groups may be sorted into a plurality of containers so that each container contains data sufficient to calculate one requested result in the multipart query. Related techniques, apparatuses, systems, and computer program products are also described.

Abstract translation: 可以处理具有多个部分的查询以形成中间结果集。 该中间结果集可以被划分成多个组。 此后，组可以被分类成多个容器，使得每个容器包含足以在多部分查询中计算一个请求结果的数据。 还描述了相关技术，装置，系统和计算机程序产品。

公开(公告)号：US07979421B2

公开(公告)日：2011-07-12

申请号：US11960598

申请日：2007-12-19

Applicant: Guenter Radestock ,  Oliver M. Steinau

Inventor： Guenter Radestock ,  Oliver M. Steinau

IPC: G06F7/00 ,  G06F17/30

CPC classification number: G06F17/30657 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99943

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

公开(公告)号：US07546306B2

公开(公告)日：2009-06-09

申请号：US11357402

申请日：2006-02-16

Applicant: Franz-X. Faerber ,  Wolfgang Stephan ,  Christian M. Bartholomae ,  Guenter Radestock

Inventor： Franz-X. Faerber ,  Wolfgang Stephan ,  Christian M. Bartholomae ,  Guenter Radestock

IPC: G06F17/00

CPC classification number: G06F17/30442 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99942 ,  Y10S707/99944

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

公开(公告)号：US20080294863A1

公开(公告)日：2008-11-27

申请号：US11805186

申请日：2007-05-21

Applicant: Franz Faerber ,  Guenter Radestock ,  Andrew Ross

Inventor： Franz Faerber ,  Guenter Radestock ,  Andrew Ross

IPC: G06F12/02

CPC classification number: G06F17/30153 ,  G06F17/30315 ,  G06F17/30321 ,  H03M7/3084 ,  H03M7/3088

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

公开(公告)号：US10089342B2

公开(公告)日：2018-10-02

申请号：US14328511

申请日：2014-07-10

Applicant: Reza Sherkat ,  Guenter Radestock ,  Ivan Schreter ,  Colin Florendo ,  Mihnea Andrei ,  Anil Kumar Goel

Inventor： Reza Sherkat ,  Guenter Radestock ,  Ivan Schreter ,  Colin Florendo ,  Mihnea Andrei ,  Anil Kumar Goel

IPC: G06F17/30

Abstract: A compression manager may store, within an index vector, a plurality of value identifiers (IDs), each value ID representing a value within a database. A page generator may designate a number of the value IDs as defining a page within the index vector, so that the index vector includes a plurality of pages, each page including the number of value IDs. The page generator may store the index vector in a secondary memory of a main memory database. An iterator may access a requested value ID, and a page loader may load a corresponding page of the index vector that contains the requested value ID into the main memory database.

公开(公告)号：US09852169B2

公开(公告)日：2017-12-26

申请号：US14275709

申请日：2014-05-12

Applicant: Franz Faerber ,  Guenter Radestock ,  Andrew Ross

Inventor： Franz Faerber ,  Guenter Radestock ,  Andrew Ross

IPC: G06F17/30 ,  H03M7/30

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.

公开(公告)号：US20160012089A1

公开(公告)日：2016-01-14

申请号：US14328511

申请日：2014-07-10

Applicant: Reza SHERKAT ,  Guenter RADESTOCK ,  Ivan SCHRETER ,  Colin FLORENDO ,  Mihnea ANDREI ,  Anil Kumar GOEL

Inventor： Reza SHERKAT ,  Guenter RADESTOCK ,  Ivan SCHRETER ,  Colin FLORENDO ,  Mihnea ANDREI ,  Anil Kumar GOEL

IPC: G06F17/30

CPC classification number: G06F17/30324 ,  G06F17/30153 ,  G06F17/30315

Abstract: A compression manager may store, within an index vector, a plurality of value identifiers (IDs), each value ID representing a value within a database. A page generator may designate a number of the value IDs as defining a page within the index vector, so that the index vector includes a plurality of pages, each page including the number of value IDs. The page generator may store the index vector in a secondary memory of a main memory database. An iterator may access a requested value ID, and a page loader may load a corresponding page of the index vector that contains the requested value ID into the main memory database.

Abstract translation: 压缩管理器可以在索引向量内存储多个值标识符（ID），每个值ID表示数据库内的值。 页面生成器可以将多个值ID指定为在索引向量内定义页面，使得索引向量包括多个页面，每个页面包括值ID的数量。 页面生成器可以将索引矢量存储在主存储器数据库的辅助存储器中。 迭代器可以访问请求的值ID，并且页面加载器可以将包含所请求的值ID的索引向量的相应页面加载到主存储器数据库中。

公开(公告)号：US08032499B2

公开(公告)日：2011-10-04

申请号：US11805178

申请日：2007-05-21

Applicant: Franz Faerber ,  Guenter Radestock ,  Andrew Ross

Inventor： Franz Faerber ,  Guenter Radestock ,  Andrew Ross

IPC: G06F17/30

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