US20060206468A1

Movatterモバイル変換

Info

Publication number: US20060206468A1
Application number: US11/421,717
Authority: US
Inventors: Richard Dettinger; Richard Stevens
Original assignee: Individual
Current assignee: Individual
Priority date: 2003-04-17
Filing date: 2006-06-01
Publication date: 2006-09-14
Also published as: WO2004095171A2; EP1616249A4; CN1768325A; KR20060008296A; EP1616249A2; CA2520665A1; KR100843651B1; WO2004095171A3; US7089235B2; US20040210579A1

Abstract

A method, system and article of manufacture for processing queries that are executed against a database and, more particularly, for restricting queryable data in a database to a subset of all available data in the database when a query is executed against the database is provided. One embodiment provides a logical representation of all of the available data in underlying physical entities by defining a plurality of logical fields abstractly describing data stored by the associated physical entities, receiving an abstract query comprising at least one logical field of the plurality of logical fields, retrieving at least one condition defining at least one property common to a plurality of physical entities of the queryable data, associating the at least one condition with the abstract query and, in accordance with the at least one condition, restricting the queryable data to the subset of all the available data when executing the abstract query.

Description

CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation of co-pending U.S. patent application Ser. No. 10/418,592 filed Apr. 17, 2003, which is herein incorporated by reference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention generally relates to data processing in databases and more particularly to processing queries that are executed against a database.

2. Description of the Related Art

Databases are computerized information storage and retrieval systems. A relational database management system is a computer database management system (DBMS) that uses relational techniques for storing and retrieving data. The most prevalent type of database is the relational database, a tabular database in which data is defined so that it can be reorganized and accessed in a number of different ways.

Regardless of the particular architecture, in a DBMS, a requesting entity (e.g., an application or the operating system) demands access to a specified database by issuing a database access request. Such requests may include, for instance, simple catalog lookup requests or transactions and combinations of transactions that operate to read, change and add specified records in the database. These requests are made using high-level query languages such as the Structured Query Language (SQL). Illustratively, SQL is used to make interactive queries for getting information from and updating a database such as International Business Machines' (IBM) DB2, Microsoft's SQL Server, and database products from Oracle, Sybase, and Computer Associates. The term “query” denominates a set of commands for retrieving data from a stored database. Queries take the form of a command language that lets programmers and programs select, insert, update, find out the location of data and so forth.

One of the issues faced by data mining and database query applications, in general, is their close relationship with a given database schema (e.g., a relational database schema). This relationship makes it difficult to support an application as changes are made to the corresponding underlying database schema. Further, the migration of the application to alternative underlying data representations is inhibited. In today's environment, the foregoing disadvantages are largely due to the reliance applications have on SQL, which presumes that a relational model is used to represent information being queried. Furthermore, a given SQL query is dependent upon a particular relational schema since specific database tables, columns and relationships are referenced within the SQL query representation. As a result of these limitations, a number of difficulties arise.

One difficulty is that changes in the underlying relational data model require changes to the SQL foundation that the corresponding application is built upon. Therefore, an application designer must either forgo changing the underlying data model to avoid application maintenance or must change the application to reflect changes in the underlying relational model. Another difficulty is that extending an application to work with multiple relational data models requires separate versions of the application to reflect the unique SQL requirements driven by each unique relational schema. Yet another difficulty is evolution of the application to work with alternate data representations because SQL is designed for use with relational systems. Extending the application to support alternative data representations, such as XML, requires rewriting the application's data management layer to use non-SQL data access methods.

A typical approach used to address the foregoing problems is software encapsulation. Software encapsulation involves using a software interface or component to encapsulate access methods to a particular underlying data representation. An example is found in the Enterprise JavaBean (EJB) specification that is a component of the Java 2 Enterprise Edition (J2EE) suite of technologies. In the case of EJB, entity beans serve to encapsulate a given set of data, exposing a set of Application Program Interfaces (APIs) that can be used to access this information. This is a highly specialized approach requiring the software to be written (in the form of new entity EJBs) whenever a new set of data is to be accessed or when a new pattern of data access is desired. The EJB model also requires a code update, application build and deployment cycle to react to reorganization of the underlying physical data model or to support alternative data representations. EJB programming also requires specialized skills, since more advanced Java programming techniques are involved. Accordingly, the EJB approach and other similar approaches are rather inflexible and costly to maintain for general-purpose query applications accessing an evolving physical data model.

Another shortcoming of the prior art is the manner in which information can be presented to the user. A number of software solutions support the use of user-defined queries, in which the user is provided with a tool to construct a query that meets the user's specific data selection requirements. In an SQL-based system, the user is given a list of underlying database tables and columns to choose from when building a query. The user must decide which tables and columns to access based on the naming convention used by the database administrator. This approach does not provide an effective way to subset the set of information presented to the user and, thus, complicates the building of queries as even nonessential content is revealed to the user.

Assuming a solution to the foregoing difficulties, another issue which must be addressed is analysis of query results. In general, analysis is an iterative process that implies doing work on results of one or more previous steps. In a database environment, the one or more previous steps are usually queries which returned results from an underlying database. In many conventional systems each query is executed separately against the database so that a distinct query result for each executed query is presented to the user. If the user is interested in analyzing query results of previously executed queries by issuing additional queries, the user is generally required to manually combine the additional queries with the previously executed ones and to execute the combined queries to obtain a new query result. Consequently, it may be desirable to limit the accessible data in the database to a subset of the data to narrow or focus research and analysis on the subset of the data for certain fields, so that subsequent queries may be issued against the database without the need for manually combining queries. For instance, it may be desirable to restrict a patient warehouse in a medical database environment to cardiac patients for the purpose of studying effectiveness of treatments and medication without requiring the user to manually limit the search to cardiac patients by inputting a corresponding condition into each query issued against the medical database.

Therefore, there is a need for an improved and more flexible technique for handling related queries in a database environment, which are subsequently issued by a requesting entity against the database.

SUMMARY OF THE INVENTION

The present invention generally is directed to a method, system and article of manufacture for processing queries that are executed against a database and, more particularly, for restricting queryable data in a database to a subset of all available data in the database when a query is executed against the database.

One embodiment for restricting queryable data in a database to a subset of all available data in the database when a query is executed against the database comprises providing a logical representation of all the available data defining a plurality of logical fields abstractly describing associated physical entities of all the available data, receiving an abstract query comprising at least one logical field of the plurality of logical fields, retrieving at least one condition defining at least one property common to a plurality of physical entities of the queryable data, associating the at least one condition with the abstract query and, in accordance with the at least one condition, restricting the queryable data to the subset of all the available data when executing the abstract query.

Another embodiment comprises receiving a query against all the available data, retrieving at least one condition defining at least one property common to a plurality of physical entities of the queryable data, associating the at least one condition with the query and, in accordance with the at least one condition, restricting the queryable data to the subset of all the available data when executing the query.

Still another embodiment comprises providing a logical representation of all the available data defining a plurality of logical fields abstractly describing associated physical entities of all the available data, retrieving at least one condition defining at least one property common to a plurality of physical entities of the queryable data, restricting the queryable data to the subset of all the available data using the at least one condition, receiving an abstract query comprising at least one logical field of the plurality of logical fields and executing the abstract query against the queryable data.

Still another embodiment comprises retrieving at least one condition defining at least one property common to a plurality of physical entities of the queryable data, restricting the queryable data to the subset of all the available data using the at least one condition, receiving a query against all the available data and executing the query against the queryable data.

Still another embodiment provides a method for restricting queryable data in a database having a plurality of tables to a subset of all available data in the database when a query is executed against the database. The method comprises receiving a query against all the available data; determining whether the query joins two or more tables in the database; and, if the query joins two or more tables, retrieving at least one condition defining at least one property common to a plurality of physical entities of the queryable data, the at least one condition being associated with at least one previous query; associating the at least one condition with the query; and, in accordance with the at least one condition, restricting the queryable data to the subset of all the available data when executing the query.

Still another embodiment provides a method for restricting queryable data in a database to a subset of all available data in the database. The method comprises providing a first logical representation of all the available data defining a plurality of logical fields abstractly describing associated physical entities of all the available data, retrieving at least one condition defining at least one property common to a plurality of physical entities of the queryable data and modifying at least a portion of the logical fields to abstractly describe the plurality of physical entities of the queryable data for providing, using the at least one condition, a second logical representation of the queryable data from the first logical representation.

Still another embodiment provides a computer-readable medium containing a program which, when executed by a processor, performs an operation for restricting queryable data in a database to a subset of all available data in the database when a query is executed against the database. The operation comprises, in response to receiving an abstract query comprising at least one logical field of a plurality of logical fields defined in a logical representation of all the available data defining the plurality of logical fields which abstractly describe associated physical entities of all the available data, retrieving at least one condition defining at least one property common to a plurality of physical entities of the queryable data, associating the at least one condition with the abstract query and, in accordance with the at least one condition, for restricting the queryable data to the subset of all the available data when executing the abstract query.

Still another embodiment provides a computer-readable medium containing a program which, when executed by a processor, performs an operation for restricting queryable data in a database to a subset of all available data in the database for executing a query against the database. The operation comprises, in response to receiving an abstract query comprising at least one logical field of a plurality of logical fields defined in a logical representation of all the available data defining the plurality of logical fields which abstractly describe associated physical entities of all the available data, retrieving at least one condition defining at least one property common to a plurality of physical entities of the queryable data, restricting the queryable data to the subset of all the available data using the at least one condition, receiving an abstract query comprising at least one logical field of the plurality of logical fields and executing the abstract query against the queryable data.

Still another embodiment provides a computer-readable medium containing a program which, when executed by a processor, performs an operation for restricting queryable data in a database to a subset of all available data in the database. The operation comprises, in response to user input, generating a first logical representation of all the available data defining a plurality of logical fields abstractly describing associated physical entities of all the available data, retrieving at least one condition defining at least one property common to a plurality of physical entities of the queryable data, and modifying at least a portion of the logical fields to abstractly describe the plurality of physical entities of the queryable data for generating, using the at least one condition, a second logical representation of the queryable data from the first logical representation.

Yet another embodiment provides a computer, comprising a database containing available data, a data abstraction model defining a plurality of logical fields abstractly describing associated physical entities of all the available data, a query building application for building abstract queries according to the data abstraction model, a runtime component configured to transform the abstract queries into concrete queries having a form consistent with the data, and a rule application manager configured to associate at least one condition defining at least one property common to at least a portion of the associated physical entities of all the available data with a given abstract query for restricting queryable data in the database to a subset of all the available data using the at least one condition when a concrete query, corresponding to the given abstract query after being transformed, is executed against the database.

Yet another embodiment provides a computer, comprising a database containing available data, a data abstraction model defining a plurality of logical fields abstractly describing associated physical entities of all the available data, a query building application for building abstract queries according to the data abstraction model, a runtime component configured to transform the abstract queries into concrete queries having a form consistent with the data, and a rule application manager for restricting queryable data in the database to a subset of all the available data using at least one condition defining at least one property common to a plurality of physical entities of the queryable data when a concrete query, corresponding to an abstract query after being transformed, is executed against the database.

Yet another embodiment provides a computer, comprising a database containing available data, a first data abstraction model defining a plurality of logical fields abstractly describing associated physical entities of all the available data, and a rule application component for generating a second data abstraction model from the first data abstraction model, for restricting queryable data in the database to a subset of all the available data using at least one condition defining at least one property of a plurality of physical entities of the queryable data.

BRIEF DESCRIPTION OF THE DRAWINGS

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.

FIG. 1 is one embodiment of a computer system utilized in accordance with the invention;

FIGS.2A-B are relational views of software components of one embodiment of the invention;

FIG. 3A illustrates one embodiment in which multiple data repository abstraction components coexist in a single application space;

FIG. 3B illustrates one embodiment in which multiple instances of a single data repository abstraction component coexist in a single application space;

FIG. 4 illustrates an environment with plural data repository abstraction components;

FIG. 5 is a flow chart illustrating the operation of a runtime component;

FIG. 6 is a flow chart illustrating the operation of a runtime component;

FIG. 7 is a relational view of software components of one embodiment of the invention;

FIG. 8 is a flow chart illustrating handling of a received abstract query;

FIG. 9 is a flow chart illustrating a method of modifying an abstract query according to an embodiment of the invention;

FIG. 10 is a flow chart illustrating a method of generating temporary tables according to an embodiment of the invention; and

FIG. 11 is a flow chart illustrating a method of modifying a data repository abstraction component according to an embodiment of the invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Introduction

The present invention is generally directed to a system, method and article of manufacture for processing queries that are executed against a database and, more particularly, for restricting queryable data in a database to a subset of all available data in the database when a query is executed against the database. In one embodiment, a data repository abstraction layer provides a logical view of the underlying database that is independent of the particular manner in which the data is physically represented. The data repository abstraction layer represents a data abstraction model that defines a plurality of logical fields abstractly defining the data. A query abstraction layer is also provided and is based on the data repository abstraction layer. The query abstraction layer includes a query building application for building abstract queries according to the data abstraction model. The query building application is implemented as a data query builder provided, e.g., as a single application that accesses the data repository abstraction as if it were a physical database. A runtime component representing a data query abstraction component performs translation of abstract queries into concrete queries having a form consistent with the data. A concrete query can be used against a particular physical data representation. The data query abstraction component services logical data access requests of the data query builder, without giving the data query builder the knowledge that the physical data representation exists, nor about the physical queries, i.e., the concrete queries resulting from the abstract queries. A rule application management component implements a rule application mechanism for restricting the queryable data in the database to the subset of all the available data in the database when a query is executed against the database.

In one embodiment, the data repository abstraction layer includes multiple data repository abstraction components/instances which coexist (and, in some embodiments, cooperate) within a single application space. The provision of multiple data abstraction components/instances of data repository abstractions allows different sets of data to be exposed to different users.

One embodiment of the invention is implemented as a program product for use with a computer system such as, for example, the computer system shown inFIG. 1 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.

Physical View of Environment

FIG. 1 depicts a block diagram of anetworked system100 in which embodiments of the present invention may be implemented. In general, thenetworked system100 includes a client (e.g., user's) computer102 (threesuch client computers102 are shown) and at least one server104 (onesuch server104 is shown). Theclient computer102 and theserver computer104 are connected via anetwork126. In general, thenetwork126 may be a local area network (LAN) and/or a wide area network (WAN). In a particular embodiment, thenetwork126 is the Internet.

Theclient computer102 includes a Central Processing Unit (CPU)110 connected via abus120 to amemory112,storage114, aninput device116, anoutput device119, and anetwork interface device118. Theinput device116 can be any device to give input to theclient computer102. For example, a keyboard, keypad, light-pen, touch-screen, track-ball, or speech recognition unit, audio/video player, and the like could be used. Theoutput device119 can be any device to give output to the user, e.g., any conventional display screen. Although shown separately from theinput device116, theoutput device119 andinput device116 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.

Thenetwork interface device118 may be any entry/exit device configured to allow network communications between theclient computer102 and theserver computer104 via thenetwork126. For example, thenetwork interface device118 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. Thememory112 andstorage114 could be part of one virtual address space spanning multiple primary and secondary storage devices.

Thememory112 is preferably a random access memory sufficiently large to hold the necessary programming and data structures of the invention. While thememory112 is shown as a single entity, it should be understood that thememory112 may in fact comprise a plurality of modules, and that thememory112 may exist at multiple levels, from high speed registers and caches to lower speed but larger DRAM chips.

Illustratively, thememory112 contains anoperating system124. 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.

Thememory112 is also shown containing abrowser program122 that, when executed onCPU110, provides support for navigating between thevarious servers104 and locating network addresses at one or more of theservers104. In one embodiment, thebrowser program122 includes a web-based Graphical User Interface (GUI), which allows the user to display Hyper Text Markup Language (HTML) information. More generally, however, thebrowser program122 may be any GUI-based program capable of rendering the information transmitted from theserver computer104.

Theserver computer104 may be physically arranged in a manner similar to theclient computer102. Accordingly, theserver computer104 is shown generally comprising aCPU130, amemory132 and astorage device134, coupled to one another by abus136.Memory132 may be a random access memory sufficiently large to hold the necessary programming and data structures that are located on theserver computer104.

Theserver computer104 is generally under the control of anoperating system138 shown residing inmemory132. Examples of theoperating system138 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.

Thememory132 further includes one ormore applications140, anabstract query interface146 and arule application manager160. Theapplications140, theabstract query interface146 and therule application manager160 are software products having a plurality of instructions that are resident at various times in various memory and storage devices in thecomputer system100. When read and executed by one ormore processors130 in theserver104, theapplications140, theabstract query interface146 and therule application manager160 cause thecomputer system100 to perform the steps necessary to execute steps or elements embodying the various aspects of the invention. The applications140 (and more generally, any requesting entity, including theoperating system138 and, at the highest level, users) issue queries against a database (e.g.,databases156₁. . .156_N, collectively referred to as database(s)156). Illustratively, thedatabases156 are shown as part of a database management system (DBMS)154 instorage134. Thedatabases156 are representative of any collection of data regardless of the particular physical representation. By way of illustration, thedatabases156 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.

In one embodiment, the queries issued by theapplications140 are defined according to anapplication query specification142 included with eachapplication140. The queries issued by theapplications140 may be predefined (i.e., hard coded as part of the applications140) 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 theabstract query interface146. In particular, the logical fields used in the abstract queries are defined by a datarepository abstraction component148 of theabstract query interface146. The abstract queries are executed by aruntime component150 which first transforms the abstract queries into a form consistent with the physical representation of the data contained in theDBMS154, e.g., by translating abstract queries into concrete queries. Therule application manager160 implements a rule application mechanism for restricting queryable data to a subset of all available data contained in theDBMS154. In one embodiment, therule application manager160 restricts the queryable data by redefining a query that is executed against the database in order to execute the redefined query against the queryable data. Alternatively, therule application manager160 restricts the queryable data using a condition retrieved from storage when executing a received query. Still alternatively, therule application manager160 restricts the queryable data by modifying the data repository abstraction component. Theapplication query specification142, theabstract query interface146 and therule application manager160 are further described with reference to FIGS.2A-B andFIG. 7.

In one embodiment, elements of a query are specified by a user through a graphical user interface (GUI). The content of the GUIs 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 theclient computer systems102 with thebrowser program122. Accordingly, thememory132 includes a Hypertext Transfer Protocol (HTTP) server process152 (e.g., a web server) adapted to service requests from theclient computer102. For example, theprocess152 may respond to requests to access a database(s)156, which illustratively resides on theserver104. Incoming client requests for data from adatabase156 invoke anapplication140. When executed by theprocessor130, theapplication140 causes theserver computer104 to perform the steps or elements embodying the various aspects of the invention, including accessing the database(s)156. In one embodiment, theapplication140 comprises a plurality of servlets configured to build GUI elements, which are then rendered by thebrowser program122.

FIG. 1 is merely one hardware/software configuration for thenetworked client computer102 andserver computer104. Embodiments of the present invention can apply to any comparable hardware configuration, regardless of whether the computer systems are complicated, multi-user computing apparatus, single-user workstations or network appliances that do not have non-volatile storage of their own. Further, it is understood that while reference is made to particular markup languages, including HTML, the invention is not limited to a particular language, standard or version. Accordingly, persons skilled in the art will recognize that the invention is adaptable to other markup languages as well as non-markup languages and that the invention is also adaptable to future changes in a particular markup language as well as to other languages presently unknown. Likewise, theHTTP server process152 shown inFIG. 1 is merely illustrative and other embodiments adapted to support any known and unknown protocols are contemplated.

Logical/Runtime View of Environment

FIGS.2A-B show an illustrativerelational view200 of components of the invention. A requesting entity (e.g., one of theapplications140 ofFIG. 1) issues aquery202 as defined by the respectiveapplication query specification142 of the requesting entity. The resultingquery202 is generally referred to herein as an “abstract query” because the query is composed according to abstract (i.e., logical) fields rather than by direct reference to the underlying physical data entities in theDBMS154. As a result, abstract queries may be defined that are independent of the particular underlying data representation used. In one embodiment, theapplication query specification142 may include both criteria used for data selection (selection criteria204) and an explicit specification of the fields to be returned (return data specification206) based on theselection criteria204.

The logical fields specified by theapplication query specification142 and used to compose theabstract query202 are defined by the datarepository abstraction component148. In general, the datarepository abstraction component148 exposes information as a set of logical fields that may be used within a query (e.g., the abstract query202) issued by theapplication140 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 theDBMS154, thereby allowing queries to be formed that are loosely coupled to the underlying data representation.

In general, the datarepository abstraction component148 exposes information as a set of logical fields that may be used within a query (e.g., the abstract query202) issued by theapplication140 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 thedatabase156, thereby allowing queries to be formed that are loosely coupled to the underlying data representation.

In one embodiment, the datarepository abstraction component148 comprises a plurality of

field specifications

208₁,208₂,208₃,208₄and208₅(five shown by way of example), collectively referred to as thefield specifications208. Specifically, a field specification is provided for each logical field available for composition of an abstract query. Each field specification contains a

logical field name

210₁,210₂,210₃,210₄,210₅(collectively, field name210) and an associated access method212₁,212₂,212₃,212₄,212₅(collectively, access method212). The access methods associate (i.e., map) the logical field names to a particular

physical data representation

214₁,214₂. . .214_Nin the database (e.g., database156). By way of illustration, two data representations are shown, anXML data representation214₁and arelational data representation214₂. However, thephysical data representation214_Nindicates that any other data representation, known or unknown, is contemplated. In one embodiment, a single datarepository abstraction component148 contains field specifications (with associated access methods) for two or morephysical data representations214. In an alternative embodiment, a different single datarepository abstraction component148 is provided for each separatephysical data representation214.

Any number of access methods is 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

208₁,208₂and208₅exemplify simple field access methods212₁,212₂, and212₅, 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 method212₁shown inFIG. 2B maps the logical field name210₁(“FirstName”) to a column named “f_name” in a table named “contact”. Thefield specification208₃exemplifies a filtered field access method212₃. Filtered fields identify an associated physical entity and provide filters used to define a particular subset of items within the physical data representation. An example is provided inFIG. 2B in which the filtered field access method212₃maps the logical field name210₃(“AnyTownLastName”) to a physical entity in a column named “I_name” in a table named “contact” and defines a filter for individuals in the city of “Anytown”. Another example of a filtered field is a New York ZIP code field that maps to the physical representation of ZIP codes and restricts the data only to those ZIP codes defined for the state of New York. Thefield specification208₄exemplifies a composed field access method212₄. Composed access methods compute a logical field from one or more physical fields using an expression supplied as part of the access method definition. In this way, information which does not exist in the underlying data representation may be computed. In the example illustrated inFIG. 2B the composed field access method212₄maps thelogical field name210₄“AgeInDecades” to “AgeInYears/10”. Another example is a sales tax field that is composed by multiplying a sales price field by a sales tax rate.

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, thefield specifications208 include a type attribute which reflects the format of the underlying data. However, in another embodiment, the data format of thefield specifications208 is different from the associated underlying physical data, in which case a conversion of the underlying physical data into the format of the logical field is required.

By way of example, thefield specifications208 of the datarepository abstraction component148 shown inFIG. 2 are representative of logical fields mapped to data represented in therelational data representation214₂. However, other instances of the datarepository abstraction component148 map logical fields to other physical data representations, such as XML.

An illustrative abstract query corresponding to theabstract query202 shown inFIG. 2B is shown in Table I below. By way of illustration, the illustrative abstract query is defined using XML. However, any other language may be used to advantage.

TABLE I


ABSTRACT QUERY EXAMPLE

001	<?xml version=“1.0”?>
002	<!--Query string representation: (FirstName = “Mary” AND

LastName =

003	“McGoon”) OR State = “NC”-->
004	<QueryAbstraction>

005	<Selection>

006	<Condition internalID=“4”>

007	<Condition field=“FirstName” operator=“EQ”

value=“Mary”

008	internalID=“1”/>

009	<Condition field=“LastName” operator=“EQ”

value=“McGoon”

010	internalID=“3”relOperator=“AND”></Condition>

011	</Condition>
012	<Condition field=“State” operator=“EQ” value=“NC”

internalID=“2”

013	relOperator=“OR”></Condition>

014	</Selection>
015	<Results>

016	<Field name=“FirstName”/>
017	<Field name=“LastName”/>
018	<Field name=“Street”/>

019	</Results>

020	</QueryAbstraction>

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 Data Repository Abstraction is shown in Table II below. By way of illustration, the illustrative Data Repository Abstraction is defined using XML. However, any other language may be used to advantage.

TABLE II


DATA REPOSITORY ABSTRACTION EXAMPLE

	001	<?xml version=“1.0”?>
	002	<DataRepository>

003

004

<Field queryable=“Yes” name=“FirstName”

displayable=“Yes”>

005

006

<Simple columnName=“f_name”

tableName=“contact”></Simple>

	007	</AccessMethod>
	008	<Type baseType=“char”></Type>

	009	</Field>
	010	<Field queryable=“Yes” name=“LastName”

displayable=“Yes”>

011

012

<Simple columnName=“l_name”

tableName=“contact”></Simple>

	013	</AccessMethod>
	014	<Type baseType=“char”></Type>

	015	</Field>
	016	<Field queryable=“Yes” name=“State”

displayable=“Yes”>

017

018

<Simple columnName=“state”

tableName=“contact”></Simple>

	019	</AccessMethod>
	020	<Type baseType=“char”></Type>

	023	</DataRepository>

As noted above, one embodiment provides multiple data repository abstraction components which coexist in a single application space. One embodiment illustrating such an environment is shown inFIG. 3A. The environment shown inFIG. 3A generally comprises an application layer310 (defined by the application140), adata abstraction layer320, and aphysical data layer330. The environment shows twousers340,350 accessing thephysical data layer330 via theapplication layer320 using, e.g.,application140 ofFIG. 1 (e.g., by issuingabstract query202 ofFIG. 2). Accordingly, theapplication layer320 may comprise a data query builder component adapted to enable the users to build abstract queries.

Theusers340,350 are accessing the samephysical data layer330 through acommon application layer320. However, the data being exposed to therespective users340,350 is not the same. Rather, each user is exposed to selected portions of thephysical data layer330 according to the definition of thedata abstraction layer320. More particularly, thedata abstraction layer320 illustratively includes two data repository abstraction components,DRA1342 andDRA2352, which define the data that will be exposed to theusers340,350, respectively, via theapplication layer310. Thedata abstraction layer320 may comprise a data query abstraction component which services logical data access of the data query builder component to the physical data inphysical data layer330.

In the present example, the first data repository abstraction342 (DRA1) exposes all of a first database344 (registration database) and TABLE 1 of a second database354 (payroll database), while the second data repository abstraction352 (DRA2) exposes the entiresecond database354 and TABLE 2 of the first database244. It should be noted that the particular data exposed by the respective data repository abstraction components is merely illustrative. More generally, any portion of the

databases

344,354 may be exposed, as well as any other databases of thephysical data layer330. By way of illustration, the environment ofFIG. 3A shows two users (340,350). However, more generally any number of users may be accessing the data of thephysical data layer330.

Referring now toFIG. 3B, an embodiment in which multiple instances of a single data repository abstraction component (e.g. data repository abstraction component148) coexist in a single application space is illustrated. According toFIG. 3B, agroup360 of users362 (USER A),364 (USER B),366 (USER C),368 (USER D), . . . ,370 (USER N) accesses (as illustrated by arrow346) a singledata repository abstraction342, independent of whether only one or a plurality of data repository abstractions exist. In the present illustration, all users of thegroup360 of users access data repository abstraction DRA1.

For each

user

362,364,366,368, . . . ,370 accessing the data repository abstraction342 (DRA1), an instance of thedata repository abstraction342 is generated (as indicated by arrow347), thereby generating agroup348 of data repository abstraction instances. Accordingly, instances372 (DRA1-A),374 (DRA1-B),376 (DRA1-C),378 (DRA1-D), . . . ,380 (DRA1-N) are generated for the

users

362,364,366,368, . . . ,370, respectively, as indicated by

arrows

382,384,386,388 and390. Providing an instance of thedata repository abstraction342 for each user allows adapting a corresponding instance to the needs and specific requirements of the user without globally changing thedata repository abstraction342 for all users in thegroup360.

FIG. 5 shows anillustrative runtime method500 exemplifying one embodiment of the operation of theruntime component150 ofFIG. 1. Themethod500 is entered atstep502 when theruntime component150 receives as input an instance of an abstract query (such as theabstract query202 shown inFIG. 2). Instep504, theruntime component150 reads and parses the instance of the abstract query and locates individual selection criteria and desired result fields. Atstep506, theruntime component150 enters a loop (comprising

steps

506,508,510 and512) for processing each query selection criteria statement present in the abstract query, thereby building a data selection portion of a Concrete Query. 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). Instep508, theruntime component150 uses the field name from a selection criterion of the abstract query to look up the definition of the field in thedata repository abstraction148. As noted above, the field definition includes a definition of the access method used to access the physical data associated with the field. Theruntime component150 then builds (step510) a Concrete Query Contribution for the logical field being processed. As defined herein, a Concrete Query Contribution is a portion of a concrete query that is used to perform data selection based on the current logical field. A concrete query is a query represented in languages like SQL and XML and is consistent with the data of a given physical data repository (e.g., a relational database or XML repository). Accordingly, the concrete query is used to locate and retrieve data from the physical data repository, represented by theDBMS154 shown inFIG. 1. The Concrete Query Contribution generated for the current field is then added to a Concrete Query Statement. Themethod500 then returns to step506 to begin processing for the next field of the abstract query. Accordingly, the process entered atstep506 is iterated for each data selection field in the abstract query, thereby contributing additional content to the eventual query to be performed.

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, themethod500 enters a loop at step514 (defined by

steps

514,516,518 and520) to add result field definitions to the concrete query being generated. Instep516, theruntime component150 looks up a result field name (from the result specification of the abstract query) in thedata repository abstraction148 and then retrieves a Result Field Definition from thedata repository abstraction148 to identify the physical location of data to be returned for the current logical result field. Theruntime component150 then builds (as step518) a Concrete Query Contribution (of the concrete query that identifies physical location of data to be returned) for the logical result field. Instep520, 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 atstep522.

One embodiment of amethod600 for building a Concrete Query Contribution for a logical field according to

steps

510 and518 is described with reference toFIG. 6. Instep602, themethod600 queries whether the access method associated with the current logical field is a simple access method. If so, the Concrete Query Contribution is built (step604) based on physical data location information and processing then continues according tomethod500 described above. Otherwise, processing continues to step606 to query, whether the access method associated with the current logical field is a filtered access method. If so, the Concrete Query Contribution is built (step608) based on physical data location information for some physical data entity. Instep610, the Concrete Query Contribution is extended with additional logic (filter selection) used to subset data associated with the physical data entity. Processing then continues according tomethod500 described above.

If the access method is not a filtered access method, processing proceeds fromstep606 to step612 where themethod600 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 instep614. In step616, 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 tomethod500 described above.

If the access method is not a composed access method, processing proceeds fromstep612 to step618. Step618 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 than 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 themethod600. For example, the conversion may be performed as part of, or immediately following, the

steps

604,608 and616. A subsequent conversion from the format of the physical data to the format of the logical field is performed after the query is executed atstep522. Of course, if the format of the logical field definition is the same as the underlying physical data, no conversion is necessary.

Referring now toFIG. 7, a relational view of therule application manager160 and components of the invention is illustrated. Therule application manager160 implements a rule application mechanism for restricting searchable data732 (i.e., queryable data) to a subset of allavailable data730 when an abstract query701 (e.g.,abstract query202 ofFIG. 2) is issued against all theavailable data730. To this end, theabstract query701 is processed by therule application manager160. Specifically, therule application manager160 performs a relevancy check, i.e., determines usingrelevancy determination unit169 whether executing theabstract query701 against thedatabase156 requires application ofpredefined rules167 to theabstract query701,data repository abstraction148 and/or one or more physical entities of all theavailable data730 in thedatabase156.

In one embodiment, therule application manager160 reads and parses the receivedabstract query701 using a condition extraction unit162 (as indicated by arrow741) to identify and extract one ormore query conditions721 defined by theabstract query701. The extractedconditions721 are stored in a condition storage unit164 (which may be, for example, cache or a portion of thestorage114 shown inFIG. 1). Using thedata repository abstraction148, theabstract query701 is transformed into a query consistent with the underlying physical representation of all theavailable data730 in the database (as indicated by dashed arrow762). After the transformation, theabstract query701 may be executed against all the available data730 (as indicated by dashed arrow763).

If another abstract query, illustratively theabstract query202 ofFIG. 2, is received, therule application manager160 reads and parses theabstract query202 to identify and extract one or more query conditions from theabstract query202, as described above. In one embodiment, theabstract query202 is received subsequent to theabstract query701. Using therelevancy determination unit169, therule application manager160 determines whether one or more query conditions stored in thecondition storage unit164, which may have been extracted from one or more previously executed abstract queries (e.g.,condition721 of abstract query701), are relevant to theabstract query202. In one embodiment, identifying the relevant conditions may comprise determining conditions related to the same database table(s) and/or conditions relating to tables that are linked to the database table(s) by some identifier like a unique key (e.g., a foreign key). If therule application manager160 determines that at least one storedcondition722 is relevant to theabstract query202, therule application manager160 retrieves the at least one stored condition usingcondition retrieval unit166. Then therule application manager160 accesses the abstract query202 (as indicated by arrow742) using acondition application unit168 to associate the at least onecondition722 with theabstract query202 to generate (as indicated by arrow743) a modifiedabstract query703 including the at least onecondition722, as explained below with reference toFIG. 9. Using thedata repository abstraction148 the modifiedabstract query703 is transformed into a query consistent with the underlying physical representation of all theavailable data730 in the database (as indicated by dashed arrow766). The modifiedabstract query703 may then be executed against all the available data730 (as indicated by dashed arrow763).

In another embodiment, after retrieving the at least one stored condition, therule application manager160 may access the data repository abstraction148 (as indicated by arrow744) using thecondition application unit168 to modify thedata repository abstraction148 on the basis of the at least one condition, thereby generating (as indicated by arrow745) a modifieddata repository abstraction705, as explained below with reference toFIG. 11. As a result of the modification, the logical fields of the modifieddata repository abstraction705 point to the physical entities of the subset ofsearchable data732 in the database, rather than the entire set of all theavailable data730. Theabstract query202 may then be transformed into a query consistent with the searchable data732 (as indicated by dashed arrow764) to be executed against the searchable data732 (as indicated by dashed arrow765).

In one aspect, this approach achieves improved performance at runtime since thesearchable data732 is a subset of all theavailable data730. It should be noted that in this embodiment “searchable data” refers to the effectively available data since all the available data itself has not in any way been changed or restricted. Rather, the queryable data has been effectively reduced since queries are confined to what is made available by the intermediate modifieddata repository abstraction705.

In another embodiment, all theavailable data730 itself may be modified, as explained below with reference toFIG. 10. For example, after retrieving the at least one stored condition, therule application manager160 may determine aproperty734 from the at least one condition, the property describing a characteristic of the data to be searched. For instance, assume in a medical environment a patient database table having a multiplicity of records wherein each record relates to personal data of a patient in a hospital. In the table a column “Age” may be directed towards the age of the patients and include an entry for each patient indicating the age of the corresponding patient. Accordingly, each record in the table associated with a patient of the age of “20” would have the property “age=20”. Using the property, all the available data may be restricted to thesearchable data732.

Therule application manager160 may then access all the available data730 (as indicated by arrow746) to modify all theavailable data730 on the basis of the at least one condition using thecondition application unit168. Specifically, all theavailable data730 is restricted (as indicated by arrow747) to thesearchable data732, wherein at least a plurality of the physical entities of thesearchable data732, illustrated as temporary table733, has the determinedproperty734. Additionally, thedata repository abstraction148 may be modified to the modifieddata repository abstraction705 in order to point to the physical entities of thesearchable data732 in the database, thereby allowing transformation of theabstract query202 into a query consistent with thesearchable data732.

It should be noted that the above-described relations between the components involved inFIG. 7 are merely illustrative and not construed for limiting the invention to these described relations. Instead, any possible relations between the different components are contemplated. For instance, the modifiedabstract query703 may be transformed to a query consistent with the underlying physical representation using the modified data repository abstraction705 (as indicated by dashed arrow768). Moreover, independent of a previously received abstract query, conditions may be provided and stored in thecondition storage unit164 for restricting thesearchable data732 to a subset of all theavailable data730. These stored conditions may be retrieved from thecondition storage unit164 using thecondition retrieval unit166 and associated with theabstract query202 and/or applied to thedata repository abstraction148 and/or all theavailable data730. Moreover, theproperties734 may automatically be extracted from the corresponding conditions and stored as thepredefined rules167 when processing the conditions from received abstract queries. Furthermore, thepredefined rules167 may be stored in thecondition storage unit164 together with the related conditions. Moreover, thecondition application unit168 and therelevancy determination unit169 may be implemented as a single component performing the associated functionality.

FIG. 8 is a flowchart illustrating an embodiment of amethod800 for determining whether application of predefined rules (e.g.,predefined rules167 ofFIG. 7) to a received abstract query (e.g.,abstract query701 ofFIG. 7 or202 ofFIG. 2), a data repository abstraction (e.g., datarepository abstraction component148 ofFIG. 1) and/or one or more physical entities of all available data (e.g.,available data730 inFIG. 7) in thedatabase156 is required. In one embodiment,method800 is performed by a rule application manager (e.g.,rule application manager160 ofFIG. 1). By way of example only,method800 is explained with reference to a relational database schema having a plurality of database tables which are related and may, accordingly, be joined, and wherein SQL queries are issued against the tables.

Method

800 starts atstep810. Instep820, an abstract query is received. Atstep830, therule application manager160 determines whether the received abstract query joins two or more tables in the database. Specifically, if the received abstract query joins two or more tables, it may be assumed that generation of a single temporary table as explained below with reference toFIG. 10 (step890) is not appropriate. This assumption is made, for instance, in view of an underlying relational database schema, wherein the two or more tables have intentionally been implemented separately for organizational purposes. Thus, generating only one single temporary table from the two or more joined tables would undermine the intended relational organization.

If it is determined that the received abstract query joins two or more tables in the database,method800 continues atstep850 where therule application manager160 identifies all query conditions contained in the received abstract query. Therule application manager160 extracts and replicates the identified query condition(s) to storage (e.g.,condition storage164 ofFIG. 7) for persistently storing the replicated conditions. Thus, the stored conditions represent predefined rules that can be applied to subsequently received abstract queries if the predefined rules are relevant to corresponding subsequently received abstract queries. Atstep860, therule application manager160 modifies the received abstract query and subsequently processes the modified abstract query atstep870 as explained above with reference toFIG. 5. One embodiment of modifying the received abstract query according to step860 is described below with reference toFIG. 9

For example, consider that the exemplary abstract query shown in Table III below is received (for brevity, only parts that are relevant for the following explanations are shown):

TABLE III


RECEIVED ABSTRACT QUERY

001

select <...>

	002	from demographic, diagnosis
	003	where age>18 and result=232.33

The received query contains a statement in line 002 indicating the queried tables “demographic” and “diagnosis” and a query condition in line 003 indicating that records having the properties “age>18” and “result=232.33” should be retrieved from these tables. Accordingly, since it is determined that the received query joins two tables, the condition “age>18 and result=232.33” is replicated to persistent storage atstep850 and the query is modified atstep860. In this example, it is noted that “232.33” is a diagnosis code, rather than a particular value for an expression.

If it is determined that the received abstract query does not join two or more tables in the database, i.e., the received abstract query is executed against a single database table,method800 continues atstep840 where therule application manager160 determines a performance criterion value. In one embodiment, the performance criterion value is an estimated number of rows or records which is likely to be contained in the expected query result. Alternatively, the performance criterion value may represent a time required for execution of the abstract query until the query result is obtained. The determination of the performance criterion value may be made on the basis of a previous execution of the abstract query or using conventional database technologies. Furthermore, therule application manager160 determines atstep880 whether the determined performance criterion value satisfies a predetermined criterion. The predetermined criterion may, in one embodiment, be application-specific or, alternatively, be defined via user input. In one embodiment, the predetermined criterion is a maximum number of records to be returned. If the estimated number of records (from step840) exceeds the predetermined criterion, then it may be assumed that generation of a temporary table would consume excessive system resources and, therefore, a temporary table will not be generated (i.e., processing proceeds to step850). Otherwise, generation of a temporary table is appropriate and processing proceeds to step890. In another embodiment, the predetermined criterion is a maximum allowable execution time. The threshold value can be determined on the basis of performance parameters of the computer system, on which query analysis is executed. An estimated performance criterion value which exceeds the predetermined criterion indicates that (re-)execution of the abstract query would be excessively time-consuming, even if generation of the temporary table would consume significant storage space. As a result, generation of a temporary table is appropriate and processing proceeds to step890. On the other hand, an estimated performance criterion value which does not exceed the predetermined criterion may mitigate towards performing query augmentation instead, in which case processing proceeds to step850. Whether the number of records, query execution time, or a combination of both are considered as part ofmethod800 is a implementation decision which may vary from one application to another.

Accordingly, if it is determined that the determined performance criteria value is not in the predetermined range of values, themethod800 continues atstep850 as described above. If it is determined that the determined performance criteria value is in the predetermined range of values, themethod800 continues atstep890, where at least one temporary table (e.g., temporary table733 ofFIG. 7) is generated and persistently stored in storage, so that the stored temporary table represents a predefined rule that can be applied to any subsequently received abstract query. One embodiment for generating a temporary table atstep890 is described below with reference toFIG. 10.

One embodiment of amethod900 for modifying a received abstract query according to step860 is explained with reference toFIG. 9. Atstep910, therule application manager160 parses the received abstract query to identify the database table(s) to be queried, i.e., the table(s) that is (are) accessed by the received abstract query. Atstep920, therule application manager160 identifies and retrieves relevant conditions from the persistent condition storage (e.g.,condition storage164 ofFIG. 7) and adds the retrieved conditions to the received abstract query atstep930. Identifying the relevant conditions may comprise, for example, determining conditions related to the same database table(s) to be queried and/or conditions relating to tables that are linked to the database table(s) to be queried by some identifier like a unique key. Processing then continues as described above with respect toFIG. 8.

In the case of the received query shown in Table III, therule application manager160 identifies (at step910) the tables “demographic” and “diagnosis” as those to be queried. Assume now that the exemplary abstract query shown in Table IV below was executed previous to the received query (again, for brevity, only parts that are relevant for the following explanations are shown):

TABLE IV


PREVIOUS ABSTRACT QUERY

001	select <...>

002	from demographic, test
003	where (test.hemoglobin>10 and test.hemoglobin<14) and

004	(demographic.city=‘Rochester’ or

	demographic.city=‘LaCrosse’)

In the previous query the query conditions (referred to as conditions C1 and C2) shown in Table V below have been identified and replicated to persistent storage:

TABLE V


QUERY CONDITIONS

	C1:	(test.hemoglobin>10 and test.hemoglobin<14)
	C2:	(demographic.city=‘Rochester’ or
		demographic.city=‘LaCrosse’)

Atstep920 the rule application manager identifies condition C2 as being relevant to the received query, as condition C2 defines a rule for the table “demographic” that is also queried by the received query. Accordingly, the rule application manager adds the condition C2 to the received query to thereby generate the modified abstract query shown in Table VI below:

TABLE VI


MODIFIED ABSTRACT QUERY

001

select <...>

	002	from demographic, diagnosis
	003	where age>18 and result=232.33 and

004

(demographic.city=‘Rochester’ or

	demographic.city=‘LaCrosse’)

One embodiment of amethod1000 for generating a temporary table (e.g., temporary table733 ofFIG. 7) according to step890 is explained with reference toFIG. 10. Atstep1010, the received abstract query is processed against one or more database tables as explained above with reference toFIG. 5 to obtain a query result. The obtained query result is persistently stored in storage (e.g.,condition storage164 ofFIG. 7) as a temporary table atstep1020, the temporary table representing a rule for limiting subsequently executed abstract queries against the one or more database tables to the data contained in the temporary table. Atstep1030 the corresponding data repository abstraction component (e.g., datarepository abstraction component148 ofFIG. 2) is modified, as explained below with reference toFIG. 11. Then, processing exits atstep1040.

As an example, the exemplary abstract query querying a single database table named “demographic” shown in Table VII below is received (for brevity, only parts that are relevant for the following explanations are shown):

TABLE VII


SINGLE TABLE QUERY

001

select <patient_id>

	002	from demographic
	003	where age>=20 or result>136

The single table query of Table VII is to be executed against the database table “demographic” shown in TABLE VIII below.

TABLE VIII


DATABASE TABLE “DEMOGRAPHIC”

	001	patient_id	age	result	hemo	city

002	1	17	136	9	Rochester
003	2	17	136	9	LaCrosse
004	3	17	136	10	Rochester
005	4	18	136	10	LaCrosse
006	5	18	128	9	Rochester
007	6	18	128	9	LaCrosse
008	7	18	128	10	Rochester
009	8	19	152	10	LaCrosse
010	9	19	136	9	Rochester
011	10	19	136	9	LaCrosse
012	11	19	136	10	Rochester
013	12	19	136	10	LaCrosse
014	13	19	152	9	Rochester
015	14	19	152	9	LaCrosse
016	15	20	136	10	Rochester
017	16	20	152	10	LaCrosse

Assume that the performance criteria is the estimated number of records and that the threshold value is “5”, so that the predetermined range of values is [0;5]. If the estimated number of records in the expected query result is “5” and, thus, does not exceed the threshold value, the single table query shown in Table VII is executed against the database table shown in Table VIII and the query result is persistently stored in storage as a temporary table shown in Table IX below:

TABLE IX


TEMPORARY TABLE

	001	patient_id	age	result	hemo	city

002	8	19	152	10	LaCrosse
003	13	19	152	9	Rochester
004	14	19	152	9	LaCrosse
005	15	20	136	10	Rochester
006	16	20	152	10	LaCrosse

As can be seen from Table IX, only the records in lines 009 and 014-017 of Table VIII satisfy the query condition in line 003 of the single table query of Table VII and are therefore stored in the temporary table (lines 002-006). Any subsequent abstract query against the database table “demographic” shown in TABLE VIII may then be performed on the temporary table, which accordingly implements a rule for restricting the searchable data to the subset of all the available data for any subsequently received abstract query.

One embodiment of amethod1100 for modifying a data repository abstraction component (e.g., datarepository abstraction component148 ofFIG. 1) according tostep1030 is explained with reference toFIG. 11. Atstep1110, therule application manager160 accesses the data repository abstraction component and reads and parses the logical fields included therein. Atstep1120, therule application manager160 retrieves attributes of the logical fields referring to underlying physical entities of the data in the database (e.g.,database156 ofFIG. 1). Atstep1130, therule application manager160 modifies the attributes to point to the temporary table in order to limit the data which is accessible using the data repository abstraction component to the searchable data. Processing then continues withFIG. 10 described above.

As an example, in the case of the illustrative data repository abstraction component shown in Table II above, therule application manager160 retrieves atstep1120 the access method attribute from line 006 (006 <Simple columnName=“f_name” tableName=“contact”></Simple>), which refers to a database table “contact” having a column “f_name”. Assuming that the temporary table has the table name “TMPcontact,” the data repository abstraction will be modified to point to the “TMPcontact” table. Specifically, the access method attribute from line 006 of Table II shown above is modified to <Simple columnName=“f_name” tableName=“TMPcontact”></Simple>).

In various embodiments, numerous advantages over the prior art are provided. According to the invention, an easy-to-use and flexible system for writing queries that interact freely is provided. More specifically, all such queries may interact with each other or not when executed against an underlying database. For instance, if a query is run against a data warehouse and a query result is obtained, this query result may be made available to all subsequently issued queries. Accordingly, any subsequently issued query will be executed against the data warehouse as if the previous query was the definition of the data warehouse. Furthermore, combining different conditions in different orders in queries may lead to different results, which are equally useful. Executing such queries separately will also lead to valid and potentially useful query results.

Moreover, 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 where 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 is available for use by queries, and has merely been bound to different entities or locations in a 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 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.

It should be noted that any reference herein to particular values, definitions, programming languages and examples is merely for purposes of illustration. Accordingly, the invention is not limited by any particular illustrations and examples. Further, while aspects of the invention are described with reference to SELECTION operations, other input/output operation are contemplated, including well-known operations such as UPDATE, INSERT, DELETE and the like. Of course, certain access methods may place restrictions on the type of abstract query functions that can be defined using fields that utilize that particular access method.

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.