Cascade feature for creating records in a database

• US 20060136465A1
• Filed: 12/16/2004
• Published: 06/22/2006
• Est. Priority Date: 12/16/2004
• Status: Active Grant

• Current Assignee: Apple Inc.
• Original Assignee: Apple Computer Incorporated (Apple Inc.)
• Inventors: Crim, Christopher Lee, Flisakowski, Shaun Patrick
• Granted Patent: US 7,562,091 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2379 Updates performed during online database operations; commit processing
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface

Abstract

Techniques for providing a “cascade create” mechanism which allows data to be entered in related non-existing records in the database are disclosed. The techniques can be used to provide a database program that supports graphical, bi-directional data relationships, as well as multiple predicates. The “cascade create” mechanism supports arbitrary data relationships, as well as complex data models that are not supported by conventional techniques. Furthermore, the “cascade create” mechanism frees the users and database programmers from having to write code or provide rules that are specific to a particular data model and/or specific data relationship.

Claims

1. A method of generating new records by a database program that serves as an interface to a database, said method comprising;

receiving, by said database program, a request to enter data in a non-existing record in said database, wherein said non-existing record has not be created in said database, but can be created in a first table which is related in a relationship to a second table and at least one intermediate table between said first and second tables in said relationship;

generating, by said database program, a first record in said first table;

entering, by said database program, said data into a field of said first record;

determining, by said database program, whether one or more values need to be propagated between said first, second, and at least one intermediate table; and

propagating, by said database program, one or more values between said first, second, and at least one intermediate table when said determining determines that one or more values need to be propagated between said first, second, and at least one intermediate table, thereby ensuring that said relationship exists between said first record and one or more records of said second table and at least one intermediate table.

2. A method as recited in claim 1,

wherein said relationship is a bi-directional relationships, and

wherein said determining determines whether one or more values should be propagated in both directions between said first, second, and at least one intermediate table.

3. A method as recited in claim 2, wherein said propagating operates to propagate said one or more values in both directions between said first, second, and at least one intermediate table.

4. A method as recited in claim 1, wherein said method further comprises determining whether one or more values should be propagated in both directions between said first, second, and at least one intermediate table.

5. A method as recited in claim 4, wherein said one or more values are propagated between said first, second, and at least one intermediate table only if a cascade create option is enabled.

6. A method as recited in claim 1, wherein said method further comprises:

displaying at least one empty field which represents at least one field in a non-existing record;

determining whether a value has been entered in said at least one empty field; and

using said value as data to be entered in said first record when said determining determined that said value has been entered in said at least one empty field.

7. A method as recited in claim 1, wherein said method further comprises:

recursively providing a parent record as the next child record;

copying match values form a parent record to a child record; and

copying match values form a child record to a parent record.

8. A method as recited in claim 7, wherein said copying match values form a parent record to a child record comprises:

obtaining a relational predicate;

determining whether said relational predicate is an equality predicate;

determining whether a state variable is set to copy all parent values; and

determining whether a child value is missing.

9. A method as recited in claim 8, wherein said copying match values form a parent record to a child record further comprises:

determining whether a parent match field that relates said parent record to a child record is empty; and

copying said match value from said parent to said child when said determining determines said parent match field is not empty.

10. A method as recited in claim 7, wherein said copying match values form said child record to parent record comprises:

obtaining a relational predicate; and

determining whether said relational predicate is an equality predicate.

11. A method as recited in claim 10, wherein said copying match values form said child record to parent record comprises one or more of the following:

determining whether a parent record is missing;

determining whether a child and a parent match fields have a value; and

determining whether a parent record has not been created or modified.

12. A method as recited in claim 7, wherein said copying match values form said child record to parent record comprises:

determining whether match fields for a parent and a child are both empty; and

setting a state variable when said determining determines that said match fields for said parent and child are both empty, wherein said state variable indicates that values should be copied form said parent to said child.

13. A method as recited in claim 1, wherein said method further comprises:

determining whether a record should be created in at least one intermediate table; and

creating a record in at least one intermediate table when said determining determines that at least one intermediate table should created in at least one intermediate table.

25. A method as recited in claim 1, wherein said relationship is an arbitrary relationship, and said new record is created without specific user-code that provides rules that are specific to a particular data model or data relationship.

14. A database program that serves as an interface to a database, wherein said database program is capable of:

receiving a request to enter data in a non-existing record in said database, wherein said non-existing record has not be created in said database, but can be created in a first table which is related in a relationship to a second table and at least one intermediate table between said first and second tables in said relationship;

generating a first record in said first table;

entering said data into a field of said first record;

determining whether one or more values need to be propagated between said first, second, and at least one intermediate table; and

propagating one or more values between said first, second, and at least one intermediate table when said determining determines that one or more values need to be propagated between said first, second, and at least one intermediate table, thereby ensuring that said relationship exists between said first record and one or more records said second table and at least one intermediate table.

15. A database program as recited in claim 14,

wherein said relationship is a bi-directional relationships, and

wherein said determining determines whether one or more values should be propagated in both directions between said first, second, and at least one intermediate table.

16. A database program as recited in claim 14, wherein said propagating operates to propagate said one or more values in both directions between said first, second, and at least one intermediate table.

17. A database program as recited in claim 14, wherein said one or more values are propagated between said first, second, and at least one intermediate table only if a cascade create option is enabled.

18. A database program as recited in claim 14, wherein said database program is further capable of:

displaying at least one empty field which represents at least one field in a non-existing record;

determining whether a value has been entered in said at least one empty field; and

using said value as data to be entered in said first record when said determining determined that said value has been entered in said at least one empty field.

19. A database program as recited in claim 14, wherein said database program is further capable of:

recursively providing a parent record as the next child record;

copying match values form a parent record to a child record; and

copying match values form a child record to a parent record.

20. A database program as recited in claim 19, wherein said copying match values form a parent record to a child record comprises:

obtaining a relational predicate;

determining whether said relational predicate is an equality predicate;

determining whether a state variable is set to copy all parent values; and

determining whether a child value is missing.

21. A database program as recited in claim 19, wherein said copying match values from said child record to parent record comprises one or more of the following:

determining whether a parent record is missing;

determining whether a child and a parent match fields have a value; and

determining whether a parent record has not been created or modified.

22. A computer readable medium including at least computer program code for receiving a request to enter data in a non-existing record in said database, wherein said non-existing record has not be created in said database, but can be created in a first table which is related in a relationship to a second table and at least one intermediate table between said first and second tables in said relationship;

computer program code for generating a first record in said first table;

computer program code for entering said data into a field of said first record;

computer program code for determining whether one or more values need to be propagated between said first, second, and at least one intermediate table; and

computer program code for propagating one or more values between said first, second, and at least one intermediate table when said determining determines that one or more values need to be propagated between said first, second, and at least one intermediate table, thereby ensuring that said relationship exists between said first record and one or more records said second table and at least one intermediate table.

23. A computer readable medium as recited in claim 22, wherein said computer readable medium further comprises:

computer program code for displaying at least one empty field which represents at least one field in a non-existing record;

computer program code for determining whether a value has been entered in said at least one empty field; and

computer program code for using said value as data to be entered in said first record when said determining determined that said value has been entered in said at least one empty field.

24. A computer readable medium as recited in claim 22, wherein said computer readable medium further comprises:

computer program code for recursively providing a parent record as the next child record;

computer program code for copying match values form a parent record to a child record; and

computer program code for copying match values form a child record to a parent record.