Establishing a data mangement fee structure based on fine grained data entities

Abstract

Systems, methods and articles of manufacture for accessing data for a fee are provided. Fee schedules are defined for any arbitrary granularity of data, including for fields and data structures (e.g., tables in a database). Fees may be calculated based on the type of operation to be performed. Fees may also be calculated per operation and/or per data item involved in the operation.

What is claimed is: 
     
         1 . A computer program product to modify physical data comprising a plurality of physical entities and having a particular physical data representation in a database, the computer program product comprising:
 a computer-readable storage medium having computer-readable program code embodied therewith, the computer-readable program code comprising:   computer-readable program code configured to receive a selection of an abstract modification operation;   computer-readable program code configured to receive a selection of a model entity definition on which to perform the abstract modification operation, the model entity definition comprising two or more logical fields each corresponding to a separate physical entity;   computer-readable program code configured to, based on at least the received selections, generate at least two physical modification statements, each modifying one of the two separate physical entities of the physical data;   computer-readable program code configured to order the at least two physical modification statements;   computer-readable program code configured to execute modification operations according to the physical modification statements, whereby the data is modified; and   computer-readable program code configured to calculate a fee to charge for executing the modification operations based on a defined fee schedule for the model entity definition.   
     
     
         2 . The computer readable storage medium of  claim 1 , wherein each physical modification statement is selected from one of an insert statement and an update statement and wherein the defined fee schedule defines different fees for each statement. 
     
     
         3 . The computer readable storage medium of  claim 2 , wherein the ordering is done according to a physical entity relationships specification defining hierarchical relationships between physical entities of the data to ensure integrity of the data. 
     
     
         4 . The computer readable storage medium of  claim 2 , wherein generating the at least two physical modification statements is done according to mapping rules which map the two or more logical fields to their corresponding physical entity. 
     
     
         5 . A computer, comprising:
 a memory containing a program;   one or more processors which, when executing the program, performs an operation for modifying physical data comprising a plurality of physical entities and having a particular physical data representation in a database, the operation comprising:
 receiving a selection of an abstract modification operation; 
 receiving a selection of a model entity definition on which to perform the abstract modification operation, the model entity definition comprising two or more logical fields each corresponding to a separate physical entity; 
 based on at least the received selections, generating at least two physical modification statements, each modifying one of the two separate physical entities of the physical data; 
 ordering the at least two physical modification statements; 
 executing modification operations according to the physical modification statements, whereby the data is modified; and 
 calculating a fee to charge for executing the modification operations based on a defined fee schedule for the model entity definition. 
   
     
     
         6 . The computer of  claim 5 , wherein each physical modification statement is selected from one of an insert statement and an update statement and wherein the defined fee schedule defines different fees for each statement. 
     
     
         7 . The computer of  claim 5 , wherein the ordering is done according to a physical entity relationships specification defining hierarchical relationships between physical entities of the data to ensure integrity of the data. 
     
     
         8 . The computer of  claim 5 , wherein generating the at least two physical modification statements is done according to mapping rules which map the two or more logical fields to their corresponding physical entity.