Set definition language for relational data

• US 20050050030A1
• Filed: 07/20/2004
• Published: 03/03/2005
• Est. Priority Date: 01/30/2003
• Status: Abandoned Application

• Current Assignee: Decode Genetics Ehf.
• Original Assignee: Decode Genetics Ehf.
• Inventors: Palmason, Vilmundur, Gudbjartsson, Hakon, Rovensky, Pavol, Arnarson, Thorvaldur S.
• Application Number:
  US10/895,620
• Publication Number:
  US 20050050030A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/284 Relational databases

Abstract

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.

Claims

1. In a computer system, a method of defining sets of data to be retrieved from a data store, comprising the steps of:

providing a written representation of a desired data set in terms of dimensions and relation instances, the desired data set having a certain set type;

implying constraints on relation instances or dimensions based on the set type of the desired data set and dimension expressions, and

using the written representation to query the data store and retrieve the desired data set, including enforcing expressions that have predicates on multiple attributes per conjunct in a non-ambiguous way using automatic record-locking such that the predicates on attributes from a same relation are automatically enforced on a same record.

2. A method as claimed in claim 1 further comprising the step of:

enforcing non-ambiguous expressions with multiple concrete dimensions or virtual dimensions or both, using automatic record-locking based on a minimum cursor principle.

3. A method as claimed in claim 1 wherein the written representation makes multiple references to a same attribute;

and

the step of enforcing utilizes explicit record-locking based on a minimum cursor principle.

4. A method as claimed in claim 1 wherein the step of providing a written representation includes using an expression with extended virtual relations, said extended virtual relations including one of (i) predicates on dimensions and (ii) a WHERE clause within a record operator.

5. A method as claimed in claim 4 wherein the expression further uses nested record-operators.

6. A method as claimed in claim 1 wherein the step of providing a written representation includes using an expression with extended virtual relations having dimensions from more than one relation, and further comprising the step of transparently assembling the virtual relations with equi-joins or outer-joins of primary dimensions, based on the predicates in the extended virtual relation.

7. A method as claimed in claim 6 wherein the extended virtual relation can contain virtual dimensions;

and

further comprising the step of transparently generating and assembling the virtual relations based on a minimum cursor principle and path expressions of the corresponding virtual dimensions.

8. A method as claimed in claim 7 wherein extended virtual relations are used as relations in SQL.

9. A method as claimed in claim 7 wherein the extended virtual relation may include aggregate operators;

and

further comprising the step of automatically applying SQL GROUP BY conditions and predicates within each relation based on the dimensions listed in the output of the given extended virtual relation or the dimension within a nested record operator.

10. In a computer system, apparatus for defining sets of data to be retrieved from a data store, comprising:

an input component for providing a written representation of a desired data set in terms of dimensions and relation instances, the desired data set having a certain set type; and

an assembly coupled to receive the written representation, in response the assembly implying constraints on relation instances or dimensions by one of the set type of the desired data set and dimension expressions, and

wherein the written representation has an expression with predicates on multiple attributes per relation, the assembly enforces the expression using automatic record-locking such that the predicates on attributes from a same relation are automatically enforced on a same record.

11. Apparatus as claimed in claim 10 wherein the assembly enforces non-ambiguous expressions with multiple concrete dimensions or virtual dimensions or both, using automatic record-locking based on a minimum cursor principle.

12. Apparatus as claimed in claim 10 wherein the expression has multiple references to a same attribute, the assembly enforces the expression using explicit record-locking based on a minimum cursor principle.

13. Apparatus as claimed in claim 10 wherein the written representation has an expression with an extended virtual relation, the extended virtual relation including one of (i) predicates on dimensions and (ii) a WHERE clause within a record operator.

14. Apparatus as claimed in claim 13 wherein the expression further uses nested record-operators.

15. Apparatus as claimed in claim 10 wherein the written representation has an expression with an extended virtual relation having dimensions from more than one relation;

and

the assembly performs an equi-join between the relations that only have non-null dimensions.

16. Apparatus as claimed in claim 15 wherein the extended virtual relation can contain virtual dimensions;

and

the assembly generates and assembles the virtual relations based on a minimum cursor principle and path expressions of the corresponding virtual dimensions.

17. Apparatus as claimed in claim 16 wherein extended virtual relations are used as relations in SQL.

18. Apparatus as claimed in claim 16 wherein the extended virtual relation may include aggregate operators;

and

the assembly applies SQL GROUP BY conditions and predicates within each relation based on the dimensions listed in the output of the given extended virtual relation or the dimension within a nested record operator.