Dealing with composite data through data model entities

• US 7,054,877 B2
• Filed: 03/31/2003
• Issued: 05/30/2006
• Est. Priority Date: 03/31/2003
• Status: Active Grant

• Current Assignee: Huawei Technologies Co., Ltd. (Huawei Investment & Holding Co., Ltd.)
• Original Assignee: International Business Machines Corporation
• Inventors: Dettinger, Richard D., Tenner, Jeffrey W., Stevens, Richard J., LaRocca, Jennifer L.
• Primary Examiner(s): Corrielus, Jean M.
• Assistant Examiner(s): Ly, Anh
• Application Number:
  US10/403,356
• Publication Number:
  US 20040193579A1
• Time in Patent Office: 1,156 Days
• Field of Search: 707/1, 707/10, 707/100
• US Class Current: 707/718
• CPC Class Codes: G06F 16/2428 Query predicate definition using graphical user interfaces, including menus and forms G06F16/2423 takes precedence
• CPC Class Codes: Y10S 707/962 Entity-attribute-value
• CPC Class Codes: Y10S 707/99931 Database or file accessing
• CPC Class Codes: Y10S 707/99932 Access augmentation or optimizing
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99936 Pattern matching access
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation
• CPC Class Codes: Y10S 707/99952 Coherency, e.g. same view to multiple users

Abstract

The present invention is generally directed to a system, method and article of manufacture for accessing data represented abstractly through an abstraction model. In one embodiment, a data repository abstraction layer provides a logical view of an underlying data repository that is independent of the particular manner of data representation. A query abstraction layer is also provided and is based on the data repository abstraction layer. A runtime component performs conversion of an abstract query (i.e., a request for results or a request to modify data) into a form that can be used against a particular physical data representation. Abstract and/or physical queries are transformed according to model entities which define a relationship between logical fields of the data repository abstraction layer.

Claims

1. A method of providing a logical framework for defining abstract operations for accessing physical data comprising a plurality of physical entities each comprising a plurality of physical fields, the method comprising:

providing an abstract model for defining abstract operation specifications logically descnbing operations to access the data, the abstract model comprising;

(a) a plurality of logical fields;

(b) a mapping rule for each of the plurality of logical fields, which map each of the plurality of logical fields to at least one of the physical entities of the data; and

(c) a plurality of model entity definitions, each comprising at least one logical field corresponding to a physical entity;

providing an interface from which each of the plurality of model entity definitions is selectable in generating an abstract operation specification to access the data of the physical entity corresponding to a selected model entity definition; and

providing a run-time component to transform, according to the abstract model, the abstract operation specifications into physical operation specifications consistent with the physical data.

2. The method of claim 1, wherein each of the plurality of physical entities is a table in a database.

3. The method of claim 1, wherein each physical operation specification is selected from one of an insert statement and a delete statement.

4. The method of claim 1, wherein each physical operation specification is a query.

5. The method of claim 1, wherein the abstract operation specification is an abstract query and the interface is a user interface, and further comprising:

receiving, via the user interface, the abstract query comprising a plurality of query conditions, result fields and a selection of one of the model entity definitions;

accessing the model entity definition corresponding to the selection;

determining whether the model entity definition corresponding to the selection specifies one or more required result fields; and

if so, adding the one or more required result fields to the query.

6. The method of claim 1, wherein the abstract operation specification is an abstract query and the interface is a user interface, and further comprising:

receiving, via the user interface, the abstract query comprising a plurality of query conditions, result fields and a selection of one of the model entity definitions;

determining whether the abstract query includes more than one ANDed query condition for a given logical field; and

if so, determining whether a one-to-many relationship exists between the selected model entity definition and a physical entity corresponding to the given logical field.

7. The method of claim 6, further comprising, if the one-to-many relationship exists, generating a query contribution against an additional instance of the physical entity corresponding to the given logical field.

8. The method of claim 7, further comprising:

generating a result field contribution for the abstract query; and

generating correlation logic between each physical entity involved in the abstract query.

9. The method of claim 1, wherein run-time transforms, according to the abstract model, a single abstract operation specification into at least two separate physical operation specifications consistent with the physical data, wherein each physical operation specification modifies a different physical entity of the data and wherein each physical operation specifications is ordered for execution according to a physical entity relationships specification defining hierarchical relationships between the physical entities of the data.

10. The method of claim 9, wherein the single abstract operation specification comprises a plurality of logical field names.

11. The method of claim 1, further comprising:

issuing, by a requesting entity, a request to execute a single abstract operation specification; and

transforming, by the mn-time component, the single abstract operation specification into the at least two physical operation specifications for modifying the data.

12. The method of claim 11, wherein transforming the single abstract operation specification into the at least two physical operation specifications comprises:

generating the at least two physical operation specifications; and

ordering the at least two physical operation specifications according to a physical entity relationships specification of the abstract model.

13. The method of claim 12, wherein at least one of the logical fields represents two or more data locations in the physical data and wherein the abstract model further comprises a restriction rule for the at least one logical field wherein the restriction rule specifies that modification operations on the at least one logical field are restricted to one of the two or more data locations.

14. The method of claim 13, wherein the two or more data locations comprise a primary key table and a foreign key table.

15. The method of claim 12, wherein at least one of the logical fields represents two or more data locations in the physical data and wherein the abstract model further comprises a propagate rule for the at least one logical field wherein the propagate rule specifies that modification operations on the at least one logical field are propagated to all of the two or more data locations.

16. The method of claim 15, wherein the two or more data locations comprise a primary key table and a foreign key table.

17. The method of claim 12, wherein the ordering comprises determining a primary-secondary relationship between corresponding physical entities of the at least two physical operation specifications to ensure integrity of the data.

18. The method of claim 12, wherein the at least two physical operation specifications are insert statements and further comprising placing the at least two insert statements in a list after the building, and wherein the ordering comprises:

for a given one of the at least two insert statements, determining a corresponding physical entity affected by the given one insert statement;

for each of the other insert statements of the at least two insert statements which are at a position after the given one insert statement in the list;

determining whether the corresponding physical entity affected by the given one insert statement and a corresponding physical entity affected by the other insert statement of the at least two insert statement are related as secondary and primary, respectively; and

if so, moving the given one insert statement to a position after the corresponding physical entity affected by the other insert statement of the at least two insert statements.

19. The method of claim 18, further comprising repeating the ordering for each of the at least two insert statements until the list can be traversed without encountering a insert statement having a corresponding entity which is secondary with respect to a corresponding entity of a subsequent insert statement in the list.

20. The method of claim 12, wherein the at least two physical modification statements are delete statements and further comprising placing the at least two delete statements in a list after the building, and wherein the ordering comprises:

for a given one of the at least two delete'"'"' statements, determining a corresponding physical entity affected by the given one delete statement;

for each of the other delete statements of the at least two delete statements which are at a position after the given one delete statement in the list;

determining whether the corresponding physical entity affected by the given delete statement and a corresponding physical entity affected by the other delete statement of the at least two delete statements are related as primary and secondary, respectively; and

if so, moving the given one delete statement to a position after the corresponding physical entity affected by the other delete statement of the at least two delete statements.

21. The method of claim 20, further comprising repeating the ordering for each of the at least two delete statements until the list can be traversed without encountering a delete statement having a corresponding entity which is primary with respect to a corresponding entity of a subsequent delete statement in the list.

22. The method of claim 1, wherein each mapping rule comprises an access method for one of the plurality of logical fields.

23. The method of claim 22, wherein the access method describes a location of the physical entities of the data.

24. A computer-readable medium containing a program which, when executed by a processor provides a logical framework for defining abstract modification operations for modifying physical data, the program comprising:

an abstract model for defining an abstract modification specification logically describing operations to access the data the abstract model comprising;

(i) a plurality of logical fields;

(ii) a mapping rule for each of the plurality of logical fields, which map the plurality of logical fields to physical entities of the data;

(iii) a plurality of model entity definitions, each comprising at least two logical fields each corresponding to a separate physical entity; and

(iv) a physical entity relationships specification defining interrelationships between the physical entities of the data, and a run-time component configured with;

(i) transformation instructions to transform an abstract modification specification, comprising logical fields selected according to a selected model entity definition, into at least two physical modification statements consistent with the physical data, wherein each of the at least two physical modification statements modifies a different physical entity of the data; and

(ii) ordering instructions to order the at least two physical modification statements according to the physical entity relationships specification.

25. The computer-readable medium of claim 24, further comprising a user interface from which each of the plurality of model entity definitions is selectable.

26. The computer-readable medium of claim 24, wherein each model entity definition comprises a first set of logical fields for insert operations and a second set of logical fields for delete operations.

27. The computer-readable medium of claim 24, wherein the abstract modification specification comprises a plurality of logical field names and corresponding values.

28. The computer-readable medium of claim 24, wherein the mapping rules comprise an access method for each of the plurality of logical fields, wherein the access method describes a location of the physical entities of the data.