Computer-implemented method for managing through symbolic abstraction of a membership expression multiple logical representations and storage structures

• US 20080010241A1
• Filed: 12/31/2006
• Published: 01/10/2008
• Est. Priority Date: 04/02/2002
• Status: Abandoned Application

• Current Assignee: David McGoveran
• Original Assignee: David McGoveran
• Inventors: McGoveran, David
• Application Number:
  US11/649,090
• Publication Number:
  US 20080010241A1
• Time in Patent Office: Days
• US Class Current: 707/002
• CPC Class Codes: G06F 16/284 Relational databases

Abstract

This is a computer-implemented method for managing and enhancing data independence among multiple logical representations and storage structures of data by accessing and updating physical storage through a relational representation. The present invention supports both data independence and storage flexibility by using membership abstraction as the equalizing access for any logical representation and actual storage, while the prior art is restricted to user-supplied denotations and catalog entries.

Claims

1. A computer implemented method for managing and understanding logical and physical representations of data and enhancing data independence among representations comprising:

identifying a first table reference denoting a first table;

using the first table reference to retrieve from computer storage a first membership abstraction for the first table; and

,

expressing the membership expression through at least one of the acts of printing, displaying, speaking, and storing the membership expression.

2. A method as in claim 1 further comprising:

rewriting the first membership abstraction to create a definitional expression replacing at least one formal component of the first membership abstraction with at least a first natural language expression; and

,

expressing the membership expression through at least one of the acts of printing, displaying, speaking, and storing the membership expression.

3. A method as in claim 1 further comprising:

specifying a first operation to be at least one of a computational procedure and any logical, mathematical, relational, and recursive operation; and

,

composing a second membership abstraction from a set of membership abstractions comprising at least the first membership abstraction and a set of operations comprising at least the first operation.

4. A computer implemented method for managing and understanding logical and physical representations of data and enhancing data independence among representations comprising:

accessing a first membership abstraction;

decomposing the first membership abstraction into a combination of component membership abstractions; and

,

repeating the step of decomposing on each component membership abstraction until every component membership abstraction in the combination is that of an identifiable table.

5. A computer implemented method for managing and understanding logical and physical representations of data and enhancing data independence among representations comprising:

converting a natural language expression into a membership abstraction; and

,

identifying, as corresponding to some element of the natural language expression, at least one member of a set of database elements comprising column name, table name, an operation on a column, an operation on a table, and an operation on a plurality of tables, incorporated in the membership abstraction.

6. A method as in claim 5 wherein the natural language expression represents a database query.

7. A computer implemented method for managing logical and physical representations of data consistently by manipulating the logical representation, comprising:

specifying at least a first data element of the logical representation;

deriving at least a first derived data element from at least the first data element of the logical representation;

specifying at least a first table of the logical representation, a first column of the first table further representing a second data element of the logical representation;

implementing the first table of the logical representation as a derived table;

defining the derived table from at least a first target data element of the logical representation;

updating the first target data element of the logical representation by updating the derived table with data values from the first derived data element, said updating further comprising;

decomposing a first membership abstraction corresponding to the derived table into a set of component membership abstractions, each member of which is identifiable as corresponding to a target table; and

,

decomposing the update expression into a set of expressions comprising (i) a set of component update expressions, each of which modifies one target table and (ii) a set of logical constraints and conditions that must evaluate to true after any modifications represented by the update expression are completed; and

,

applying each resulting modification of any table in the logical representation to that table'"'"'s corresponding physical representation.

8. A method as in claim 7 wherein the physical representation of at least one member of a set, with that member comprising a first table in the logical representation of the source and a first table in the logical representation of the target, is not tabular.