Cascade feature for creating records in a database

• US 7,562,091 B2
• Filed: 12/16/2004
• Issued: 07/14/2009
• Est. Priority Date: 12/16/2004
• Status: Active Grant

• Current Assignee: Apple Inc.
• Original Assignee: Apple Inc.
• Inventors: Crim, Christopher Lee, Flisakowski, Shaun Patrick
• Primary Examiner(s): Rones; Charles
• Assistant Examiner(s): Cao; Phuong-Thao
• Application Number:
  US11/015,246
• Publication Number:
  US 20060136465A1
• Time in Patent Office: 1,671 Days
• Field of Search: 707/100, 707/101, 707/102
• 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 computer-implemented method of generating new records by a database program that serves as an interface to a database that stores at least a plurality of records in a computer readable medium, said computer-implemented 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 been created in said database, but is to be created as a first record in a first table which is related in a bidirectional relationship to a second table and at least one intermediate table between said first and second tables in said relationship, wherein said at least one intermediate table has at least one common field in common with each of said first and second tables;

generating, by said database program, said first record in said first table in order to create said non-existing record;

storing, by said database system, said first record in said computer readable medium;

recursively providing a parent record as the next child record in said bidirectional relationship in order to (a) determine whether to propagate one or more values;

copying match values from another parent record of the parent record to the next child record when said determining (a) determines to propagate said one or more values;

copying match values from the next child record of the child record to the other parent record when said determining (a) determines to propagate said one or more values;

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

(b) determining, by said database program, whether to propagate one or more values stored in common fields between said first, second, and at least one intermediate table in order to establish said bidirectional relationship for said first record; and

automatically propagating, by said database program, at least one of said values stored in said common fields between said first, second, and at least one intermediate table in both directions, thereby automatically creating said bidirectional relationship between said first record and one or more records of said second table and at least one intermediate table.

2. The 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.

3. The method as recited in claim 2, 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.

4. The 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.

5. The method as recited in claim 1, wherein said copying of match values from said another parent record to said next 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.

6. The method as recited in claim 5, wherein said copying of match values from said another parent record to said next 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.

7. The method as recited in claim 1, wherein said copying of match values from said next child record to other parent record comprises:

obtaining a relational predicate; and

determining whether said relational predicate is an equality predicate.

8. The method as recited in claim 7, wherein said copying of match values from said next child record to other 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.

9. The method as recited in claim 1, wherein said copying of match values from said next child record to other 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 said child are both not empty, wherein said state variable indicates that values should be copied from said parent to said child.

10. The 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 the record should be created in the at least one intermediate table.

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

12. A computer system for accessing a database, wherein said computer system includes at least one processor which is configured for:

receiving a request to enter data in a non-existing record in said database, wherein said non-existing record has not been created in said database, but is to be said relationship, wherein said at least one intermediate table has at least one common field in common with each of said first and second tables;

generating said first record in said first table in order to create said non-existing record;

recursively providing a parent record as the next child record in said bidirectional relationship in order to (a) determine whether to propagate one or more values;

copying match values from another parent record of the parent record to the next child record when said determining (a) determines to propagate said one or more values;

copying match values from the next child record of the child record to the other parent record when said determining (a) determines to propagate said one or more values;

entering said data into a field of said first record;

(b) determining whether to propagate one or more values stored in common fields between said first, second, and at least one intermediate table in order to establish said bidirectional relationship for said first record; and

automatically propagating at least one of said values stored in said common fields between said first, second, and at least one intermediate table in both directions, thereby automatically creating said bidirectional relationship between said first record and one or more records of said second table and at least one intermediate table.

13. The computer system as recited in claim 12, 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.

14. The computer system as recited in claim 12, wherein said computer system is further configured for:

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.

15. The computer system as recited in claim 12, wherein said copying of match values from said another parent record to said next 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.

16. The computer system as recited in claim 12, wherein said copying of match values from said next child record to other 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.

17. A computer readable medium including at least computer program code for generating new records in a database that stores at least a plurality of records, said computer readable medium comprising:

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 been created in said database, but is to be created as a first record in a first table which is related in a bidirectional relationship to a second table and at least one intermediate table between said first and second tables in said relationship, wherein said at least one intermediate table has at least one common field in common with each of said first and second tables;

computer program code for generating said first record in said first table in order to create said non-existing record;

computer program code for recursively providing a parent record as the next child record in said bidirectional relationship in order to (a) determine whether to propagate one or more values;

computer program code for copying match values from another parent record of the parent record to the next child record when said determining (a) determines to propagate said one or more values;

computer program code for copying match values from the next child record of the child record to the other parent record when said determining (a) determines to propagate said one or more values;

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

computer program code (b) determining whether to propagate one or more values stored in common fields between said first, second, and at least one intermediate table in order to establish said bidirectional relationship for said first record; and

computer program code automatically propagating by at least one of said values stored in said common fields between said first, second, and at least one intermediate table in both directions, thereby automatically creating said bidirectional relationship between said first record and one or more records of said second table and at least one intermediate table.

18. The computer readable medium as recited in claim 17, 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.

19. The computer readable medium as recited in claim 17, 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.

20. The computer readable medium as recited in claim 17, wherein said copying of match values from said another parent record to said next 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. The computer readable medium as recited in claim 17, wherein said copying of match values from said another parent record to said next 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.

22. The computer readable medium as recited in claim 17, wherein said copying of match values from said next child record to other parent record comprises:

obtaining a relational predicate; and

determining whether said relational predicate is an equality predicate.

23. The computer readable medium as recited in claim 17, wherein said copying of match values from said next child record to other 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.

24. The computer readable medium as recited in claim 17, wherein said copying of match values from said next child record to other 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 said child are both not empty, wherein said state variable indicates that values should be copied from said parent to said child.