Patent Grant
8244702
1. Field of the Invention
The present invention generally relates to data processing, and more particularly, to the modification of data through a logical framework.
2. Description of the Related Art
In commonly assigned U.S. patent application Ser. No. 10/083,075 (the '075 application), filed Feb. 22, 2002 entitled “Improved Application Flexibility Through Database Schema and Query Abstraction”, a framework was disclosed for logically viewing physical data. The framework of the '075 application provided a requesting entity (i.e., an end-user or application) with an abstract representation of physical data. In this way, the requesting entity is decoupled from the underlying physical data to be accessed. Logical queries based on the framework can be constructed without regard for the makeup of the physical data. Further, changes to the physical data do not necessitate changes to applications accessing the physical data.
In addition to accessing abstractly represented physical data (i.e., issuing queries against the data to receive results), it is desirable to modify (i.e., insert, update and delete) data based on the abstract data representation. However, changing a data repository based on an abstract modification operation requires particular knowledge about the underlying database schema. Specifically, to implement modifications to the data based on an abstract representation of a modification operation, the physical entity affected by the modification must be identified. In addition, the modification must identify related logical fields affected by the modification.
Therefore, what is needed is the ability to modify data based on an abstract data representation.
The present invention provides a method, system and article of manufacture for defining the capabilities for inserting, updating, or deleting data in a data repository based on an abstract data representation.
One embodiment provides a method of providing a logical framework for defining abstract modification operations for modifying physical data. The method includes providing an abstract model for defining an abstract modification specification logically describing an operation to modify the data, where the abstract model includes (i) a plurality of logical fields; and (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. The method further includes providing a run-time component to transform the abstract modification specification into a physical modification specification consistent with the physical data.
Another embodiment provides a computer-readable medium containing a program which, when executed by a processor, performs an operation modifying data having a particular physical data representation in a database. The operation includes generating an abstract modification specification abstractly defining a modification operation to modify the data, wherein the abstract modification specification comprises a plurality of logical field names and corresponding values, the logical field names corresponding to physical entities of the database. The abstract modification specification is then transformed into a physical modification specification consistent with the particular physical data representation according to mapping rules which map the logical fields to the physical entities. The modification operation is then executed according to the physical modification specification, whereby the data is modified.
Yet another embodiment provides 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 includes an abstract model for defining an abstract modification specification logically describing an operation to modify the data. The abstract model includes (i) a plurality of logical fields; and (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. A run-time component transforms the abstract modification specification into a physical modification specification consistent with the physical data.
Still another embodiment provides a computer comprising a memory and at least one processor, and further comprising a logical framework for defining abstract modification operations for modifying physical data. The logical framework includes an abstract model for defining an abstract modification specification logically describing an operation to modify the data, where the abstract model includes: (i) a plurality of logical fields; and (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. A run-time component transforms the abstract modification specification into a physical modification specification consistent with the physical data.
So that the manner in which the above recited features, advantages and objects of the present invention are attained and can be understood in detail, a more particular description of the invention, briefly summarized above, may be had by reference to the embodiments thereof which are illustrated in the appended drawings.
It is to be noted, however, that the appended drawings illustrate only typical embodiments of this invention and are therefore not to be considered limiting of its scope, for the invention may admit to other equally effective embodiments.
The present invention provides a method, system and article of manufacture for defining the capabilities for inserting, updating, or deleting data in a data repository based on an abstract data representation. By using an abstract representation of the data repository, the underlying physical representation can be more easily changed or replaced without affecting the application making the changes. Instead, the abstract data representation is changed with no changes required by the application. In addition, multiple abstract data representations can be defined to support different applications against the same underlying database schema that may have different default values or required fields.
In one embodiment, a particular data definition framework (referred to herein as a data repository abstraction (DRA) layer/component) is provided for accessing and modifying (inserting, updating or deleting) data independent of the particular manner in which the data is physically represented. The data may be located in a single repository (i.e., source) of data or a plurality of different data repositories. Thus, the data definition framework may provide a logical view of one or more underlying data repositories.
One embodiment of the invention is implemented as a program product for use with a computer system and described below. The program(s) of the program product defines functions of the embodiments (including the methods described herein) and can be contained on a variety of signal-bearing media. Illustrative signal-bearing media include, but are not limited to: (i) information permanently stored on non-writable storage media (e.g., read-only memory devices within a computer such as CD-ROM disks readable by a CD-ROM drive); (ii) alterable information stored on writable storage media (e.g., floppy disks within a diskette drive or hard-disk drive); or (iii) information conveyed to a computer by a communications medium, such as through a computer or telephone network, including wireless communications. The latter embodiment specifically includes information downloaded from the Internet and other networks. Such signal-bearing media, when carrying computer-readable instructions that direct the functions of the present invention, represent embodiments of the present invention.
In general, the routines executed to implement the embodiments of the invention, may be part of an operating system or a specific application, component, program, module, object, or sequence of instructions. The software of the present invention typically is comprised of a multitude of instructions that will be translated by the native computer into a machine-readable format and hence executable instructions. Also, programs are comprised of variables and data structures that either reside locally to the program or are found in memory or on storage devices. In addition, various programs described hereinafter may be identified based upon the application for which they are implemented in a specific embodiment of the invention. However, it should be appreciated that any particular nomenclature that follows is used merely for convenience, and thus the invention should not be limited to use solely in any specific application identified and/or implied by such nomenclature.
The client computer 102 includes a Central Processing Unit (CPU) 110 connected via a bus 126 to a memory 112, storage 114, an input device 116, an output device 119, and a network interface device 118. The input device 116 can be any device to give input to the client computer 102. For example, a keyboard, keypad, light-pen, touch-screen, track-ball, or speech recognition unit, audio/video player, and the like could be used. The output device 119 can be any device to give output to the user, e.g., any conventional display screen. Although shown separately from the input device 116, the output device 119 and input device 116 could be combined. For example a display screen with an integrated touch-screen, a display with an integrated keyboard, or a speech recognition unit combined with a text speech converter could be used.
The network interface device 118 may be any entry/exit device configured to allow network communications between the client computer 102 and the server computer 104 via the network 126. For example, the network interface device 118 may be a network adapter or other network interface card (NIC).
Storage 114 is preferably a Direct Access Storage Device (DASD). Although it is shown as a single unit, it could be a combination of fixed and/or removable storage devices, such as fixed disc drives, floppy disc drives, tape drives, removable memory cards, or optical storage. The memory 112 and storage 114 could be part of one virtual address space spanning multiple primary and secondary storage devices.
The memory 112 is preferably a random access memory sufficiently large to hold the necessary programming and data structures of the invention. While the memory 112 is shown as a single entity, it should be understood that the memory 112 may in fact comprise a plurality of modules, and that the memory 112 may exist at multiple levels, from high speed registers and caches to lower speed but larger DRAM chips.
Illustratively, the memory 112 contains an operating system 124. Illustrative operating systems, which may be used to advantage, include Linux and Microsoft's Windows®. More generally, any operating system supporting the functions disclosed herein may be used.
The memory 112 is also shown containing a browser program 122 that, when executed on CPU 110, provides support for navigating between the various servers 104 and locating network addresses at one or more of the servers 104. In one embodiment, the browser program 122 includes a web-based Graphical User Interface (GUI), which allows the user to display Hyper Text Markup Language (HTML) information. More generally, however, the browser program 122 may be any GUI-based program capable of rendering the information transmitted from the server computer 104.
The server computer 104 may be physically arranged in a manner similar to the client computer 102. Accordingly, the server computer 104 is shown generally comprising a CPU 130, a memory 132, and a storage device 134, coupled to one another by a bus 136. Memory 132 may be a random access memory sufficiently large to hold the necessary programming and data structures that are located on the server computer 104.
The server computer 104 is generally under the control of an operating system 138 shown residing in memory 132. Examples of the operating system 138 include IBM OS/400®, UNIX, Microsoft Windows®, and the like. More generally, any operating system capable of supporting the functions described herein may be used.
The memory 132 further includes one or more applications 140 and an abstract query interface 146. The applications 140 and the abstract query interface 146 are software products comprising a plurality of instructions that are resident at various times in various memory and storage devices in the computer system 100. When read and executed by one or more processors 130 in the server 104, the applications 140 and the abstract query interface 146 cause the computer system 100 to perform the steps necessary to execute steps or elements embodying the various aspects of the invention. The applications 140 (and more generally, any requesting entity, including the operating system 138 and, at the highest level, users) issue queries against a database. Illustrative sources against which queries may be issued include local databases 1561 . . . 156N, and remote databases 1571 . . . 157N, collectively referred to as database(s) 156-157). Illustratively, the databases 156 are shown as part of a database management system (DBMS) 154 in storage 134. More generally, as used herein, the term “databases” refers to any collection of data regardless of the particular physical representation. By way of illustration, the databases 156-157 may be organized according to a relational schema (accessible by SQL queries) or according to an XML schema (accessible by XML queries). However, the invention is not limited to a particular schema and contemplates extension to schemas presently unknown. As used herein, the term “schema” generically refers to a particular arrangement of data which is described by a data definition framework such as the DRA described herein.
In one embodiment, the queries issued by the applications 140 are defined according to an application query specification 142 included with each application 140. The queries issued by the applications 140 may be predefined (i.e., hard coded as part of the applications 140) or may be generated in response to input (e.g., user input). In either case, the queries (referred to herein as “abstract queries”) are composed using logical fields defined by the abstract query interface 146. In particular, the logical fields used in the abstract queries are defined by a data repository abstraction component 148 of the abstract query interface 146. The abstract queries are executed by a runtime component 150 which transforms the abstract queries into a form (referred to herein as a concrete query) consistent with the physical representation of the data contained in one or more of the databases 156-157. The queries may be configured to access the data and return results, or to modify (i.e., insert, delete or update) the data. The application query specification 142 and the abstract query interface 146 are further described with reference to
In one embodiment, elements of a query are specified by a user through a graphical user interface (GUI). The content of the GUls is generated by the application(s) 140. In a particular embodiment, the GUI content is hypertext markup language (HTML) content which may be rendered on the client computer systems 102 with the browser program 122. Accordingly, the memory 132 includes a Hypertext Transfer Protocol (http) server process 138 (e.g., a web server) adapted to service requests from the client computer 102. For example, the process 138 may respond to requests to access a database(s) 156, which illustratively resides on the server 104. Incoming client requests for data from a database 156-157 invoke an application 140. When executed by the processor 130, the application 140 causes the server computer 104 to perform the steps or elements embodying the various aspects of the invention, including accessing the database(s) 156-157. In one embodiment, the application 140 comprises a plurality of servlets configured to build GUI elements, which are then rendered by the browser program 122. Where the remote databases 157 are accessed via the application 140, the data repository abstraction component 148 is configured with a location specification identifying the database containing the data to be retrieved. This latter embodiment will be described in more detail below.
The logical fields specified by the application query specification 142 and used to compose the abstract query 202 are defined by the data repository abstraction component 148. In general, the data repository abstraction component 148 exposes information as a set of logical fields that may be used within a query (e.g., the abstract query 202) issued by the application 140 to specify criteria for data selection and specify the form of result data returned from a query operation. The logical fields are defined independently of the underlying data representation being used in the databases 156-157, thereby allowing queries to be formed that are loosely coupled to the underlying data representation.
In general, the data repository abstraction component 148 comprises a plurality of field specifications 2081, 2082, 2083, 2084 and 2085 (five shown by way of example), collectively referred to as the field specifications 208. Specifically, a field specification is provided for each logical field available for composition of an abstract query. Each field specification comprises a logical field name 2101, 2102, 2103, 2104, 2105 (collectively, field name 210) and an associated access method 2121, 2122, 2123, 2124, 2125 (collectively, access method 212). The access methods associate (i.e., map) the logical field names to a particular physical data representation 2141, 2142 . . . 214N in a database (e.g., one of the databases 156). By way of illustration, two data representations are shown, an XML data representation 2141 and a relational data representation 2142. However, the physical data representation 214N indicates that any other data representation, known or unknown, is contemplated.
Any number of access methods are contemplated depending upon the number of different types of logical fields to be supported. In one embodiment, access methods for simple fields, filtered fields and composed fields are provided. The field specifications 2081, 2082 and 2085 exemplify simple field access methods 2121, 2122, and 2125, respectively. Simple fields are mapped directly to a particular entity in the underlying physical data representation (e.g., a field mapped to a given database table and column). By way of illustration, the simple field access method 2121 shown in
It is noted that the data repository abstraction component 148 shown in
It is contemplated that the formats for any given data type (e.g., dates, decimal numbers, etc.) of the underlying data may vary. Accordingly, in one embodiment, the field specifications 208 include a type attribute which reflects the format of the underlying data. However, in another embodiment, the data format of the field specifications 208 is different from the associated underlying physical data, in which case an access method is responsible for returning data in the proper format assumed by the requesting entity. Thus, the access method must know what format of data is assumed (i.e., according to the logical field) as well as the actual format of the underlying physical data. The access method can then convert the underlying physical data into the format of the logical field.
By way of example, the field specifications 208 of the data repository abstraction component 148 shown in
An illustrative abstract query corresponding to the abstract query 202 shown in
Illustratively, the abstract query shown in Table I includes a selection specification (lines 005-014) containing selection criteria and a results specification (lines 015-019). In one embodiment, a selection criterion consists of a field name (for a logical field), a comparison operator (=, >, <, etc) and a value expression (what is the field being compared to). In one embodiment, result specification is a list of abstract fields that are to be returned as a result of query execution. A result specification in the abstract query may consist of a field name and sort criteria.
An illustrative instance of a data repository abstraction component 148 corresponding to the abstract query in Table I is shown in Table II below. By way of illustration, the data repository abstraction component 148 is defined using XML. However, any other language may be used to advantage.
Note that lines 004-009 correspond to the first field specification 2081 of the DRA 148 shown in
After building the data selection portion of the concrete query, the runtime component 150 identifies the information to be returned as a result of query execution. As described above, in one embodiment, the abstract query defines a list of abstract fields that are to be returned as a result of query execution, referred to herein as a result specification. A result specification in the abstract query may consist of a field name and sort criteria. Accordingly, the method 300 enters a loop at step 314 (defined by steps 314, 316, 318 and 320) to add result field definitions to the concrete query being generated. At step 316, the runtime component 150 looks up a result field name (from the result specification of the abstract query) in the data repository abstraction 148 and then retrieves a Result Field Definition from the data repository abstraction 148 to identify the physical location of data to be returned for the current logical result field. The runtime component 150 then builds (as step 318) a Concrete Query Contribution (of the concrete query that identifies physical location of data to be returned) for the logical result field. At step 320, Concrete Query Contribution is then added to the Concrete Query Statement. Once each of the result specifications in the abstract query has been processed, the query is executed at step 322.
One embodiment of a method 400 for building a Concrete Query Contribution for a logical field according to steps 310 and 318 is described with reference to
If the access method is not a filtered access method, processing proceeds from step 406 to step 412 where the method 400 queries whether the access method is a composed access method. If the access method is a composed access method, the physical data location for each sub-field reference in the composed field expression is located and retrieved at step 414. At step 416, the physical field location information of the composed field expression is substituted for the logical field references of the composed field expression, whereby the Concrete Query Contribution is generated. Processing then continues according to method 300 described above.
If the access method is not a composed access method, processing proceeds from step 412 to step 418. Step 418 is representative of any other access methods types contemplated as embodiments of the present invention. However, it should be understood that embodiments are contemplated in which less then all the available access methods are implemented. For example, in a particular embodiment only simple access methods are used. In another embodiment, only simple access methods and filtered access methods are used.
As described above, it may be necessary to perform a data conversion if a logical field specifies a data format different from the underlying physical data. In one embodiment, an initial conversion is performed for each respective access method when building a Concrete Query Contribution for a logical field according to the method 400. For example, the conversion may be performed as part of, or immediately following, the steps 404, 408 and 416. A subsequent conversion from the format of the physical data to the format of the logical field is performed after the query is executed at step 322. Of course, if the format of the logical field definition is the same as the underlying physical data, no conversion is necessary.
In one embodiment, a different single data repository abstraction component 148 is provided for each separate physical data representation 214. In an alternative embodiment, a single data repository abstraction component 148 contains field specifications (with associated access methods) for two or more physical data representations 214. In yet another embodiment, multiple data repository abstraction components 148 are provided, where each data repository abstraction component 148 exposes different portions of the same underlying physical data (which may comprise one or more physical data representations 214). In this manner, a single application 140 may be used simultaneously by multiple users to access the same underlying data where the particular portions of the underlying data exposed to the application are determined by the respective data repository abstraction component 148. This latter embodiment is described in more detail in U.S. patent application Ser. No. 10/132,228, entitled “DYNAMIC END USER SPECIFIC CUSTOMIZATION OF AN APPLICATION'S PHYSICAL DATA LAYER THROUGH A DATA REPOSITORY ABSTRACTION LAYER” and assigned to International Business Machines, Inc., which is hereby incorporated by reference in its entirety.
In any case, a data repository abstraction component 148 contains (or refers to) at least one access method which maps a logical field to physical data. To this end, as illustrated in the foregoing embodiments, the access methods describe a means to locate and manipulate the physical representation of data that corresponds to a logical field. In one embodiment, the access methods are further configured with a location specification defining a location of the data associated with the logical field. In this way, the data repository abstraction component 148 is extended to include description of a multiplicity of data sources that can be local and/or distributed across a network environment. The data sources can be using a multitude of different data representations and data access techniques. In this manner, an infrastructure is provided which is capable of capitalizing on the distributed environments prevalent today. One approach for accessing a multiplicity of data sources is described in more detail in U.S. patent application Ser. No. 10/131,984, entitled “REMOTE DATA ACCESS AND INTEGRATION OF DISTRIBUTED DATA SOURCES THROUGH DATA SCHEMA AND QUERY ABSTRACTION” and assigned to International Business Machines, Inc.
In various embodiments, numerous advantages over the prior art are provided. In one aspect, advantages are achieved by defining a loose coupling between the application query specification and the underlying data representation. Rather than encoding an application with specific table, column and relationship information, as is the case where SQL is used, the application defines data query requirements in a more abstract fashion that are then bound to a particular physical data representation at runtime. The loose query-data coupling of the present invention enables requesting entities (e.g., applications) to function even if the underlying data representation is modified or if the requesting entity is to be used with a completely new physical data representation than that used when the requesting entity was developed. In the case with a given physical data representation is modified or restructured, the corresponding data repository abstraction is updated to reflect changes made to the underlying physical data model. The same set of logical fields are available for use by queries, and have merely been bound to different entities or locations in physical data model. As a result, requesting entities written to the abstract query interface continue to function unchanged, even though the corresponding physical data model has undergone significant change. In the event a requesting entity is to be used with a completely new physical data representation different than that used when the requesting entity was developed, the new physical data model may be implemented using the same technology (e.g., relational database) but following a different strategy for naming and organizing information (e.g., a different schema). The new schema will contain information that may be mapped to the set of logical fields required by the application using simple, filtered and composed field access method techniques. Alternatively, the new physical representation may use an alternate technology for representing similar information (e.g., use of an XML based data repository versus a relational database system). In either case, existing requesting entities written to use the abstract query interface can easily migrate to use the new physical data representation with the provision of an alternate data repository abstraction which maps fields referenced in the query with the location and physical representation in the new physical data model.
In another aspect, the ease-of-use for the application builder and the end-user is facilitated. Use of an abstraction layer to represent logical fields in an underlying data repository enables an application developer to focus on key application data requirements without concern for the details of the underlying data representation. As a result, higher productivity and reduced error rates are achieved during application development. With regard to the end user, the data repository abstraction provides a data filtering mechanism, exposing pertinent data and hiding nonessential content that is not needed by a particular class end-user developing the given query.
Solutions implementing the present model use the provided abstract query specification to describe its information requirements, without regard for the location or representation of the data involved. Queries are submitted to the runtime component which uses the data repository abstraction component to determine the location and method used to access each logical piece of information represented in the query. In one embodiment, the runtime component also includes the aforementioned data caching function to access the data cache.
In one aspect, this model allows solutions to be developed independent of the physical location or representation of the data used by the solution, making it possible to easily deploy the solution to a number of different data topologies and allowing the solution to function in cases where data is relocated or reorganized over time. In another aspect, this approach also simplifies the task of extending a solution to take advantage of additional information. Extensions are made at the abstract query level and do not require addition of software that is unique for the location or representation of the new data being accessed. This method provides a common data access method for software applications that is independent of the particular method used to access data and of the location of each item of data that is referenced. The physical data accessed via an abstract query may be represented relationally (in an existing relational database system), hierarchically (as XML) or in some other physical data representation model. A multitude of data access methods are also supported, including those based on existing data query methods such as SQL and XQuery and methods involving programmatic access to information such as retrieval of data through a Web Service invocation (e.g., using SOAP) or HTTP request.
Aspects of the invention are described above with reference to accessing data for the purpose of returning results. In the case of SQL, these are SELECTION operations. However, modification operations are contemplated, including well-known modification operations such as UPDATE, INSERT, DELETE and the like. Accordingly, the following describes embodiments extending and enhancing the functionality of the abstract framework described above to support modification operations.
Referring now to
The relational data source 504 may be modified by abstract insert operations, update operations, and delete operations (collectively, abstract modification operations). Each of the abstract modification operations is implemented according to a respective abstract operation specification, i.e., an abstract insert operation specification 5061, an update operation specification 5062 and a delete operation specification 5063 (collectively, abstract operation specifications 506). The abstract operation specifications 506 are composed via the data repository abstraction component 502 according to specifications provided by a requesting entity 512 (e.g., a user/application).
In general, modification of the data source 504 requires determining the physical entity of the data source 504 being modified. Having determined the physical entity, additional logical fields, representing additional physical fields within the same physical entity to be modified, can be specified. The framework of the present application will “guide” the requesting entity 512 through the related fields rather than requiring that knowledge about a database schema at the application level.
In some embodiments, a focus field is used to advantage in constructing abstract operation specifications 506, thereby ensuring that the correct operation is performed against the underlying database. For example, a focus field referred to herein as a “seed” is used to advantage in constructing an abstract insert specification 5061 abstract update specification 5062, and an abstract delete specification 5063. The seed is used to identify the physical entity being modified and when it is necessary to identify each of the related logical fields defining a particular entity represented in the physical data. Consider, for example, the entity of “patient”. In a relational database the patient entity may be a patient information table 520 having five columns. The columns may include, for example, an “fname” column (corresponding to an individual's first name), “Iname” column, (corresponding to an individual's last name) “bdate” column, (corresponding to an individual's birth date) “id” (corresponding to a patient identifier) and “gend” column (corresponding to gender). From a logical/abstract perspective, the patient entity may be defined by the “Patient ID” logical field specification 5101, the “First Name” logical field specification 5102 and the “Last Name” logical field specification 5103. In this case, the seed may be the “Last Name” logical field, as is illustratively represented by the abstract insert specification 5061 of
In one embodiment, the seed field is determined by the requesting entity 512. That is, the first field selected by the requesting entity for a particular operation is designated as the seed field. In each case, the seed field is used to determine the physical entity to modify. In the case of the exemplary abstract insert specification 5061 and the abstract delete specification 5063 the seed field is also a required field (as specified by the data repository abstraction component 502) and are used to identify related logical fields (which in turn map to physical fields) needed to successfully implement the modification operation. In the case of insert operations, the related fields are those which will actually be modified, while in the case of delete operations the related fields are components of selection conditions needed to identify the record to delete.
Each operation will include at least one logical field, either as part of the physical entity identification criteria or as selection criteria. Each operation will include at least two logical fields for which values may (but need not be in every case) be specified, either as part of the physical entity identification criteria or as selection criteria. Generally, fields may be required or optional. “Required” means that the requesting entity must supply a value for the field because there is no suitable default value, no algorithm to generate a value and the field cannot be null. An optional field is one which does not require specification of a value by the requesting entity. Optional fields include: 1) fields that can be assigned the value of NULL; 2) fields that have an algorithm that can be used to generate a value for that field (referred to herein as “generated fields”); and 3) fields that have a defined default value in the DRA (referred to herein as “default fields”). Generated field values are generated by a value generator 524 (i.e., an algorithm). Default values are used where no name/value pair was specified for a particular field related to the entity defined by a seed field. Default values may be statically defined or generated. As an example of a generated default value, the Test Date value in the illustrative abstract delete specification 5063 defaults to the current date. The requesting entity (e.g., user) may be given the option of supplying a different value.
As an example of required and optional fields, consider the logical fields corresponding to the patient entity. It was noted above that the patient entity is logically defined by the “Patient ID” logical field specification 5101, the “First Name” logical field specification 5102 and the “Last Name” logical field specification 5103. The “First Name” logical field specification 5102 and the “Last Name” logical field specification 5103 include the required attribute and are required fields. In contrast, the other logical fields defining the patient entity (i.e., birth date and gender) are optional.
As an example, consider the case of inserts and updates to the data source 504 which provide for identification of the actual fields (i.e. columns) that are to be modified along with the new value to be put in the data source. Accordingly, a set of name/value pairs represents the fields/values within the data repository abstraction component 502 that correspond to the physical fields/values to be modified. The name represents the abstract name for the logical field that is mapped via the data repository abstraction component 502 to its underlying physical representation. The value is the abstract value to be inserted or updated in the data source for that field. In one aspect, using an abstract data model (i.e., the data repository abstraction component 502) allows for automatic conversion of abstract values to the correct physical values to be inserted into the database. For example, the data repository abstraction component 502 can be defined to use values such as “Male” and “Female” for gender when the underlying physical data repository may use values of “F” and “M” to represent those values, as illustrated by the patient information table 520, which contains a record having the value “F” in the gender (gend) column. Input values for an insert or update operation take advantage of those abstract value specifications to provide further cushion for changes to the underlying physical representation of not only the structure of the underlying data repository, but also from the physical form of the data contained within the data repository.
In many cases, an abstract field may be physically represented in multiple fields in a physical data repository. One example would be the case in the relational data source 504 where a column was defined as a foreign key to a column in another database table. For example, a patient ID may be a primary key within the patient information table 520 and may also be defined as a foreign key within the test information table 522. Although this is a typical example, an abstract relationship between two fields does not necessarily have to be enforced by a physical relationship (such as primary/foreign key) in the underlying data repository. Using metadata about the relationship between the two physical locations (i.e., relationship between column(s) in a first table to column(s) in a second table), a single field within the abstract data representation can be used to handle both physical locations for the field. The application is shielded from the knowledge of the various places a particular value is used within the database schema.
Special considerations must be taken into account when these related fields are included on an insert, update, or delete operation. When performing an insert operation, the runtime/DRA logic must recognize the various physical representations for the single abstract data field. The correct physical representation must be used based on the focus item of the insert operation. For example, if the patient identifier was represented as column “ID” in the patient information table 520 and as column “PID” in the test information table 522, the correct column name must be identified based on the table defined for the insert operation by the focus item. Additionally, these additional forms of the physical representation must be taken into account when determining default values and required values for the insert operation. For example, if the focus item identified that the underlying physical table for the operation was the test information table 522, the runtime/DRA logic must recognize that the abstract patient ID field must be considered when looking for default and required values.
Additional considerations must be given to update and delete operations when dealing with abstract fields that represent multiple locations in the physical data repository to ensure that data integrity is maintained. The underlying data repository may enforce additional restrictions on these types of fields. Relational databases provide aspects such as restricting updates or deletes to columns defined with a primary key/foreign key relationship or cascading those updates and deletes through the foreign key tables. That is, a delete against a primary table such as the patient information table 520 could be set up to indicate that the delete should cascade and delete the corresponding rows from the test information table 522 based on the primary key/foreign key relationship based on patient ID. Using an abstract representation of the data repository, the implementation can choose whether to restrict these operations or attempt to propagate the changes through the various physical entities based on the definition of the relationships for the abstract field.
In order to implement the above-described features and aspects, the data repository abstraction component 502 is configured with a plurality of attributes, which are now described.
Initially, it is noted that the details described above with respect to the data repository abstraction component 148 in
Preferably, one data repository abstraction component 502 is provided for all modifications (i.e., insert, update and delete). However, it is contemplated that a separate data repository abstraction component may be provided for each abstract modification operation.
Referring now to
Referring now to
A loop is then entered (at step 708) for the seed field and each of the related fields which define the physical entity referenced by the seed field. In particular, processing is performed to determine whether the field is a required field (at step 710), whether the value for the field is a default value (step 716), or whether the field value is generated (step 724). The field type is determined according to the attribute (i.e., the required attribute 514, the generate attribute 516 or the default attribute 518) present in the logical field specification. If the field is required (step 710), the field is added (step 712) to a required field list 714. In the case of a default attribute (step 716), the field value is initialized with a default value (step 718). Where the logical field specification includes a generate attribute 518 (step 724), the field is initialized with a generated value (step 726). In the case of both generated values and default values, the corresponding fields are added (step 720) to an optional fields list 722. If the field is not defined as any one of required, default or generated, then the field is initialized with a NULL value (step 728) and then added (step 720) to the optional field list 722. Once each identified related field is processed according to loop entered at step 708, the required fields list 714 and optional fields list 722 are provided to the requesting entity 512 at step 608 of
Having composed the abstract insert specification 5061, the insert operation may be executed.
Once the processing for the loop entered at step 808 has been performed for each logical field in the abstract insert specification 5061, the physical insert is built from the location list 814 and the value list 822 (step 824). The physical insert operation is then executed (step 806).
Referring now to
One embodiment illustrating a method 1000 of converting, and then executing, the abstract update is described with reference to
Once each of the logical fields to be updated are processed according to the loop entered at step 1004, selection logic is generated from the abstract selection (WHERE) conditions of the abstract update specification 5062 (step 1020). The run-time component 150 then builds a physical update specification from the physical location list 1010, the value location list 1018 and the selection logic (step 1022). The physical update is then executed (step 1024).
One embodiment for generating the selection logic at step 1020 of the method 1000 is shown in
Referring now to
The abstract delete specification is then used by the run-time component 150 to generate a physical delete specification. One conversion method 1300 for converting the abstract delete to a physical delete, is described with reference to
While the foregoing is directed to embodiments of the present invention, other and further embodiments of the invention may be devised without departing from the basic scope thereof, and the scope thereof is determined by the claims that follow.
This application is a continuation-in-part, and claims priority to, the following commonly owned application: U.S. patent application Ser. No. 10/083,075, filed Feb. 26, 2002 now U.S. Pat. No. 6,996,558, entitled “IMPROVED APPLICATION FLEXIBILITY THROUGH DATABASE SCHEMA AND QUERY ABSTRACTION”. This application is related to the following commonly owned applications: U.S. patent application Ser. No. 10/403,960, filed on even date herewith and entitled “SEQUENCED MODIFICATION OF MULTIPLE ENTITIES BASED ON AN ABSTRACT DATA REPRESENTATION”; U.S. patent application Ser. No. 10/132,228, entitled “DYNAMIC END USER SPECIFIC CUSTOMIZATION OF AN APPLICATION'S PHYSICAL DATA LAYER THROUGH A DATA REPOSITORY ABSTRACTION LAYER”; and U.S. patent application Ser. No. 10/131,984, entitled “REMOTE DATA ACCESS AND INTEGRATION OF DISTRIBUTED DATA SOURCES THROUGH DATA SCHEMA AND QUERY ABSTRACTION”, which are hereby incorporated herein in their entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5253362 | Nolan et al. | Oct 1993 | A |
| 5265246 | Li et al. | Nov 1993 | A |
| 5345586 | Hamala et al. | Sep 1994 | A |
| 5369778 | San Soucie et al. | Nov 1994 | A |
| 5404510 | Smith et al. | Apr 1995 | A |
| 5418950 | Li et al. | May 1995 | A |
| 5446885 | Moore et al. | Aug 1995 | A |
| 5446890 | Renslo et al. | Aug 1995 | A |
| 5459859 | Senda | Oct 1995 | A |
| 5471611 | McGregor | Nov 1995 | A |
| 5499368 | Tate et al. | Mar 1996 | A |
| 5506984 | Miller | Apr 1996 | A |
| 5515488 | Hoppe et al. | May 1996 | A |
| 5592663 | Nagamori | Jan 1997 | A |
| 5630121 | Braden-Harder et al. | May 1997 | A |
| 5701453 | Maloney et al. | Dec 1997 | A |
| 5721903 | Anand et al. | Feb 1998 | A |
| 5725227 | Mayer | Mar 1998 | A |
| 5734887 | Kingberg et al. | Mar 1998 | A |
| 5809497 | Freund et al. | Sep 1998 | A |
| 5870559 | Leshem et al. | Feb 1999 | A |
| 5918232 | Pouschine et al. | Jun 1999 | A |
| 5943666 | Kleewein et al. | Aug 1999 | A |
| 5958008 | Pogrebisky et al. | Sep 1999 | A |
| 5987446 | Corey et al. | Nov 1999 | A |
| 5999933 | Mehta | Dec 1999 | A |
| 6003034 | Tuli | Dec 1999 | A |
| 6009422 | Ciccarelli | Dec 1999 | A |
| 6014656 | Hallmark et al. | Jan 2000 | A |
| 6026363 | Shepard | Feb 2000 | A |
| 6061506 | Wollaston et al. | May 2000 | A |
| 6076066 | DiRienzo et al. | Jun 2000 | A |
| 6222540 | Sacerdoti | Apr 2001 | B1 |
| 6226650 | Mahajan et al. | May 2001 | B1 |
| 6233586 | Chang et al. | May 2001 | B1 |
| 6272488 | Chang et al. | Aug 2001 | B1 |
| 6289334 | Reiner et al. | Sep 2001 | B1 |
| 6353826 | Seputis | Mar 2002 | B1 |
| 6370547 | Eftink | Apr 2002 | B1 |
| 6397223 | Kori | May 2002 | B1 |
| 6442543 | Snodgrass et al. | Aug 2002 | B1 |
| 6449620 | Draper et al. | Sep 2002 | B1 |
| 6457003 | Gajda et al. | Sep 2002 | B1 |
| 6457009 | Bollay | Sep 2002 | B1 |
| 6460043 | Tabbara et al. | Oct 2002 | B1 |
| 6484162 | Edlund et al. | Nov 2002 | B1 |
| 6546388 | Edlund et al. | Apr 2003 | B1 |
| 6553368 | Martin et al. | Apr 2003 | B2 |
| 6578027 | Cambot et al. | Jun 2003 | B2 |
| 6581038 | Mahran | Jun 2003 | B1 |
| 6581054 | Bogrett | Jun 2003 | B1 |
| 6601065 | Nelson et al. | Jul 2003 | B1 |
| 6609123 | Cazemier et al. | Aug 2003 | B1 |
| 6611838 | Ignat et al. | Aug 2003 | B1 |
| 6618727 | Wheeler et al. | Sep 2003 | B1 |
| 6633817 | Walker et al. | Oct 2003 | B1 |
| 6643633 | Chau et al. | Nov 2003 | B2 |
| 6647382 | Saracco | Nov 2003 | B1 |
| 6651055 | Kilmer et al. | Nov 2003 | B1 |
| 6725225 | Kori | Apr 2004 | B1 |
| 6725227 | Li | Apr 2004 | B1 |
| 6732094 | Cousins et al. | May 2004 | B1 |
| 6745178 | Emens et al. | Jun 2004 | B1 |
| 6772150 | Whitman et al. | Aug 2004 | B1 |
| 6795825 | Rishe | Sep 2004 | B2 |
| 6803927 | Sahoo | Oct 2004 | B1 |
| 6820076 | Bailey et al. | Nov 2004 | B2 |
| 6928431 | Dettinger et al. | Aug 2005 | B2 |
| 6954748 | Dettinger et al. | Oct 2005 | B2 |
| 6978324 | Black | Dec 2005 | B1 |
| 6985912 | Mullins et al. | Jan 2006 | B2 |
| 6996558 | Dettinger et al. | Feb 2006 | B2 |
| 7003730 | Dettinger et al. | Feb 2006 | B2 |
| 7024425 | Krishnaprasad et al. | Apr 2006 | B2 |
| 7054877 | Dettinger et al. | May 2006 | B2 |
| 7096217 | Dettinger et al. | Aug 2006 | B2 |
| 7096229 | Dettinger et al. | Aug 2006 | B2 |
| 7139774 | Dettinger et al. | Nov 2006 | B2 |
| 7146376 | Dettinger et al. | Dec 2006 | B2 |
| 7185317 | Fish et al. | Feb 2007 | B2 |
| 7213017 | Rys et al. | May 2007 | B2 |
| 7249118 | Sandler et al. | Jul 2007 | B2 |
| 7263517 | Sheu et al. | Aug 2007 | B2 |
| 7305656 | Fish et al. | Dec 2007 | B2 |
| 7310639 | Dettinger et al. | Dec 2007 | B2 |
| 7321895 | Dettinger et al. | Jan 2008 | B2 |
| 7333981 | Dettinger et al. | Feb 2008 | B2 |
| 7340475 | Chowdhary et al. | Mar 2008 | B2 |
| 7343365 | Farnham et al. | Mar 2008 | B2 |
| 7363287 | Kilmer et al. | Apr 2008 | B2 |
| 7383255 | Desai et al. | Jun 2008 | B2 |
| 7398263 | Dettinger et al. | Jul 2008 | B2 |
| 7440945 | Dettinger et al. | Oct 2008 | B2 |
| 7444332 | Dettinger et al. | Oct 2008 | B2 |
| 7461052 | Dettinger et al. | Dec 2008 | B2 |
| 7480648 | Adams et al. | Jan 2009 | B2 |
| 7519577 | Brundage et al. | Apr 2009 | B2 |
| 7539662 | Dettinger et al. | May 2009 | B2 |
| 7624097 | Dettinger et al. | Nov 2009 | B2 |
| 7668806 | Liu et al. | Feb 2010 | B2 |
| 7818347 | Dettinger et al. | Oct 2010 | B2 |
| 7818348 | Dettinger et al. | Oct 2010 | B2 |
| 20010016843 | Olson et al. | Aug 2001 | A1 |
| 20010037345 | Kiernan et al. | Nov 2001 | A1 |
| 20010047270 | Gusick et al. | Nov 2001 | A1 |
| 20020026630 | Schmidt et al. | Feb 2002 | A1 |
| 20020032676 | Reiner et al. | Mar 2002 | A1 |
| 20020046281 | Cope | Apr 2002 | A1 |
| 20020078068 | Krishnaprasad et al. | Jun 2002 | A1 |
| 20020091702 | Mullins | Jul 2002 | A1 |
| 20020091990 | Little et al. | Jul 2002 | A1 |
| 20020123984 | Prakash | Sep 2002 | A1 |
| 20020161602 | Dougherty et al. | Oct 2002 | A1 |
| 20030014399 | Hansen et al. | Jan 2003 | A1 |
| 20030046385 | Vincent | Mar 2003 | A1 |
| 20030046390 | Ball et al. | Mar 2003 | A1 |
| 20030061215 | Messina | Mar 2003 | A1 |
| 20030144994 | Wen et al. | Jul 2003 | A1 |
| 20030154191 | Fish et al. | Aug 2003 | A1 |
| 20030163455 | Dettinger et al. | Aug 2003 | A1 |
| 20030169284 | Dettinger et al. | Sep 2003 | A1 |
| 20030172056 | Dettinger et al. | Sep 2003 | A1 |
| 20030208458 | Dettinger et al. | Nov 2003 | A1 |
| 20030208486 | Dettinger et al. | Nov 2003 | A1 |
| 20030212666 | Basu et al. | Nov 2003 | A1 |
| 20030214525 | Esfahany | Nov 2003 | A1 |
| 20030217033 | Sandler et al. | Nov 2003 | A1 |
| 20030220893 | Dettinger et al. | Nov 2003 | A1 |
| 20040039736 | Kilmer et al. | Feb 2004 | A1 |
| 20040039820 | Colby et al. | Feb 2004 | A1 |
| 20040048233 | Matthews et al. | Mar 2004 | A1 |
| 20040059746 | Error et al. | Mar 2004 | A1 |
| 20040073539 | Dettinger et al. | Apr 2004 | A1 |
| 20040088561 | Dettinger et al. | May 2004 | A1 |
| 20040148278 | Milo et al. | Jul 2004 | A1 |
| 20040158567 | Dettinger et al. | Aug 2004 | A1 |
| 20040172305 | Soerensen et al. | Sep 2004 | A1 |
| 20040243545 | Boone et al. | Dec 2004 | A1 |
| 20040260685 | Pfleiger et al. | Dec 2004 | A1 |
| 20040260691 | Desai et al. | Dec 2004 | A1 |
| 20040267760 | Brundage et al. | Dec 2004 | A1 |
| 20050068489 | Hall et al. | Mar 2005 | A1 |
| 20050071222 | Bigus et al. | Mar 2005 | A1 |
| 20050075996 | Dettinger et al. | Apr 2005 | A1 |
| 20050076015 | Dettinger et al. | Apr 2005 | A1 |
| 20050193114 | Colby et al. | Sep 2005 | A1 |
| 20050267760 | Meyer et al. | Dec 2005 | A1 |
| 20060010127 | Dettinger et al. | Jan 2006 | A1 |
| 20060047638 | Dettinger et al. | Mar 2006 | A1 |
| 20060053142 | Sebbane | Mar 2006 | A1 |
| 20060095457 | Glasspool et al. | May 2006 | A1 |
| 20060122993 | Dettinger et al. | Jun 2006 | A1 |
| 20060136382 | Dettinger et al. | Jun 2006 | A1 |
| 20060136469 | Dettinger et al. | Jun 2006 | A1 |
| 20060136470 | Dettinger et al. | Jun 2006 | A1 |
| 20060155692 | Dettinger et al. | Jul 2006 | A1 |
| 20060161521 | Dettinger et al. | Jul 2006 | A1 |
| 20060161523 | Dettinger et al. | Jul 2006 | A1 |
| 20060212418 | Dettinger et al. | Sep 2006 | A1 |
| 20060282469 | Pan | Dec 2006 | A1 |
| 20070005566 | Bobick et al. | Jan 2007 | A1 |
| 20070067371 | Allan et al. | Mar 2007 | A1 |
| 20070112745 | Dettinger et al. | May 2007 | A1 |
| 20070112827 | Dettinger et al. | May 2007 | A1 |
| 20080091668 | Dettinger et al. | Apr 2008 | A1 |
| 20080215611 | Dettinger et al. | Sep 2008 | A1 |
| 20080215612 | Dettinger et al. | Sep 2008 | A1 |
| 20080301108 | Dettinger et al. | Dec 2008 | A1 |
| 20090055438 | Dettinger et al. | Feb 2009 | A1 |
| 20090182708 | Dettinger et al. | Jul 2009 | A1 |
| 20100076961 | Dettinger et al. | Mar 2010 | A1 |
| Number | Date | Country |
|---|---|---|
| 2002149697 | May 2002 | JP |
| Number | Date | Country | |
|---|---|---|---|
| 20030167274 A1 | Sep 2003 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 10083075 | Feb 2002 | US |
| Child | 10403366 | US |
