1. Field of the Invention
The present invention is directed to improvements in computing systems and in particular to improvements in operability between application programming interfaces (APIs) and stored procedures interacting with the APIs when software upgrades or modifications are made to either one or both of the API and/or stored procedures.
2. Description of the Prior Art
Stored procedures are collections of pre-defined procedural code that are used to perform one or more tasks such as, for example, to access databases. There are a number of benefits in using stored procedures, including function encapsulation, performance enhancement, client-server processing, and security. Generally, a user explicitly invokes stored procedures in an interactive environment, but such procedures can also be invoked by other programs.
In today's software systems, an application may rely one or more of the stored procedures for various services. An application interfaces with the stored procedures or other applications through an application program interface (API). Such application integration allows an application to provide services without having to include the programming and data necessary to provide the services itself.
For example, a content management system (CMS) may rely on a database application for maintaining large amounts of information such as binary large objects (BLOBs) and character large objects (CLOBs). Stored procedures are utilized by the CMS to efficiently communicate with a database management system (DBMS). The CMS communicates with the stored procedures via a set of APIs in order to access the database information. The APIs are typically built in their own dynamic link library (DLL). The CMS may load the provided DLL and use the appropriate APIs for maintaining the BLOBs, CLOBs and other information stored in the database.
Software is typically upgraded periodically to include new or improved features. In the CMS example, the CMS and stored procedures may be independently updated in scheduled releases of new versions or maintenance levels. Each new update or release may include changes to the respective APIs, and the updates may be sent directly to a plurality of users. One problem that can result is that the updated APIs may not be inter-compatible between the CMS and the stored procedures when the CMS and stored procedures are at a different version or level with respect to each other. Such incompatibility may cause the CMS or the stored procedures to function incorrectly or not to function at all. For example, a stored procedure may only handle primitive data types such as integer, long, BLOB, and CLOB in the parameter passing portion of its interface. The stored procedure typically does not handle structured data of variable length such as, for example, an array of integers, an array of character strings or an array of mixed data types in the parameter passing of its interface.
To illustrate the problem further, in Content Manager Version 8 Release 1, an IBM product, this problem was solved with a pair of parameters (BLOB and CLOB), where the BLOB. contained numeric values representing the:
The CLOB contained the data element values of character elements. Common routines are invoked by both of the APIs and respective stored procedures to build and parse the BLOB/CLOB pair.
However, with a second release of Content Manager Version 8 (V8.2), it was necessary to add data elements to data structures being passed in BLOB/CLOB pairs. A problem is encountered because many customers can be running environments where APIs are at a different version/release levels than their stored procedures (e.g., the APIs are at level V8.1 and the stored procedures are at V8.2 or higher, and vice versa). There are two scenarios which present two distinct problems. In the first scenario, the APIs are at a lower version/release level than the stored procedures. In this first scenario, the stored procedures expect additional data elements at the end of a data structure, and attempt to parse them, but they are not there because the V8.1 APIs do not pass them, not having any knowledge of them.
In the second scenario, the APIs are at a higher version/release level than the stored procedures. In this scenario, the APIs pass additional data elements, elements of which the stored procedures have no knowledge. Both scenarios result in a parsing error according to the current method of building/parsing BLOB/CLOB pairs. This presents a continuing problem for future releases as elements are appended to data structures.
It is therefore desirable to provide an improved method and means of passing parameters for data structures where the API and the respective stored procedures are at different version or release levels.
In accordance with the present invention, there is provided a method of parameter passing of data structures where an API and corresponding stored procedures are at different version/release levels. The method includes receiving a data structure comprising data structure elements from a caller and parsing the data structure for a version identifier. The parsed version identifier is compared to a stored procedure version identifier. If the comparison is indicative of a data structure compatibility between the calling program and the stored procedures, all received data structure elements are parsed. If the comparison is indicative of a data structure incompatibility between the calling program and the stored procedures, only data structure elements known to both of the calling program and the stored procedures are parsed.
In accordance with another aspect of the present invention, there is provided a system for passing parameters of data structures where an API and corresponding stored procedures are at different version/release levels. A means is provided for receiving a data structure comprising data structure elements from a calling program and parsing the data structure for a version identifier. A comparison means compares the parsed version identifier to a stored procedure version identifier. If the comparison means determines a data structure compatibility between the calling program and the stored procedures, a parsing means parses all received data structure elements. If, however, the comparison means determines a data structure incompatibility between the calling program and the stored procedures, the parsing means parses only data structure elements known to both of the calling program and the stored procedures.
In accordance with still another aspect of the present invention, there is provided a computer program product having means contents for passing parameters of data structures where an API and corresponding stored procedures are at different version/release levels. Program code is provided for receiving a data structure comprising data structure elements from a calling program and parsing the data structure for a version identifier. Other program code compares the parsed version identifier to a stored procedure version identifier. If the comparison program code determines a data structure compatibility between the calling program and the stored procedures, parsing program code parses all received data structure elements. If, however, the comparison program code determines a data structure incompatibility between the calling program and the stored procedures, the parsing program code parses only data structure elements known to both of the calling program and the stored procedures.
One advantage obtained from the present invention is the elimination of parsing errors when a version/release level of a set of APIs is different than the version/release level of a corresponding set of stored procedures.
Another advantage obtained from the present invention is the reduction in computer system program maintenance necessary when upgrading with a set of APIs or a set of stored procedures.
Other advantages of the subject method and system will become apparent to those skilled in the art upon a reading and understanding of this specification.
The invention may take physical form in certain parts and steps and arrangements of parts and steps, the embodiments of which will be described in detail in this specification and illustrated in the accompanying drawings hereof and wherein:
Reference will now be made in detail to an embodiment of the present invention, examples of which are illustrated in the accompanying drawings. The detailed description which follows is presented in terms of general procedures, steps and symbolic representations of operations of data bits within a computer memory, associated computer processors, networks, and network devices. These procedure descriptions and representations are the means used by those skilled in the data processing art to convey the substance of their work to others skilled in the art. A procedure is here, and generally, conceived to be a self-consistent sequence of steps or actions leading to a desired result. Thus, the term “procedure” is generally used to refer to a series of operations performed by a processor, be it a central processing unit of a computer, or a processing unit of a network device, and as such, encompasses such terms of art as “objects,” “functions,” “subroutines” and “programs.”
The procedures presented herein are not inherently related to any particular computer or other apparatus. In particular, various general purpose machines may be used with programs in accordance with the teachings herein, or it may prove more convenient to construct more specialized apparatus to perform the required method steps.
However, one of ordinary skill in the art will recognize that there exists a variety of platforms and languages for creating software for performing the procedures outlined herein. One of ordinary skill in the art also recognizes that the choice of the exact platform and language is often dictated by the specifics of the actual system constructed, such that what may work for one type of general purpose computer may not be efficient on another type of general purpose computer.
One of ordinary skill in the art to which this invention belongs will have a solid understanding of content management systems, application programming interfaces, stored procedures, and methods of accessing and storing items managed by a content management system. It being recognized that such practitioners do not require specific details of the software, but rather find data structure descriptions and process descriptions more desirable (due to the variety of suitable hardware and software platforms), such specifics are not discussed to avoid obscuring the invention.
With reference now to
The exemplary BLOB 20 shown in the figure comprises a first data element ID 26, a first data type 28, a first data length 30, a second data element ID 32, a second data type 34 and a second data length 36. These describe, respectively, a first character data value 38 and a second character data value 40 that form the exemplary CLOB 22. The illustrated BLOB/CLOB pair 20/22 is for exemplary purposes only, and the BLOB 20 may define any number of data elements, by means of any suitable coding method, not limited by the example illustrated. The CLOB 22, likewise, may define any number of data values.
Provision is made for the case where the parsing component, either a calling API 12 program or a receiving stored procedure 14 program, is an earlier version/release than the other. In exemplary embodiments, a common parse routine 42 automatically skips data elements which the receiving API or stored procedure is not expecting, and searches ahead in the data structure for the next tuple (data element and data value) which matches what the parsing component (API or stored procedure) expects or knows about. This technique avoids the necessity of incorporating this logic in every stored procedure and API. In the exemplary BLOB/CLOB pair 20/22 for example, data element #126-30, 38 was incorporated in an early version of a CMS, and data element #232-36, 40 was incorporated into a later version of the CMS, so that data element #2 would be unknown to implementations of the early version of the CMS and the respective APIs.
Special consideration is given, as well, to the scenarios where either of the APIs or stored procedures are at an early version level that does not incorporate concepts of the present invention. The early code may be generally available, and it is thus a goal to not require a change to every API and stored procedure in order to add version/release information to every BLOB/CLOB pair in those instances where they have not changed. The absence of the version/release information at the start of the BLOB/CLOB pair will serve as an indication that the component is at an early version/release level not incorporating concepts of the present invention.
Although the preferred embodiments disclosed herein describe a numerical comparison of version/release numbers, the invention also includes the case wherein the version/release numbers of the APIs and the version/release numbers of the respective stored procedures are not numbered according to the same schedule or scheme. For example, it may be the case that a version 5.0 API is compatible with version 10.0 stored procedures, or vice versa. In this case, rather than simply comparing version/release numbers numerically, embodiments of the present invention determine compatibility by mapping API version/release numbers to compatible, or incompatible, stored procedure version release numbers. This is accomplished by various methods known in the art, such as, for instance, a system version mapping table. This also proves beneficial in the case where an older version release of an API is compatible with a newer version/release of the stored procedures, and vice versa.
With reference now to
In the case where the comparison 54 is not true, the version and release do not match, or there is no version/release information present in the received BLOB, a determination 58 is made as to whether or not the caller's version and release is lower (earlier) than that of the stored procedure. If the caller's version/release is lower, or absent, processing continues at step 60 where only the character data elements known to the caller are parsed. In the example, only character data element #1 is parsed. This avoids errors that would occur if the stored procedure would expect additional data elements not known to the caller which is at an earlier version/release than the stored procedure.
If the caller's version/release is at a higher value (later) than that of the stored procedure, only character data elements known to the stored procedure are parsed. At step 62 a character data element known to the stored procedure is parsed, character data element #1 in the example. On a subsequent parse at step 64, character data elements unknown to the stored procedure are skipped, down to the next occurrence of a character data element known to the stored procedure. In the example, character data element #2 is skipped to the next occurrence of character data element #1.
The invention has been described with reference to the preferred embodiments. Modifications and alterations will occur to others upon a reading and understanding of the specification. It is our intention to include all such modifications and alterations insofar as they come within the scope of the appended claims, or the equivalents thereof.
This application is related to co-pending U.S. patent application Ser. No. 10/128,260 titled “Method and Apparatus of Parameter Passing of Structured Data for Stored Procedures in a Content Management System,” which is assigned to the same assignee as the present application.
Number | Name | Date | Kind |
---|---|---|---|
4751740 | Wright | Jun 1988 | A |
4969091 | Muller | Nov 1990 | A |
4992971 | Hayashi | Feb 1991 | A |
5579509 | Furtney et al. | Nov 1996 | A |
5615337 | Zimowski et al. | Mar 1997 | A |
5632015 | Zimowski et al. | May 1997 | A |
5644768 | Periwal et al. | Jul 1997 | A |
5649200 | Leblang et al. | Jul 1997 | A |
5742810 | Ng et al. | Apr 1998 | A |
5774719 | Bowen | Jun 1998 | A |
5778398 | Nagashima et al. | Jul 1998 | A |
5799310 | Anderson et al. | Aug 1998 | A |
5819252 | Benson et al. | Oct 1998 | A |
5862378 | Wang et al. | Jan 1999 | A |
5875332 | Wang et al. | Feb 1999 | A |
5892902 | Clark | Apr 1999 | A |
5926636 | Lam et al. | Jul 1999 | A |
5940616 | Wang | Aug 1999 | A |
5950209 | Carrier, III et al. | Sep 1999 | A |
6012067 | Sarkar | Jan 2000 | A |
6016394 | Walker | Jan 2000 | A |
6047291 | Anderson et al. | Apr 2000 | A |
6055637 | Hudson | Apr 2000 | A |
6063133 | Li et al. | May 2000 | A |
6065117 | White | May 2000 | A |
6067414 | Wang et al. | May 2000 | A |
6073168 | Mighdoll et al. | Jun 2000 | A |
6088524 | Levy et al. | Jul 2000 | A |
6104393 | Santos-Gomez | Aug 2000 | A |
6128621 | Weisz | Oct 2000 | A |
6148342 | Ho | Nov 2000 | A |
6161182 | Nadooshan | Dec 2000 | A |
6167405 | Rosensteel, Jr. et al. | Dec 2000 | A |
6173400 | Perlman et al. | Jan 2001 | B1 |
6219826 | De Pauw et al. | Apr 2001 | B1 |
6233586 | Chang et al. | May 2001 | B1 |
6249822 | Kays et al. | Jun 2001 | B1 |
6263313 | Milsted et al. | Jul 2001 | B1 |
6263342 | Chang et al. | Jul 2001 | B1 |
6272488 | Chang et al. | Aug 2001 | B1 |
6279111 | Jensenworth et al. | Aug 2001 | B1 |
6282649 | Lambert et al. | Aug 2001 | B1 |
6289344 | Braia et al. | Sep 2001 | B1 |
6289458 | Garg et al. | Sep 2001 | B1 |
6292936 | Wang | Sep 2001 | B1 |
6308274 | Swift | Oct 2001 | B1 |
6314449 | Gallagher et al. | Nov 2001 | B1 |
6327629 | Wang et al. | Dec 2001 | B1 |
6338056 | Dessloch et al. | Jan 2002 | B1 |
6339777 | Attaluri et al. | Jan 2002 | B1 |
6343286 | Lee et al. | Jan 2002 | B1 |
6385768 | Ziebell | May 2002 | B1 |
6460052 | Thomas et al. | Oct 2002 | B1 |
6519767 | Carter et al. | Feb 2003 | B1 |
6751798 | Schofield | Jun 2004 | B1 |
6751799 | Kays et al. | Jun 2004 | B2 |
6845392 | Koontz et al. | Jan 2005 | B2 |
6971093 | Spring | Nov 2005 | B1 |
7467386 | Gallagher et al. | Dec 2008 | B2 |
20010002486 | Kocher et al. | May 2001 | A1 |
20010008015 | Vu et al. | Jul 2001 | A1 |
20010019614 | Madoukh | Sep 2001 | A1 |
20020038340 | Whipple et al. | Mar 2002 | A1 |
20020059404 | Schaaf et al. | May 2002 | A1 |
20020183957 | Croix et al. | Dec 2002 | A1 |
20030014561 | Cooper | Jan 2003 | A1 |
20030018830 | Chen et al. | Jan 2003 | A1 |
20030200256 | Hu et al. | Oct 2003 | A1 |
Number | Date | Country |
---|---|---|
9922362 | May 1999 | WO |
Number | Date | Country | |
---|---|---|---|
20080222217 A1 | Sep 2008 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10759661 | Jan 2004 | US |
Child | 12117709 | US |