Computer-implemented method for management of electronic data

• US 20060129594A1
• Filed: 11/01/2005
• Published: 06/15/2006
• Est. Priority Date: 12/13/2004
• Status: Abandoned Application

• Current Assignee: Markus Schumann, Stephan Ernst, UBS Ag
• Original Assignee: UBS Ag
• Inventors: Ernst, Stephan, Schumann, Markus
• Application Number:
  US11/262,912
• Publication Number:
  US 20060129594A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/219 Managing data history or versioning querying versioned data G06F16/2474; querying temporal data G06F16/2477

Abstract

A computer-implemented method for management of electronic data, comprises the steps: Writing of a data record into a first database (50), checking of the unchanged contents of this one data record on at least one predetermined condition and writing of the one data record into a second database (52) dependent on the fulfilling of the at least one predetermined condition.

Claims

1. Computer-implemented method for management of electronic data, comprising the steps:

writing of one data record into a first database (50),

checking of the unchanged contents of this one data record on at least one predetermined condition and

writing of the one data record into a second database (52) depending on fulfillment of the at least one predetermined condition.

2. Method according to claim 1, characterized by the step:

Deletion of the one data record in the first database (50) at a time closely related to when this data record is written to the second database (52).

3. Method according to claim 1, characterized by the step:

writing of one or more further data records, which are logically linked to the one data record, to the second database (52), depending on the writing of the one data record to the second database (52).

4. Method according to claim 3, characterized by the step:

deletion of each further data record in the first database (50) at a time closely related to when the relevant further data record is written to the second database (52).

5. Method according to claim 1, characterized in that the validation step can include the checking of a status field (22) of the one data record for a predetermined status.

6. Method according to claim 1, characterized in that the validation step includes the checking of whether a time (TS) specified in the one data record fufils a predetermined time condition.

7. Method according to claim 1, characterized by the step:

Writing of a data record identifier for a data record (62) already written to the second database (52), and in relation to the data record identifier (“

xyz”

)—

of an invalidity indicator (“

u”

) identifying this data record as invalid, to the first database (50).

8. Method according to claim 1, characterized in that the one data record represents a version of an information object (10, 12, 14) and contains a time stamp (TS) for version identification.

9. Method according to claim 8, characterized in that the time stamp (TS) contains a date and a time.

10. Method according to claim 8, characterized by the steps:

writing of several data records each representing a different version of the same information object (e.g. 34, 34′

) at different times to the first database (50), and

writing of each of these data records into the second database (52) depending on fulfillment of the at least one predetermined condition by that one of these data records whose time stamp (TS) identifies the youngest version of the information object.

11. Method according to claim 8, characterized by the steps:

writing of several data records (e.g. 34, 36, 38, 40, 42, 44, 46, 48), which at least partially represent different logically interlinked information objects, into the first database (50) and—

writing of each of these data records into the second database (52) dependent on the at least one predetermined condition being satisfied by one of these data records.

12. Method according to claim 11, characterized in that the information objects (10, 12, 14) are hierarchically linked to one another and the data records are written to the second database (52) dependent on a data record, which represents an information object (10) of a highest hierarchy level, fulfilling the at least one predetermined condition.

13. Computer program product, which causes the execution of the method according to claim 1 when it is processed by a computer.

14. Computer program product according to claim 13, characterized in that it is stored on a computer-readable magnetic or optical information carrier.