Decode Genetics Ehf

Hakon Gudbjartsson

Agust Sverrir Egilsson

Skeggi Thormar

Pavol Rovensky

Vilmundur Palmason

Sverrir Karlsson

Thorvaldur S Arnarson

This invention provides an automated system for the processing of data packets, composed of personal identifiers and personal data, such that the personally identifiable data sent by one party may be considered anonymous once received by a second party. The invention uses secret sharing techniques to facilitate distributed key management of the mapping functions and strong authentication to allow the system to be operated remotely.

Automatic identity protection system with remote third party monitoring

The present invention relates to the usage pattern, commonly found in many software applications, of defining sets of objects based on object attributes. A specifically designed set definition language for defining sets, called SDL, is described and a software system that implements this language efficiently on top of a standard relational database management system (RDBMS) is presented. The unique features of the SDL language are the implicit constraints that are enforced on the relational data that belong to the objects. Unique to the SDL system is also the logical metadata of dimensions that enables the SDL system to enforce these constraints across relations. The SDL system utilizes several optimization techniques to enable efficient implementation on top of RDBMS. It is also shown how the SDL language and the SQL language can be merged with bidirectional inlining using syntactic gates. Query composition tools are also described that facilitate the creation of SDL expressions.

Method and system for defining sets by querying relational data using a set definition language

The invention discloses methods and apparatus that facilitate efficient querying of tables referencing semistructured data such as digraphs and other domains with complex grouping structure. The invention methods enable meaningful indexing of the tables as well as rewriting of queries with respect to the structures. Dynamic schema extraction using proper coloring algorithms is disclosed that structures the semistructured data in such a way that complex set operations and grouping are replaced with traditional relational joins. This enables a relational database system to harness its entire query optimizing capability when querying tables referencing semistructured data.

Indexing, rewriting and efficient querying of relations referencing semistructured data

The current invention discloses methods for transforming a set of relations into multidimensional data cubes. A syntheses process is disclosed that dynamically and with minimal user input eliminates ambiguities when populating a data cube by introducing table-like virtual relations. The methods are generic and applicable to many data warehouse designs. The methods support relational OLAP for a wider variety of data and structures than possible using current relational implementation schemas.

Populating data cubes using calculated relations

The current mechanism discloses methods for transforming a set of heterogeneous relations into multidimensional data cubes. A syntheses process is disclosed that dynamically and with minimal user input eliminates ambiguities in a populated hypercube. Including, ambiguities reflecting dependencies between dimensions in the hypercube as well as reflecting the need for supporting points in the cube with realistic observations. The hypercubes also support complex dimension structures, complex operations and hierarchies that are not necessary regular or of aggregation type. The methods are generic and applicable to any data warehouse design. The methods enable relational OLAP for a wider variety of data and structures than possible using current relational implementation schemas.

Online syntheses programming technique

A method/operator is disclosed that modifies dimension structures and relations during processing in a multidimensional data cube. The online &ldquo;blowup&rdquo; operator disclosed uses one or more hierarchical structures to expand a hypercube in order to reveal internal connections between attributes in relations associated with the hypercube. The operator is generic and may be applied to any dimension using hierarchical structures to guide the process. Furthermore, it is applicable to any data warehouse design. The methods enable a user, performing multidimensional analysis, to view, online, internal connections between attributes when going from one level to another in the hierarchical structures. Such as when comparing complex health related statistics for individuals across different age periods or for individuals versus their ancestors. The methods disclosed, facilitate OLAP for more complex data than current designs do.

Online modifications of dimension structures in multidimensional processing

A method/operator is disclosed that adjusts measurements during processing in a multidimensional data cube. The online &ldquo;depth-of-field&rdquo; operator disclosed varies the density of points in a representation of the multidimensional cube. The operator may be applied to any collection of dimensions and relations supported by the dimensions, using hierarchical structures to control the adjustments. It allows one to experiment online with the definition of relations during multidimensional possessing, thereby controlling the output of the synthesizing process. The operator may be used to equate attributes based on their hierarchical positions when processing measurements in a hypercube. Furthermore, it may be used to reveal hidden dependencies between variables when working with measurements with varying levels of granularity. As is the case when processing health related data for individuals or when processing heterogeneous relations from different sources such as a combination of measurements about individuals, their ancestors and the environment. The methods disclosed are generic and applicable to any data warehouse design and enable OLAP for a wider variety of data and structures than current implementation schemas.

Growing community of inventors

Reykjavik, Iceland

Hakon Gudbjartsson