US 6,405,218 B1Grant
Synchronizing databases
Issue Date:2002-06-11
•92 Claims
•8 Drawing Sheets
Abstract
A computer program and a computer implemented method are provided for synchronizing two databases by attempting to identify a plurality of records of the second database storing a span of information stored in a record of the first database and synchronizing the first database and the second database based on the results of the attempt. The computer program and a computer implemented can also store a record of a first database in a second database where the record of the first database stores a span of information and the second database is not capable of storing such span of information in a single record. To do so, a plurality of records of the second database are generated to store the span of information of the record of the first database, each of the plurality of the records of the second database storing a portion of the span of the information, where the plurality of records of the second database in combination store a selected segment of the span of information less than the entirety of the span of information.
Metadata
Assignee
- Pumatech, Inc.
Inventor
- David J. Boothby
Application Information
Application Number:US 09/169,199
Filing Date:1998-10-09
Priority Date:1996-11-13
Art Unit:7
Classifications
IPC:
G06F 1730
Field of Search:
707200707201707202707203707204707 10707102709248714 20
Patent Drawings (8 sheets)
Description
Cross Reference to Related Applications
[0002] This application is a continuation-in-part of the commonly assigned application entitled “Synchronization of Recurring Records in Incompatible Databases”, Ser. No. 08/752,490, filed on Nov. 13, 1996 now U.S. Pat. No. 5,943,676.
Background of the Invention
[0003] This invention relates to synchronizing databases.
[0004] Databases are collections of data entries which are organized, stored, and manipulated in a manner specified by applications known as database managers (hereinafter also referred to as “Applications”; hereinafter, the term “database” also refers to a database manager combined with a database proper). The manner in which database entries are organized in a database is known as the data structure of the database. There are generally two types of database managers. First are general purpose database managers in which the user determines (usually at the outset, but subject to future revisions) what the data structure is. These Applications often have their own programming language and provide great flexibility to the user. Second are special purpose database managers that are specifically designed to create and manage a database having a preset data structure. Examples of these special purpose database managers are various scheduling, diary, and contact manager applications for desktop and handheld computers. Database managers organize the information in a database into records, with each record made up of fields. Fields and records of a database may have many different characteristics depending on the database manager's purpose and utility.
[0005] Databases can be said to be incompatible with one another when the data structure of one is not the same as the data structure of another, even though some of the content of the records is substantially the same.
[0006] Often users of incompatible databases want to be able to synchronize them with one another. For example, in the context of scheduling and contact manager Applications, a person might use one application on a desktop computer at work while another on his handheld computer or his laptop computer while away from work. It is desirable for many of these users to be able to synchronize the entries on one with entries on another. U.S. patents of the assignee hereof, Puma Technology, Inc. of San Jose, Calif. (U.S. Pat. No. 5,392,390, hereinafter, “the '390 patent”, incorporated by reference herein; and U.S. Pat. No. 5,684,990, filed on Jan. 11, 1995, incorporated by reference herein) show two methods for synchronizing incompatible databases and solving some of the problems arising from incompatibility of databases.
Summary of the Invention
[0007] In one aspect, the invention features a computer program and a computer implemented method for synchronizing two databases by attempting to identify a plurality of records of the second database storing a span of information stored in a record of the first database and synchronizing the first database and the second database based on the results of the attempt.
[0008] Preferred embodiments of the invention may include one or more of the following features.
[0009] To synchronize the first database and the second database, the plurality of records of the second database are processed to generate a record representative of a span of information represented by the plurality of records of the second database. The generated record is then compared to the record of the first database and synchronization action is taken based on the comparison.
[0010] The span of information represented by the record of the first database may include date-bearing information such as recurring date-bearing information or a continuous span of information. If the span of information includes recurring date-bearing information, the identified plurality of records of the second database may represent instances of a recurring date-bearing record.
[0011] The span of information may be a continuous period of time. In that case, the starting time and date and the ending time and date of the record of the first database span a period of time longer than a period permitted by the second database. Each of the identified plurality of the records of the second database stores a portion of the span of the information, where the identified plurality of records of the second database in combination store the span of information or a selected segment thereof. The continuous period of time can be longer than a period of time permitted by the second database. The identified plurality of records of the second database may include a recurring record. Note that the record of the first database may also be a recurring record where each instance stores a span of information greater than that permitted by the second database.
[0012] Synchronizing the first database and the second database includes adding, modifying, or deleting one of the records.
[0013] The record of the first database is deleted, if the attempt to identify the plurality of records of the second database is unsuccessful.
[0014] If a plurality of records of the second database is identified as storing the span of information stored in the record of the first database, synchronizing the first database and the second database includes comparing the record of the first database to the identified plurality of records of the second database and synchronizing the identified plurality of records of the second database with the record of the first database based on the results of the comparison.
[0015] The identified plurality of records of the second database are processed to generate a span of information representative of information stored in the identified plurality of records of the second database. Then, comparing the record of the first database to the records of the second database includes comparing the span of information stored in the record of the first database to the generated span of information. In addition, a record is generated based on the identified plurality of records of the second database where the record stores the generated span of information. This generated record is then used for comparing the record of the first database to the identified plurality of the second database.
[0016] A history file stores information reflecting the records of the first and second databases at a previous synchronization. The record of the first database and the identified plurality of records of the second database are compared to the information in the history file. Synchronizing the first database and the second database then includes synchronizing based on results of the comparison to the history file.
[0017] The records of the second database can be compared to the information in the history file to identify the plurality of records of the second database based on the results of the comparison. Alternatively, the record of the first database can be compared to the records of the second database to identify the plurality of records of the second database.
[0018] Additionally, the record of the first database can be a record which was present during the previous synchronization and which was deleted from the first database prior to the current synchronization. Synchronizing the first database and the second database then includes deleting the identified plurality of records of the second database.
[0019] To identify the plurality of records of the second database, a plurality of instances are generated based on a previously determined pattern for generating a plurality of instances which in combination represent the span of information stored by the record of the first database. A second plurality of the records of the second database are then correlated to the plurality of generated instances by comparing the plurality of generated instances to the records of the second database. The second plurality of the records of the second database is then determined to be the identified plurality of records of the second database.
[0020] The previously determined pattern is selected based on a characteristic of the span of information stored in the record of the first database. Also, the plurality of generated instances are generated using the record of the first database or a corresponding history file record.
[0021] Further, at a previous synchronization, a plurality of instances of the second database is generated based on a second previously determined pattern for generating a plurality of instances which in combination represent a span of information. At the previous synchronization, information is stored in the history file reflecting the second previously determined pattern. That information is then retrieved from the history file during the current synchronization. The retrieved information determines the pattern used for generating the second plurality of records of the second database.
[0022] In some embodiments, for example, when a history file is not available, to identify a plurality of records of the second database to the record of the first database, a first plurality of instances are generated based on a first previously determined pattern for generating a plurality of instances which in combination represent the span of information stored by the record of the first database. A second plurality of the records of the second database are then correlated to the first plurality of generated instances by comparing the first plurality of generated instances to the records of the second database. A second plurality of instances are generated based on a second previously determined pattern for generating a plurality of instances which in combination represent a span of information. A third plurality of the records of the second database are correlated to the second plurality of generated instances by performing a comparison of the second plurality of generated instances to the records of the second database. The identified plurality of records of the second database are then identified based on the results of correlating the second plurality of the second database to the first plurality of generated instances and the third plurality of the second database records to the second plurality of generated instances. To do so, the number of records in the second plurality of instances of the second database is then compared to the number of records in the third plurality of instances of the second database.
[0023] In some embodiments, when the records of the second database are assigned unique identifications, a plurality of instances are generated, at a previous synchronization, based on a previously determined pattern for generating a plurality of instances which in combination represent the span of information stored by the record of the first database. At the previous synchronization, the generated records are stored in the second database. Also, at the previous synchronization, information is stored in a history file to reflect the unique identifications of the generated instances stored in the second database. In this case, to identify a plurality of records of the second database to the record of the first database further, the history file information is retrieved and correlated to unique identifications of the records of the second database. The identified records of the second database are determined to be the correlated records of the second database.
[0024] The span of information represented by the record of the first database may be textual information, where size of the textual information is larger than that permitted by the second database. The plurality of records of the second database then include textual information, the textual information of the plurality of records of the second database in combination represent the textual information represented by the record of the first database.
[0025] In another aspect, the invention features a computer program and a computer implemented method for storing a record of a first database in a second database where the record of the first database stores a span of information and the second database is not capable of storing such span of information in a single record. A plurality of records of the second database are generated to store the span of information of the record of the first database, each of the plurality of the records of the second database storing a portion of the span of the information, where the plurality of records of the second database in combination store a selected segment of the span of information less than the entirety of the span of information.
[0026] Preferred embodiments of the invention may include one or more of the following features.
[0027] The selected segment is a selected date range narrower than the date range of the second database. The selected date range is determined relative to a selected date by applying a rule. The rule can be a preference for future dates compared to a current date over past dates compared to the current date, a preference for dates closer to a current date over dates further from the current date, and a limit on a total number of generated records.
[0028] The invention may be implemented in hardware or software, or a combination of both. Preferably, the technique is implemented in computer programs executing on programmable computers that each include a processor, a storage medium readable by the processor (including volatile and non-volatile memory and/or storage elements), at least one input device, and at least one output device. Program code is applied to data entered using the input device to perform the functions described above and to generate output information. The output information is applied to one or more output devices.
[0029] Each program is preferably implemented in a high level procedural or object oriented programming language to communicate with a computer system. However, the programs can be implemented in assembly or machine language, if desired. In any case, the language may be a compiled or interpreted language.
[0030] Each such computer program is preferably stored on a storage medium or device (e.g., ROM or magnetic diskette) that is readable by a general or special purpose programmable computer for configuring and operating the computer when the storage medium or device is read by the computer to perform the procedures described in this document. The system may also be considered to be implemented as a computer-readable storage medium, configured with a computer program, where the storage medium so configured causes a computer to operate in a specific and predefined manner.
[0031] Other features and advantages of the invention will become apparent from the following description of preferred embodiments, including the drawings, and from the claims.
Brief Description of the Drawing
[0032] FIG. 1 shows two computers connected via a data transfer link.
[0033] FIG. 2 is a schematic drawing of the various modules constituting an embodiment of a synchronization program.
[0034] FIG. 3 is a representation of a workspace data array used by the synchronization program of FIG. 2.
[0035] FIG. 4 is the pseudocode for a Translation Engine Control Module of the synchronization program of FIG. 2.
[0036] FIG. 5 is the pseudocode for loading a history file.
[0037] FIG. 6 is the pseudocode for the steps taken by a translator to load records of a database.
[0038] FIG. 7 is the pseudocode for the steps taken by the synchronizer module of the synchronization program of FIG. 2 for correlating records of the local database, the remote database, and the history file to one another.
[0039] FIG. 8 is the pseudocode for the steps taken by a translator to unload records to a database.
Description
[0040] We will describe embodiments of the invention in detail below, but briefly, referring to FIGS. 1 and 2, a synchronization program 100 runs on a local computer 20 (e.g. a desktop or server computer) which is typically connected to a remote computer 22 (e.g. a handheld or notebook computer) via a data transfer link 24 enabling the computers to transfer data between them. Data transfer link 24 may be a serial infrared link, serial cable, modem and telephone line combination, or other such data transfer links. Each of the local and remote computers stores a corresponding local or remote database, which may, for example, be a scheduling database (such as those sold under the tradenames Microsoft Schedule+ and Lotus Organizer).
[0041] Synchronization program 100 synchronizes the records of the local and remote databases typically using a history file that contains records reflecting the records of the two databases at the end of a previous synchronization. The synchronization program 100 uses the history file to determine, for example, which records have been changed, added or deleted since the previous synchronization and which records of the two databases correspond to one another.
[0042] As part of the synchronization process, synchronization program 100 can synchronize a local or remote database record which has a span or expanse of information not permitted by the other database. The local or remote database record may be a date bearing record spanning a continuous period of time (e.g. from 8:00 a.m. on Monday to 5 p.m. on Friday) larger than is permitted in a corresponding record of the other database. Such record may also be a date bearing recurring record (e.g. a record representing a recurring appointment or event) having a recurrence pattern not permitted by the other database. For example, the local or remote database record may have a recurrence pattern of “every other week” where such a pattern is not permitted in the other database.
[0043] In synchronizing such records, synchronization program uses multiple records of the other database to store or reflect the span of information represented by such records. Each of the multiple records of the other database then would store a portion of the span of information and, taken together, the plurality of records store the entire or at least a useful portion of the span of information stored in the remote or database record.
[0044] We will now describe in detail the structure of synchronization program 100 and the method it uses to synchronize the local and remote databases where at least one of them includes a record which stores a span of information which can not be stored in a single record of the other database.
[0045] FIG. 2 shows the relationship between various modules of an embodiment of synchronization program 100. Synchronization program 100 includes a Translation Engine 1. Translation Engine 1 comprises a Control Module 2 and a Parameter Table Generator 3. Control Module 2 is responsible for controlling the synchronizing process by instructing various modules to perform specific tasks on the records of the two databases being synchronized. (FIG. 4 is the pseudocode for the steps taken by this module.)
[0046] Parameter Table Generator 3 is responsible for creating a Parameter_Table 4 which is used by all other modules for synchronizing the databases. Generally, Parameter_Table 4 stores various information which may be used by the modules of synchronization program 100. The information stored in Parameter_Table 4 includes user preferences, the names and locations of the databases, and the names and locations of various files stored on disk including the name and location of the history file from a previous synchronization.
[0047] A synchronizer 15 has the primary responsibility for carrying out the core synchronizing functions. It is a table-driven program which is capable of synchronizing various types of databases whose characteristics are provided in Parameter_Table 4. Synchronizer 15 creates and uses workspace 16 (also shown in FIG. 3), which is a temporary data array used during the synchronization process.
[0048] Synchronization program 100 has two translator modules 5 and 9 which are generally responsible for data communication between synchronization program 100 and databases 13 and 14. Translator (L_translator) 5 is assigned to the local database (L_database) 13 and translator 9 (R_translator) to the remote database (R_database) 14. Each of the database translators 5 and 9 comprises three modules: reader modules 6 and 10 (L_reader and R_reader) which load (or read) records from databases 13 and 14; unloader modules 8 and 12 (L_unloader and R_unloader) which analyze and unload records from workspace 16 into databases 13 and 14; and sanitizing modules 7 and 11 (L_sanitizer and R_sanitizer) which analyze the records of the opposing database when they are loaded into the workspace and modify them according to rules of data value of the modules's own database. Briefly stated, rules of data value are generally rules that define the permitted content of the fields of the records of a database. An example of such a rule would be that no more than 100 characters may be present in a field, or that content of a field designating a priority for a “to do” item should be limited to 1, 2, or 3. Sanitizing a record is to change the content of the fields of a record of one database to conform to the rules of data value of another database. Rules of data value and sanitization are described in detail in the following commonly owned U.S. patent applications, incorporated in their entirety by reference, “Synchronization of Recurring Records in Incompatible Databases”, Ser. No. 08/752,490, filed on Nov. 13, 1996 (hereinafter, “application '490”) now U.S. Pat. No. 5,943,676; “Synchronization of Databases with Record Sanitizing and Intelligent Comparison,” Ser. No. 08/749,926, filed Nov. 13, 1996 (hereinafter, “application '926”) now abandoned; “Synchronization of Databases with Date Range,” Ser. No. 08/748,645, filed Nov. 13, 1996 (hereinafter, “application '645”) now U.S. Pat. No. 6,141,664.
[0049] In the described embodiment, the modules of L_translator 5 are designed specifically for interacting with local database 13 and local application 17. The design of the modules of L_translator 5 is specifically based on the record and field structures and the rules of data value imposed on them by the local application, the Application Program Interface (API) requirements and limitations of local application 17 and other characteristics of the local database and application. The same is true of the modules of R_translator 9. These translators are typically not able to interact with other databases or Applications and are only aware of the characteristics of the database and application for which they are designed. Therefore, when the user chooses two applications for synchronization, Translation Engine 1 chooses the two translators which are able to interact with those applications. In an alternate embodiment, the translators can be designed as table-driven programs, where a general translator is able to interact with a variety of applications and databases based on supplied parameters.
[0050] Generally, a translator is designed, among other functions and capabilities, for determining whether a span of information can be stored in a single record of its associated database or whether multiple records must be generated to store the information. Additionally, a translator is designed to generate multiple records to store the span of information to be stored. A translator generates such multiple records using predetermined patterns for generating multiple records. What pattern is used generally depends on the nature of the span of information and the limitations of the database.
[0051] We will now describe an example of patterns used for generating multiple records to store a span of information. One exemplary pattern is to generate multiple records, each storing information with respect to one instance of a recurring record. The patterns used to generate such instances and records will be referred to as fanning patterns and the process of generating instances and records according to this pattern will be referred to as fanning. Instances and records generated using a fanning pattern will be referred to as fanned instances and records.
[0052] Another exemplary pattern is to generate multiple records each of which stores information with respect to one of a number of instances, where the instances in combination span a continuous period of time represented by a single record of the other database. For example, in the case of an appointment which spans from Monday at 8 a.m. to Friday at 5 p.m., multiple daily records may be generated to cover or tile over this span, such as Monday 8 a.m. to 11:59 p.m., Tuesday 12 a.m. to 11:59 p.m., Wednesday 12 a.m. to 11:59 p.m., Thursday 12 a.m. to 11:59 p.m., and Friday 12 a.m. to 5 p.m. Such a record can also be based on the following pattern: Monday 8 a.m. to 11:59 p.m., 3-day Daily repeat 12 a.m. to 11:59 p.m. covering Tuesday through Thursday, and Friday 12 a.m. to 5 p.m. The patterns used to generate such instances and records will be referred to as tiling patterns and the process of generating instances and records according to this pattern will be referred to as tiling. Instances and records generated using a tiling pattern will be referred to as tiled instances and records.
[0053] Translators can also use combinations of fanning and tiling patterns to generate multiple records. Table 1 shows various examples of patterns which may be used.
| Pattern for | ||
|---|---|---|
| generating | ||
| multiple | ||
| Record to be | instances or | |
| stored | records | Generated instances or records |
| Lunch with | FAN | April 15, 1998 at 12 p.m.-1 p.m.; |
| X Every | May 15, 1998 at 12 p.m.-1 p.m.; | |
| 15th - | June 15, 1998 at 12 p.m.-1 p.m.; | |
| 12 p.m.-1 | etc. | |
| p.m. | ||
| Conference | TILE DAY BY | Monday 9 am-11:59 pm; Tuesday 12 |
| from 9 am | DAY: Tile with | am-11:59 pm; Wednesday 12 am-11:59 |
| Monday | nonrecurring | pm; Thursday 12 am-11:59 pm; |
| through 5 | instances | Friday 12 am-5 pm |
| pm Friday | ||
| (non- | ||
| recurring) | ||
| Conference | TILE WITH | Monday 9 am-11:59 pm; DAILY item |
| from 9 am | DAILY RE- | 12 am-11:59 pm Tuesday through |
| Monday | PEAT: Tile with | Thursday; Friday 12 am-5 pm |
| through 5 | recurring records | |
| pm Friday | ||
| (non- | ||
| recurring) | ||
| Quarterly | CROSS-SEC- | Quarterly, on the last Wednesday of |
| accounting | TIONAL TIL- | each quarter, from 9 am to 11:59 pm; |
| marathons | ING: Each Tile | Quarterly, on the last Thursday of |
| (recurring) | here is a recur- | each quarter, from 12 am to 11:59 |
| ring item | pm; Quarterly, on the last Friday of | |
| each quarter, from 12 am to 9 pm | ||
| Yearly Plant | FAN AND TILE | 12/24/99, 3 pm-11:59 pm; Daily Re- |
| Shut Down, | WITH DAILY | peat, 12/25/99-1/1/00, 12 |
| every year, | REPEAT: fan the | am-11:59 pm; 1/2/00, 12 am-9 am; |
| starting 3 | master item into | 12/24/00, 3 pm-11:59 pm; Daily Re- |
| pm, Decem- | a set of in- | peat 12/25/00-1/1/01, 12 am-11:59 pm; |
| ber 24th | stances, then | 1/2/01, 12 am-9 am |
| through | TILE each | . . . |
| 9 am January | instance, | |
| 2nd. | allowing DAILY | |
| RECURRING | ||
| TILES to result. | ||
| Quarterly | FAN AND TILE | Wednesday, 3/29/98, 9 am-11:59 pm; |
| accounting | DAY BY DAY: | Thursday, 3/30/98, 12 am-11:59 pm; |
| marathons | fan the master | Friday, 3/31/98, 12 am-9 pm; Wednes- |
| (recurring) | item into a set of | day, 6/28/98, 9 am-11:59 pm; Thurs- |
| instances which | day, 6/29/98, 12 am-11:59 pm; Friday, | |
| are then TILED | 6/30/98, 12 am-9 pm; Wednesday, | |
| into N non- | 9/28/98, 9 am-11:59 pm; Thursday, | |
| recurring tiled | 9/29/98, 12 am-11:59 pm; Friday, | |
| instances. | 9/30/98, 12 am-9 pm; Wednesday, | |
| 12/29/98, 9 am-11:59 pm; Thursday, | ||
| 12/30/98, 12 am-11:59 pm; Friday, | ||
| 12/31/98, 12 am-9 pm; Wednesday, | ||
| 3/29/99, 9 am-11:59 pm; Thursday, | ||
| 3/30/99, 12 am-11:59 pm; Friday, | ||
| 3/31/99, 12 am-9 pm; . . .and so | ||
| forth, up to the max fanning*tiling | ||
| count. . . | ||
[0054] Referring back to FIG. 1, having described the structure of synchronization program 100 in reference to its various modules, we will now describe the operation of synchronization program 100. During synchronizing two database, Control Module 2 instructs the various modules in synchronization program 100 to perform specific tasks. In this manner, Control Module 2 controls the operation of various modules of synchronization program 100. Hence, we will describe the operation of synchronization program 100 by describing the steps taken by Control Module 2 (as set out in the pseudo code in FIG. 4) and describing in detail the actions by the various modules of synchronization program 100 as they are instructed by Control Module 2.
[0055] Referring to FIG. 4, in the first step of synchronizing the two databases, Control Module 2 instructs the Parameter Table Generator 3 to create parameter table 4 (Step 100). In this step, as part of creating parameter table 4, Parameter Table Generator 3 obtains from the user various parameters governing user preferences to be used during synchronization or alternatively accesses a previously stored set of user preferences. One of these user preferences can be a date range which is then used to limit synchronization to that date range. There are two types of date ranges which the user can select. One type of date range is a static date range which remains the same from one synchronization to the next. An example of a static date range is one being from Jan. 1, 1998 to Dec. 31, 1998. Another type of date range is a dynamic date range which is typically anchored to a preselected reference date and changes as that reference date changes. An example of dynamic date ranges is one being from the beginning to the end of the current quarter. Another is one from a month before today to a month after. Date ranges and synchronization of databases using date ranges are described in detail in the '490, '926, and '645 applications and U.S. Patent Application “Synchronization Of Databases Using Filters”, Ser. No. 09/036,400, filed on Mar. 5, 1998, now U.S. Pat. No. 6,212,529 incorporated by reference in its entirety.
[0056] After Parameter Table Generator 3 creates the parameter table 4, Control Module 2 of the Translation Engine 1 instructs synchronizer 15 to initialize itself (step 101). Synchronizer 15 in response creates the workspace data array 16. Control Module 2 of the Translation Engine 1 then instructs synchronizer 15 to load history file 19 into workspace 16 (step 102). History file 19 is a file that was saved at the end of last synchronization and contains records reflecting the records of the two databases at the end of the previous synchronization. Synchronizer 15 uses history file 19 during current synchronization to analyze the records of the local and remote database to determine changes, additions, and deletions in each of two databases since the previous synchronization. Synchronizer 15, as result of this analysis, then can determine what additions, deletions, or updates need be made to synchronize the records of the two databases.
[0057] In various situations, synchronizer 15 does not load history file 19. For example, if no history file from a previous synchronization exists or if the user chooses to synchronize not using the history file, synchronizer 15 will not load history file 19. Obviously, in the case where a history file is not loaded, synchronizer 15 synchronizes the two databases without using a history file.
[0058] FIG. 5 is the pseudocode for the steps taken by synchronizer 15 to load history file 19. For each Record in history file 19 (step 200), synchronizer 15 first loads the record (step 201) and then writes the loaded record into workspace 16 (step 202). Synchronizer 15 repeats these steps until all of the records of the history file are loaded into the workspace.
[0059] Referring back to FIG. 4, after the history file is loaded into the workspace, Control Module 2 instructs R_translator 13 to load the remote database records (step 103). FIG. 6 is the pseudocode for the steps taken by R_translator 13 to load the remote database records. For each record of the remote database (step 301), R_reader module 11 of the R_translator first loads the record (step 302). If a date range is being used, then R_reader module 11 applies the current date range to the loaded record (step 303). This step can also be performed by synchronizer 15. If the record passes (i.e., falls within) the date range then R_reader module 11 marks the record as having passed the date range (step 304). If the record does not pass the date range then R_reader module 11 marks the record as having failed the date range (step 305). R_reader module 11 then sends the record to synchronizer 15 (step 307) and synchronizer 15 writes the loaded record into workspace 16 (step 308).
[0060] At this point, if the record has a unique identification code (hereinafter, also referred to as “unique ID”) which was assigned by the remote database, the unique ID is compared to unique IDs, if any, stored in the history file records. A history file record may store either a unique ID of a single record of the remote database or a linked list of unique IDs (together with the content) of multiple records of the remote database. We will refer to the linked list as multiple instance group (MIG). The multiple records of the remote database associated with a MIG are remote database records which were previously generated (by being fanned or tiled) to store contents of a local database record. If the unique ID of the remote database record matches a stored unique ID in a MIG, the remote database record is then correlated to the matching instance in the MIG. If the unique ID of the remote database record matches unique ID stored in a history file record which corresponds to a single remote database record, then, in step 309, the remote database record is linked to the matching history file record in a corresponding item group (CIG), which will be described below.
[0061] Generally, as one of the steps in synchronizing the databases, synchronizer 15 processes the records of the databases, including comparing them to one another, in order to form them into groups of related records called corresponding item groups (CIGs). Each CIG may include at most one record from each of the databases and the history file. Each record in a CIG may be a single record or a group of related records (that is, a MIG) which together store a span of information which can be stored in a single record of the other database. In the case of such related records, based on the records, synchronizer 15 creates a model or synthetic single record which would store the span of information represented by those related records. Synchronizer 15 uses the model record during the synchronization process to represent the group of related records. Therefore, instead of comparing the entire group to another record, synchronizer 15 compares the model record to the other record and thereby increases the efficiency of any such comparison and the overall synchronization process. Synchronizer 15 includes the model recurring record in the CIG. Hereinafter, when referring to a “record” in a CIG, we also refer to such a group of related records in the CIG.
[0062] Following loading the remote database records, Control Module 2 instructs L_sanitizer module 8 of L_translator 5 to sanitize the remote database records in the workspace (step 104).
[0063] Control Module 2 of the Translation Engine 1 then instructs the L_translator 5 to load the records from the local database (step 105). L_translator 5 and synchronizer 15 load records of the local database in the same manner as described for R_translator 9 in reference to FIG. 6, except for one difference. As synchronizer 15 receives each local database record from the L_reader module 7 of the L_translator 5, synchronizer 15 maps that record using a local database to remote database map before writing the record into the next available spot in workspace 16. In the described embodiment, the local database records are mapped because the records in the workspace are stored according to the remote database data structure.
[0064] Referring back to FIG. 4, after all records from the remote local database records, and the history file, are loaded into the workspace, Control Module 2 instructs synchronizer 15 to perform a Conflict Analysis and Resolution (“CAAR”) procedure on the records in the workspace (step 107), CAAR procedure is described in detail in the '490, '926 and '645 applications. Briefly, referring to FIG. 7, synchronizer 15 processes the records in the workspace, including comparing them to one another, in order to form them into corresponding item groups (CIGs). As noted above, synchronizer 15 begins forming CIGs as records are loaded into the workspace and completes the process as the first step in CAAR.
[0065] We will now describe in detail the CAAR procedure as it applies to synchronizing records which cannot be stored in the other database using single records and for which multiple records must be generated or were already generated during a previous synchronization.
[0066] Generally, the type of processing in CAAR depends on whether a history file is being used. If a history file is being used, synchronizer 15 is able to use two types of information stored in the history file. First, if one or both databases assign unique IDs to the records, the unique IDs from the previous synchronization would be stored in the history file. Synchronizer 15 can then use these stored unique IDs to match the records of the two databases and the history file records. Second, if a pattern was used to generate multiple records of one database to store a span of information of a single record of the other database, that pattern would be stored in history file with a corresponding history file record. Synchronizer 15 can use that pattern for matching the records of the two databases and the history file records.
[0067] Referring to FIG. 7, to process a local database record in CAAR, synchronizer 15 first determines whether a history file is being used during the current synchronization (step 401). If so, synchronizer 15 determines whether the remote database assign unique IDs (step 402). If so, synchronizer 15 attempts to match the record to a history record by the unique IDs assigned by the remote database. If synchronizer 15 matches the record to a history file record and the history file record has a MIG (step 403), synchronizer 15 uses the records which have been matched to members of the MIG to generate a model record storing the span of information stored in the records in the linked list (step 404). Synchronizer 15 then links the generated model record to the history file record and the local database record in a CIG.
[0068] If the local database record matches a history file record which does not have a MIG, then synchronizer 15 links, in a CIG, the local database record to the history file record and a matching remote database record, if any (step 407). If synchronizer 15 does not match the record to a history file record (step 408) then synchronizer 15 processes the local database record as in the case where a history file is not used during synchronization (steps 427-439), which will be described in detail below.
[0069] If a history file is not used or if the remote database does not assign unique IDs, then synchronizer 15 must use other means to determine whether multiple records of the remote database store the span of information stored in the local database record and also identify those records.
[0070] If a history file is being used but the remote database does not assign unique IDs, then synchronizer 15 determines whether the local database record being processed matches a history file record and the matched history file record indicates that multiple remote database records were generated during a previous synchronization to store a span of information stored in a local database record (step 412). In that case, the matching history file record stores information identifying the pattern used to generate the multiple remote database records during the previous synchronization. Synchronizer 15 retrieves that pattern and sends it to the remote database translator (step 413). The translator uses the pattern to generate multiple instances based on the history file record (step 414). In other embodiments, synchronizer 15 uses the local database record for generating the instances. These generated records are placed in a linked list attached to the local database record or the history file record (step 415).
[0071] Synchronizer 15 then attempts to match records of the remote database to the generated records (step 416). Synchronizer 15 uses a matching technique which uses two levels of match between records. A first level match between two records, or a strong match, is one where all synchronized fields match. A second level match, or a weak match, is one where only some preselected fields (e.g. the keyfields) of the synchronized fields match. Synchronizer 15 attempts to find strong matches for all the instances in the linked list. Failing that, synchronizer 15 matches records using the second level match. The second level match essentially allows matching records which may have been modified in some respect but should nonetheless be recognized as a generated instance corresponding to the local database record.
[0072] After attempting to match remote database records to the generated instances (step 416), synchronizer 15 determines whether a predetermined number of remote database records have matched the generated instances and, if so, generates a model record based on the matched remote database records (step 417). Synchronizer 15 then links, in a CIG, the matching local database record to the history file record and the model record (step 418).
[0073] If a predetermined number of remote database records did not match the generated instances (step 420), then the local database record is marked as having been deleted from the remote database and therefore will be deleted from the local database (step 421). The generated instances are discarded since insufficient number of remote database records were matched against them. The remote database records which were matched against the generated instances remain in the workspace and continue to be processed like the other remote database records in the workspace. Unless subsequently linked to other records, these remote database records would be marked as records to be added to the local database in step 449, which will be described in detail below.
[0074] If the local database record does not match a record of the history file (steps 412 and 424), synchronizer 15 processes the local database record as in the case where a history file is not used during synchronization (step 425), which we will now describe is detail.
[0075] If a history file is not used for the current synchronization (step 427), unlike the above procedure, the pattern previously used can not be determined. Therefore, in that case, all possible patterns which may have previously used by the translator are used to generate instances. Synchronizer 15 then attempts to determine which pattern best fits the remote database records and generates a model or synthetic record based on the records matching the pattern.
[0076] Hence, in step 428, the translator determines whether the local database record can be stored as a single remote database record or whether multiple remote database records must be used to store the local database record. If multiple records must be used (step 429), then synchronizer 15 must determine whether multiple remote database records store the span of information in the local database record being processed. To do so, synchronizer 15 requests the remote database translator to generate all patterns of records which might be appropriate for storing the local database record in the remote database (step 430). Synchronizer 15 then stores each set of generated instances in a unique linked list (step 431). Synchronizer 15 then attempts to match remote database records to the instances in the linked lists (step 432). Synchronizer 15 then selects the linked list having the highest number of matches as the one most likely having the remote database records corresponding to the local database record (step 433). In other words, the pattern for generating that linked list is identified as representing the pattern which was previously used to generate the multiple instances of the local database record.
[0077] Synchronizer 15 next determines whether a predetermined number of remote database records have matched the generated instances. For example, synchronizer 15 may make such a determination if at least one third of the generated instances are matched. If so, synchronizer 15 generates a model or synthetic record based on the matched remote database records (step 434). Synchronizer 15 then links the local database record and the generated record in a CIG (step 435). If a predetermined number of remote database records did not match the generated instances (step 434), then the local and remote database records are not linked to one another at this point.
[0078] If synchronizer 15 determines that the local database record can be stored in a single record (steps 428, 441), then synchronizer 15 searches the workspace for a remote database record which strongly matches (i.e. a first level match) the local database record and if such a record is found, links the local database record to the remote database record (step 442).
[0079] Synchronizer 15 then processes unmatched remote database records in a similar manner as local database records, as described above in reference to steps 400-445 (step 446).
[0080] At this point, synchronizer 15 then attempts to determine what action to be taken for records which have been deleted since the previous synchronization, where the records were previously stored in the other database by generating multiple records of the other database. For such records, a history file record with an associated MIG or record generation pattern exits in the history file. Synchronizer 15 first searches the workspace for such history file records (step 448). Then, for each such record, synchronizer 15 attempts to match the instances in the MIG or generated using the stored pattern with records of the corresponding database, as indicated by the history file record (step 449). To find the appropriate matches, synchronizer 15 performs processing steps similar to those in steps 402-418, described above in detail. Therefore, if for example the history file record indicates that the local database record was stored by generating multiple remote database record, then synchronizer 15 attempts to match the history file record to the appropriate remote database records. These remote database records will eventually be deleted. Note that at this point, any remote or local database record not linked to any other record will eventually be added to the other database as a new record.
[0081] For each CIG synchronizer 15 then compares the records in the CIG to one another, determines their differences, and decides what synchronization action should be taken. In essence, synchronizer 15 determines which record in the CIG contains the most current data. Synchronizer 15 then determine what synchronization action should be taken to conform the other records in the CIG to the record with the most current data (i.e. how the other records in the CIG should be changed). Synchronization actions with respect to a record include updating, deleting, adding, or not modifying that record.
[0082] We will now provide some examples of the results obtained in the CAAR analysis. If after comparing the records in a CIG, synchronizer 15 determines that the record from the local database is unchanged and the one from remote database is changed, synchronizer 15 determines that the local database record should be changed to conform to the remote database record. Or, if both records are changed (an example of what we refer to as a “conflict” since there is no clear choice of synchronization action), synchronizer 15 may use a user-selected rule to decide what synchronization should be taken. The rule may require, for example, not modifying either of the records, changing the remote database record to conform to the local database record, or asking the user to resolve the conflict.
[0083] Where multiple records of a database are required to store a record and the CIG contains multiple records of that database, synchronizer 15 examines the records in the linked list to determine whether some of the records pass the value of the dynamic date range associated with a previous synchronization but fail the current value of the date range. If so, then the dynamic date range has changed in such a way that part of the set of related records fall outside of the current value of the dynamic date range. In the described embodiment, in such a situation, synchronizer 15 determines that new records should be generated and previously generated records should be deleted. To accomplish this, synchronizer 15 flags the appropriate record. The appropriate translator in response generates the appropriate database records and deletes the previous instances.
[0084] When synchronizer 15 finishes performing CAAR on the records, synchronizer 15 will have determined what synchronization action should be taken with respect to all records to be synchronized. The records may then be unloaded into their respective databases. The translators will perform the specific synchronization actions to be taken with respect to the records of the databases. However, prior to doing so, the user is asked to confirm proceeding with unloading (FIG. 4, steps 108-109). Up to this point, neither the databases nor the history file have been modified. The user may obtain through the Translation Engine's User Interface various information regarding what synchronization actions are to be taken upon unloading.
[0085] If the user chooses to proceed with synchronization and to unload, the records are then unloaded. Unloader modules 6,10 of translators 5,9 perform the unloading for the databases. During unloading, translators may use the date range to limit the data that is unloaded to the databases. For example, the translators may unload only those records which fall within the date range and delete any record which falls outside of the date range. During unloading, synchronizer 15 also creates the history file and unloads information representative of the records of the databases into the history file. We will now describe the unloading of the records into the databases and the history file in detail.
[0086] Control Module 2 of Translation Engine 1 first instructs R_translator 9 to unload remote database records from workspace into the remote database (FIG. 4, step 110). FIG. 8 is the pseudocode for the steps taken by R_translator 9 to unload the records. For each remote database record in the workspace (step 500), R_translator 9 determines whether a dynamic date range is being used during synchronization. If a dynamic date range is being used, then R_translator 9 first determines whether the record to be unloaded passes or fails the date range. Note that a record is considered to pass a date range if a portion of the span of time represented by the record or an instance of a recurring record passes the date range.
[0087] If the record does not pass the current date range (step 501) then the record is skipped. In some embodiments, instead of being skipped, such a record may be deleted from the remote database. In other database, such a record may be synchronized in a particular manner depending on the nature of the synchronization action to be taken; for example, the record may be updated but not added or deleted, or the record may updated and added, but not deleted. In embodiments where records which fail the date range are deleted, R_translator 9 uses the date range to limit the size of the remote database. If the remote database is located on a handheld computer, R_translator manages the memory of the handheld device by limiting the size of the database stored on the handheld computer.
[0088] If the record passes the current date range (step 502), then R_translator 9 adds, deletes, or updates the record according to results of synchronization obtained during CAAR analysis. To do so, R_translator first determines what action is to be taken. If the record is to be added or updated (step 503), R_translator first determines whether multiple records should be generated to store or update the span of information stored by the record to be added (step 504). If multiple records should be generated (step 505), R_translator 9 uses a predetermined pattern, such as the ones described above, to generate the records (step 506). Note that the number of generated records may be limited, for example, because of limitations on memory storage. Such limitations may be based on a predetermined rule or a set of rules defining a useful number or range of records. For example, a set of rules may provide for preferring future records to past records, for preferring dates closer to the current date over dates further away, for limiting the number of generated records to a predetermined value, and for limiting the generated record to those falling within the current dynamic or static date range. Therefore, in some circumstances, for example, R_translator can generate a number of future records to be added to the remote. If future records cannot be added because they fall out of the current date range, synchronizer 15 can then generate past records and add them until the limit on the number of records is reached. (Note that the operation of R_translator with respect to recurring records in this regard is described in more detail in the '490, '926 and '645 applications. The teachings of those applications, in this regard at least, can also be applied to single records which represent continuous periods of time which can not be represented by a single record of the other database.)
[0089] The record or the generated records are then stored or updated, as appropriate (step 507). R-translator 9 then obtains the unique ID of any new records added to the remote database (step 508) and sends the unique ID to synchronizer 15 (step 509). Synchronizer 15 in turn stores the unique IDs in the history file (step 510). In the case of generated records, synchronizer 15 stores the unique IDs in a linked list attached to the history file copy of the single record for which records had to be generated.
[0090] Following unloading the remote database records, Control Module 2 instructs the L_translator 5 to unload the local database records from the workspace in a similar fashion as R_translator 9 (FIG. 4, step 111).
[0091] Control Module 2 next instructs synchronizer 15 to create a new history file (step 112, FIG. 4). The process of creating a history file is described in detail in the '490, '926 and '645 applications. Briefly, for each CIG, synchronizer 15 during the CAAR process determines which one of the records in the CIG should be saved as the history file record. Based on these results, synchronizer 15 creates a history file. Synchronizer 15 also stores with appropriate history file records the pattern, if any, used to generate records for storing the span of information stored by the record and unique IDS, if any, of such generated record.
[0092] Other embodiments are within the scope of the following claims.
[0093] For example, as described in reference to FIG. 7, when a history file is not used for the current synchronization, the pattern which was used previously to generate records of a database is not available. I described, in reference to FIG. 7, one technique of matching remote database records to a record of the local database which stores a span of information not storable in a single record of the remote database. In that technique, (see FIG. 7, steps 427-445) synchronizer 15 attempts to match up the records of the remote database to all possible patterns the remote database translator would use to generate records for the local database record. Synchronizer then determines which one best fits. In an alternative embodiment, instead of attempting to match against all possible patterns, the remote database translator selects a pattern which the translator would have chosen to generate records of the database to store the span of information in the local database, if the local database record was to be added to the remote database. This pattern is then used in the same manner as described above in reference to steps 412-423 in FIG. 7. In other words, the pattern is used by the translator to generate a number of instances and synchronizer 15 attempts to match records of the database to the generated instances, generates a model record if enough number of matches are found, and synchronizes the local database record with the model record (and, hence, the remote database records). By processing the records using a single pattern, the processing time required for synchronization is thus reduced.
[0094] In some embodiments, the span information represented by a record may be textual information. Consider the case where local database permits storing a 500 character field in a single record while the remote database permits storing a 100 character field in a record. In that case, multiple remote database records are generated to store the 500 character field.
[0095] Although we have generally described embodiments as generating multiple records, it should be understood that the term “generating multiple records” also encompasses embodiments in which multiple fields within single records are generated. This would be the case, for example, where a database allows a dynamic or self-defined record structure.
[0096] It is to be understood that while the invention has been described in conjunction with the detailed description thereof, the foregoing description is intended to illustrate and not limit the scope of the invention, which is defined by the scope of the appended claims. Other aspects, advantages, and embodiments are within the scope of the following claims.
Claims
What is claimed is:
1. A computer implemented method of synchronizing at least a first and a second database comprising:
attempting to identify a plurality of records of the second database storing a span of information stored in a record of the first database; and
synchronizing the first database and the second database based on the results of the attempt.
2. The method of claim 1 wherein synchronizing the first database and the second database includes adding, modifying, or deleting one of the records.
3. The method of claim 1 wherein the records of the second database are characterized by a predetermined limitation limiting a span of information storable by a single one of the records of the second database to a span different from the span of information stored by the record of the first database.
4. The method of claim 1 wherein the span of information represented by the record of the first database includes date-bearing information.
5. The method of claim 4 wherein the date-bearing information includes recurring date-bearing information.
6. The method of claim 5 further comprising identifying the plurality of records of the second database as storing the span of information stored in the record of the first database, wherein the identified plurality of records of the second database represent instances of the recurring date-bearing information.
7. The method of claim 4 wherein the span of information has a starting time and date and an ending time and date which span a continuous period of time.
8. The method of claim 7 wherein the continuous period of time is longer than a period of time permitted by the second database.
9. The method of claim 8 further comprising identifying the plurality of records of the second database as storing the span of information stored in the record of the first database, wherein each of the identified plurality of the records of the second database stores a portion of the span of the information, wherein the identified plurality of records of the second database in combination store a selected segment of the span of information.
10. The method of claim 9 wherein the identified plurality of records of the second database includes a recurring record.
11. The method of claim 9 wherein the selected segment is the entire span of information.
12. The method of claim 1 wherein attempting to identify the plurality of records of the second database further comprises:
comparing the record of the first database to the records of the second database to identify the plurality of records of the second database based on the results of the comparison.
13. The method of claim 1 wherein information is stored in a history file reflecting the records of the first and second databases at the previous synchronization and wherein attempting to identify the plurality of records of the second database further comprises:
comparing the records of the second database to the information in the history file to identify the plurality of records of the second database based on the results of the comparison.
14. The method of claim 13 wherein the record of the first database is a record which was present during the previous synchronization and which was deleted from the first database prior to the current synchronization, wherein synchronizing the first database and the second database further comprises deleting the identified plurality of records of the second database.
15. The method of claim 1 further comprising deleting the record of the first database, if the attempt to identify the plurality of records of the second database is unsuccessful.
16. The method of claim 1 further comprising: identifying the plurality of records of the second database as storing the span of information stored in the record of the first database.
17. The method of claim 16 wherein synchronizing the first database and the second database further comprises:
comparing the record of the first database to the identified plurality of records of the second database, and
synchronizing the identified plurality of records of the second database with the record of the first database based on the results of the comparison.
18. The method of claim 17 further comprising:
processing the identified plurality of records of the second database to generate a span of information representative of information stored in the identified plurality of records of the second database, wherein comparing the record of the first database to the records of the second database includes comparing the span of information stored in the record of the first database to the generated span of information.
19. The method of claim 18 further comprising:
generating a record based on the identified plurality of records of the second database, the record storing the generated span of information.
20. The method of claim 19 wherein comparing the record of the first database to the identified plurality of records of the second database includes comparing the record of the first database to the generated record.
21. The method of claim 17 wherein a history file stores information reflecting the records of the first and second databases at a previous synchronization, the method further comprising:
comparing the record of the first database and the identified plurality of records of the second database to the information in the history file;
wherein synchronizing the first database and the second database further includes synchronizing the record of the first database and the identified plurality of records of the second database based on results of the comparison to the history file.
22. The method of claim 16 wherein identifying the plurality of records of the second database includes:
generating a plurality of instances based on a previously determined pattern for generating a plurality of instances which in combination represent the span of information stored by the record of the first database;
correlating a second plurality of the records of the second database to the plurality of generated instances by comparing the plurality of generated instances to the records of the second database, wherein the second plurality of the records of the second database is the identified plurality of records of the second database.
23. The method of claim 22 further comprising selecting the previously determined pattern based on a characteristic of the span of information stored in the record of the first database.
24. The method of claim 22 wherein the plurality of generated instances are generated using the record of the first database.
25. The method of claim 22 wherein information is stored in a history file reflecting the records of the first and second databases at the previous synchronization and the plurality of generated instances are generated using a record in the history file reflecting the content of the record of the first database at a previous synchronization.
26. The method of claim 22 further comprising:
generating, at a previous synchronization, a plurality of instances based on a second previously determined pattern for generating a plurality of instances which in combination represent the span of information stored in the record of the first database at the previous synchronization;
storing, at the previous synchronization information in the history file reflecting the second previously determined pattern;
retrieving the information reflecting the second previously determined pattern from the history file during the current synchronization wherein the retrieved information determines the previously determined pattern.
27. The method of claim 16 wherein identifying the plurality of records of the second database includes:
generating a first plurality of instances based on a first previously determined pattern for generating a plurality of instances which in combination represent the span of information stored by the record of the first database;
correlating a second plurality of the records of the second database to the first plurality of generated instances by comparing the plurality of generated instances to the records of the second database; and
generating a second plurality of instances based on a second previously determined pattern for generating a plurality of instances which in combination represent a span of information;
correlating a third plurality of the records of the second database to the second plurality of generated instances by performing a comparison of the second plurality of generated instances to the records of the second database; and
identifying the identified plurality of records of the second database based on the results of correlating the second plurality of the second database to the first plurality of generated instances and the third plurality of the second database records to the second plurality of generated records.
28. The method of claim 27 wherein identifying the identified plurality of records of the second database includes comparing the number of records in the second plurality of records of the second database to the number of records in the third plurality of records of the second database.
29. The method of claim 16 wherein the records of the second database are assigned unique identifications, the method further comprising:
generating, at a previous synchronization, a plurality of instances based on a previously determined pattern for generating a plurality of instances which in combination represent the span of information stored by the record of the first database;
storing, at the previous synchronization, the generated instances in a plurality of records of the second database;
storing, at the previous synchronization, information in a history file reflecting the unique identifications of the plurality of records of the second database;
wherein identifying the identified plurality of records of the second database further includes:
retrieving the information reflecting the unique identifications and correlating the retrieved information to unique identifications of the records of the second database at a current synchronization; and
determining the identified plurality of records of the second database based on the results of the correlation.
30. The method of claim 1 wherein the span of information represented by the record of the first database includes textual information, wherein size of the textual information is larger than that permitted by the second database.
31. The method of claim 30 wherein the identified plurality of records of the second database include textual information, the textual information of the identified plurality of records of the second database in combination represent the textual information represented by the record of the first database.
32. A computer program, resident on a computer readable medium, for synchronizing at least a first and a second database, comprising instructions for:
attempting to identify a plurality of records of the second database storing a span of information stored in a record of the first database; and
synchronizing the first database and the second database based on the results of the attempt.
33. The computer program of claim 32 wherein
synchronizing the first database and the second database includes adding, modifying, or deleting one of the records.
34. The computer program of claim 32 wherein the records of the second database are characterized by a predetermined limitation limiting a span of information storable by a single one of the records of the second database to a span different from the span of information stored by the record of the first database.
35. The computer program of claim 32 wherein the span of information represented by the record of the first database includes date-bearing information.
36. The computer program of claim 35 wherein the date-bearing information includes recurring date-bearing information.
37. The computer program of claim 36 further comprising instructions for identifying the plurality of records of the second database as storing the span of information stored in the record of the first database, wherein the identified plurality of records of the second database represent instances of the recurring date-bearing information.
38. The computer program of claim 37 wherein the span of information having a starting time and date and an ending time and date which span a continuous period of time.
39. The computer program of claim 38 wherein the continuous period of time is longer than a period of time permitted by the second database.
40. The computer program of claim 38 further comprising instructions for identifying the plurality of records of the second database as storing the span of information stored in the record of the first database, wherein each of the identified plurality of the records of the second database stores a portion of the span of the information, wherein the identified plurality of records of the second database in combination store a selected segment of the span of information.
41. The computer program of claim 40 wherein the selected segment is the entire span of information.
42. The computer program of claim 40 wherein the identified plurality of records of the second database include a recurring record.
43. The computer program of claim 32 wherein attempting to identify the plurality of records of the second database:
comparing the record of the first database to the records of the second database to identify the plurality of records of the second database based on the results of the comparison.
44. The computer program of claim 32 wherein information is stored in a history file reflecting the records of the first and second databases at the previous synchronization and wherein attempting to identify the plurality of records of the second database further comprises:
comparing the records of the second database to the information in the history file to identify the plurality of records of the second database based on the results of the comparison.
45. The computer program of claim 44 wherein the record of the first database is a record which was present during the previous synchronization and which was deleted from the first database prior to the current synchronization, wherein synchronizing the first database and the second database further comprises deleting the identified plurality of records of the second database.
46. The computer program of claim 32 further comprising instructions for:
deleting the record of the first database, if the attempt to identify the plurality of records of the second database is unsuccessful.
47. The computer program of claim 32 further comprising instructions for:
identifying the plurality of records of the second database as storing the span of information stored in the record of the first database.
48. The computer program of claim 47 wherein synchronizing the first database and the second database further comprises:
comparing the record of the first database to the identified plurality of records of the second database, and
synchronizing the identified plurality of records of the second database with the record of the first database based on the results of the comparison.
49. The computer program of claim 48 further comprising instructions for:
processing the identified plurality of records of the second database to generate a span of information representative of information stored in the identified plurality of records of the second database, wherein comparing the record of the first database to the records of the second database includes comparing the span of information stored in the record of the first database to the generated span of information.
50. The computer program of claim 49 further comprising instructions for:
generating a record based on the identified plurality of records of the second database, the record storing the generated span of information.
51. The computer program of claim 50 wherein comparing the record of the first database to the identified plurality of records of the second database includes comparing the record of the first database to the generated record.
52. The computer program of claim 48 wherein a history file stores information reflecting the records of the first and second databases at a previous synchronization, the computer program further comprising instructions for:
comparing the record of the first database and the identified plurality of records of the second database to the information in the history file;
wherein synchronizing the first database and the second database further includes synchronizing the record of the first database and the identified plurality of records of the second database based on results of the comparison to the history file.
53. The computer program of claim 47 wherein identifying the identified plurality of records of the second database includes:
generating a plurality of instances based on a previously determined pattern for generating a plurality of instances which in combination represent the span of information stored by the record of the first database;
correlating a second plurality of the records of the second database to the plurality of generated instances by comparing the plurality of generated instances to the records of the second database, wherein the second plurality of the records of the second database is the identified plurality of records of the second database.
54. The computer program of claim 53 further comprising instructions for selecting the previously determined pattern based on a characteristic of the span of information stored in the record of the first database.
55. The computer program of claim 53 wherein the plurality of generated instances are generated using the record of the first database.
56. The computer program of claim 53 wherein information is stored in a history file reflecting the records of the first and second databases at the previous synchronization and the plurality of generated instances are generated using a record in the history file reflecting the content of the record of the first database at a previous synchronization.
57. The computer program of claim 53 further comprising instructions for:
generating, at a previous synchronization, a plurality of instances based on a second previously determined pattern for generating a plurality of instances which in combination represent the span of information stored in the record of the first database at the previous synchronization;
storing, at the previous synchronization information in the history file reflecting the second previously determined pattern;
retrieving the information reflecting the second previously determined pattern from the history file during the current synchronization wherein the retrieved information determines the previously determined pattern.
58. The computer program of claim 47 wherein identifying the identified plurality of records of the second database includes:
generating a first plurality of instances based on a first previously determined pattern for generating a plurality of instances which in combination represent the span of information stored by the record of the first database;
correlating a second plurality of the records of the second database to the first plurality of generated instances by comparing the plurality of generated instances to the records of the second database; and
generating a second plurality of instances based on a second previously determined pattern for generating a plurality of instances which in combination represent a span of information;
correlating a third plurality of the records of the second database to the second plurality of generated instances by performing a comparison of the second plurality of generated instances to the records of the second database; and
identifying the identified plurality of records of the second database based on the results of correlating the second plurality of the second database to the first plurality of generated instances and the third plurality of the second database records to the second plurality of generated records.
59. The computer program of claim 58 wherein identifying the identified plurality of records of the second database includes comparing the number of records in the second plurality of records of the second database to the number of records in the third plurality of records of the second database.
60. The computer program of claim 47 wherein the records of the second database are assigned unique identifications, the computer program further comprising instructions for:
generating, at a previous synchronization, a plurality of instances based on a previously determined pattern for generating a plurality of instances which in combination represent the span of information stored by the record of the first database;
storing, at the previous synchronization, the generated instances in a plurality of records of the second database;
storing, at the previous synchronization, information in a history file reflecting the unique identifications of the plurality of records of the second database;
wherein identifying the identified plurality of records of the second database further includes:
retrieving the information reflecting the unique identifications and correlating the retrieved information to unique identifications of the records of the second database at a current synchronization; and
determining the identified plurality of records of the second database based on the results of the correlation.
61. The computer program of claim 32 wherein the span of information represented by the record of the first database includes textual information, wherein size of the textual information is larger than that permitted by the second database.
62. The computer program of claim 61 wherein the identified plurality of records of the second database include textual information, the textual information of the identified plurality of records of the second database in combination represent the textual information represented by the record of the first database.
63. A computer implemented method of storing a record of a first database in a second database, the record of the first database storing a span of information, the second database not being capable of storing such span of information in a single record, the method comprising:
generating a plurality of records of the second database to store the span of information of the record of the first database, each of the plurality of the records of the second database storing a portion of the span of the information, wherein the plurality of records of the second database in combination store a selected segment of the span of information less than the entirety of the span of information.
64. The method of claim 63 wherein the span of information represented by the record of the first database includes date-bearing information.
65. The method of claim 64 wherein the selected segment is a selected date range narrower than the date range of the second database.
66. The method of claim 65 further comprising determining the selected date range relative to a selected date.
67. The method of claim 66 wherein determining the selected date range includes applying a rule.
68. The method of claim 67 wherein the rule includes a preference for future dates compared to a current date over past dates compared to the current date.
69. The method of claim 67 wherein the rule includes a preference for dates closer to a current date over dates further from the current date.
70. The method of claim 67 wherein the rule includes a limit on a total number of generated records.
71. The method of claim 64, wherein the record of the first database is a recurring record representing a plurality of recurring instances and the portion of the span of information stored in each of the plurality of the records of the second database comprises one of the plurality of instances.
72. The method of claim 64 wherein the span of information is a continuous span of information, characterized by a starting time and date and an ending time and date.
73. The method of claim 64 wherein the starting time and date and the ending time and date span a period of time longer than a period permitted by the second database to be stored in a single record.
74. The method of claim 73 wherein the plurality of records of the second database include starting time and date and ending time and date spanning a period of time, wherein the plurality of records of the second database in combination span a period of time equal to the period of time spanned by the selected segment of the span of information of the record of the first database.
75. The method of claim 64 wherein the plurality of records of the second database include a recurring record.
76. The method of claim 63 wherein the span of information represented by the record of the first database includes textual information, wherein size of the textual information is larger than that permitted by the second database.
77. The method of claim 76 wherein the plurality of records of the second database include textual information, the textual information of the plurality of records of the second database in combination represent the textual information represented by the record of the first database.
78. A computer program, resident on a computer readable medium, for storing a record of a first database in a second database, the record of the first database storing a span of information, the second database not being capable of storing such span of information in a single record, comprising instructions for:
generating a plurality of records of the second database to store the span of information of the record of the first database, each of the plurality of the records of the second database storing a portion of the span of the information, wherein the plurality of records of the second database in combination store a selected segment of the span of information less than the entirety of the span of information.
79. The computer program of claim 78 wherein the span of information represented by the record of the first database includes date-bearing information.
80. The computer program of claim 79 wherein the selected segment is a selected date range narrower than the date range of the second database.
81. The computer program of claim 79 further comprising instructions for determining the selected date range relative to a selected date.
82. The computer program of claim 81 wherein determining the selected date range includes applying a rule.
83. The computer program of claim 82 wherein the rule includes a preference for future dates compared to a current date over past dates compared to the current date.
84. The computer program of claim 82 wherein the rule includes a preference for dates closer to a current date over dates further from the current date.
85. The computer program of claim 82 wherein the rule includes a limit on a total number of generated records.
86. The computer program of claim 79, wherein the record of the first database is a recurring record representing a plurality of recurring instances and the portion of the span of information stored in each of the plurality of the records of the second database comprises one of the plurality of instances.
87. The computer program of claim 79 wherein the span of information is a continuous span of information, characterized by a starting time and date and an ending time and date.
88. The computer program of claim 79 wherein the starting time and date and the ending time and date span a period of time longer than a period permitted by the second database to be stored in a single record.
89. The computer program of claim 88 wherein the plurality of records of the second database include starting time and date and ending time and date spanning a period of time, wherein the plurality of records of the second database in combination span a period of time equal to the period of time spanned by the selected segment of the span of information of the record of the first database.
90. The computer program of claim 89 wherein the plurality of records of the second database include a recurring record.
91. The computer program of claim 78 wherein the span of information represented by the record of the first database includes textual information, wherein size of the textual information is larger than that permitted by the second database.
92. The computer program of claim 91 wherein the plurality of records of the second database include textual information, the textual information of the plurality of records of the second database in combination represent the textual information represented by the record of the first database.
Patent Citations (88)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4432057(A) | 1984-02-01 | Daniell et al. | Applicant |
| US4807182(A) | 1989-02-01 | Queen | Applicant |
| US4819156(A) | 1989-04-01 | DeLorme et al. | Applicant |
| US4827423(A) | 1989-05-01 | Beasley et al. | Applicant |
| US4866611(A) | 1989-09-01 | Cree et al. | Applicant |
| US4875159(A) | 1989-10-01 | Cary et al. | Applicant |
| US4956809(A) | 1990-09-01 | George et al. | Applicant |
| US4980844(A) | 1990-12-01 | Demjanenko et al. | Applicant |
| US5065360(A) | 1991-11-01 | Kelly | Applicant |
| US5136707(A) | 1992-08-01 | Block et al. | Applicant |
| US5142619(A) | 1992-08-01 | Webster, III | Applicant |
| US5155850(A) | 1992-10-01 | Janis et al. | Applicant |
| US5170480(A) | 1992-12-01 | Mohan et al. | Applicant |
| US5187787(A) | 1993-02-01 | Skeen et al. | Applicant |
| US5210868(A) | 1993-05-01 | Shimada et al. | Applicant |
| US5228116(A) | 1993-07-01 | Harris et al. | Applicant |
| US5237678(A) | 1993-08-01 | Kuechler et al. | Applicant |
| US5251151(A) | 1993-10-01 | Demjanenko et al. | Applicant |
| US5251291(A) | 1993-10-01 | Malcolm | Applicant |
| US5261045(A) | 1993-11-01 | Scully et al. | Applicant |
| US5261094(A) | 1993-11-01 | Everson et al. | Applicant |
| US5272628(A) | 1993-12-01 | Koss | Applicant |
| US5278978(A) | 1994-01-01 | Demers et al. | Applicant |
| US5278982(A) | 1994-01-01 | Daniels et al. | Applicant |
| US5283887(A) | 1994-02-01 | Zachery | Applicant |
| US5293627(A) | 1994-03-01 | Kato et al. | Applicant |
| US5301313(A) | 1994-04-01 | Terada et al. | Applicant |
| US5315709(A) | 1994-05-01 | Alston, Jr. et al. | Applicant |
| US5327555(A) | 1994-07-01 | Anderson | Applicant |
| US5333252(A) | 1994-07-01 | Brewer, III et al. | Applicant |
| US5333265(A) | 1994-07-01 | Orimo et al. | Applicant |
| US5333316(A) | 1994-07-01 | Champagne et al. | Applicant |
| US5339392(A) | 1994-08-01 | Risberg et al. | Applicant |
| US5339434(A) | 1994-08-01 | Rusis | Applicant |
| US5355476(A) | 1994-10-01 | Fukumura | Applicant |
| US5375234(A) | 1994-12-01 | Davidson et al. | Applicant |
| US5392390(A) | 1995-02-01 | Crozier | Applicant |
| US5396612(A) | 1995-03-01 | Huh et al. | Applicant |
| US5412801(A) | 1995-05-01 | De Remer et al. | Examiner |
| US5434994(A) | 1995-07-01 | Shaheen et al. | Applicant |
| US5444851(A) | 1995-08-01 | Woest | Applicant |
| US5463735(A) | 1995-10-01 | Pascucci et al. | Applicant |
| US5475833(A) | 1995-12-01 | Dauerer et al. | Applicant |
| US5511188(A) | 1996-04-01 | Pascucci et al. | Applicant |
| US5519606(A) | 1996-05-01 | Frid-Nielsen et al. | Applicant |
| US5560005(A) | 1996-09-01 | Hoover et al. | Applicant |
| US5568402(A) | 1996-10-01 | Gray et al. | Applicant |
| US5583793(A) | 1996-12-01 | Gray et al. | Applicant |
| US5596574(A) | 1997-01-01 | Perlman et al. | Applicant |
| US5600834(A) | 1997-02-01 | Howard | Applicant |
| US5613113(A) | 1997-03-01 | Goldring | Applicant |
| US5615364(A) | 1997-03-01 | Marks | Applicant |
| US5619689(A) | 1997-04-01 | Kelly | Applicant |
| US5630081(A) | 1997-05-01 | Rybicki et al. | Applicant |
| US5666530(A) | 1997-09-01 | Clark et al. | Applicant |
| US5666553(A) | 1997-09-01 | Crozier | Applicant |
| US5682524(A) | 1997-10-01 | Freund et al. | Applicant |
| US5684984(A) | 1997-11-01 | Jones et al. | Applicant |
| US5684990(A) | 1997-11-01 | Boothby | Applicant |
| US5689706(A) | 1997-11-01 | Rao et al. | Applicant |
| US5701423(A) | 1997-12-01 | Crozier | Applicant |
| US5708812(A) | 1998-01-01 | Van Dyke et al. | Applicant |
| US5708840(A) | 1998-01-01 | Kikinis et al. | Applicant |
| US5710922(A) | 1998-01-01 | Alley et al. | Applicant |
| US5727202(A) | 1998-03-01 | Kucala | Applicant |
| US5729735(A) | 1998-03-01 | Meyering | Applicant |
| US5745712(A) | 1998-04-01 | Turpin et al. | Applicant |
| US5758083(A) | 1998-05-01 | Singh et al. | Applicant |
| US5758150(A) | 1998-05-01 | Bell et al. | Applicant |
| US5758355(A) | 1998-05-01 | Buchanan | Applicant |
| US5778388(A) | 1998-07-01 | Kawamura et al. | Applicant |
| US5781908(A) | 1998-07-01 | Williams et al. | Applicant |
| US5790789(A) | 1998-08-01 | Suarez | Applicant |
| US5832489(A) | 1998-11-01 | Kucala | Applicant |
| US5838923(A) | 1998-11-01 | Lee et al. | Applicant |
| US5845293(A) | 1998-12-01 | Veghte et al. | Applicant |
| US5870759(A) | 1999-02-01 | Bauer et al. | Applicant |
| US5870765(A) | 1999-02-01 | Bauer et al. | Applicant |
| US5884323(A) | 1999-03-01 | Hawkins et al. | Applicant |
| US5884324(A) | 1999-03-01 | Cheng et al. | Applicant |
| US5884325(A) | 1999-03-01 | Bauer et al. | Applicant |
| US5897640(A) | 1999-04-01 | Veghte et al. | Applicant |
| US5926824(A) | 1999-07-01 | Hashimoto et al. | Applicant |
| US5928329(A) | 1999-07-01 | Clark et al. | Applicant |
| US5999947(A) | 1999-12-01 | Zollinger et al. | Applicant |
| US6081806(A) | 2000-06-01 | Chang et al. | Applicant |
| US6125369(A) | 2000-09-01 | Wu et al. | Applicant |
| US6141664(A) | 2000-10-01 | Boothby | Applicant |
Non-Patent Literature (22)
- IEEE publication entitled, Design and Analysis of Communication Network for Distributed SCADA System by Qian Wang et al., vol. 3, pp. 2062-2065, Jan. 2000.Applicant
- Alfieri, “The Best of WordPerfect Version 5.0,” Hayden Books, pp. 153-165, 429-435 (1988).Applicant
- “Automatically Synchronized Objects,” Research Disclosure #29261, p. 614 (Aug. 1988).Applicant
- Chapura, Inc., PilotMirror Features Page, http://www.chapura.com/features.html (1997).Applicant
- Cobb et al., “Paradox 3.5 Handbook 3rd Edition,” Bantam, pp. 803-816 (1991).Applicant
- Chapura, Inc., 3 Compare, http://www.chapura.com/3compare.html (1997).Applicant
- “FRx Extends Reporting Power of Platinum Series: (IBM Desktop Software's Line of Accounting Software),” Doug Dayton, PC Week, v. 8, n. 5, p. 29(2) (Feb. 4, 1991).Applicant
- IntelliLink Brochure (1990).Applicant
- USSN 08/927,922, filed Sep. 11, 1997.Applicant
- USSN 08/964,751, filed Nov. 5, 1997.Applicant
- USSN 09/036,400, filed Mar. 5, 1998.Applicant
- USSN 09/052,769, filed Mar. 31, 1998.Applicant
- Zahn et al., Network Computing Architecture, pp. 1-11; 19-31; 87=115; 117-133; 187-199; 201-209 (1990).Applicant
- USSN 08/749,926, filed Nov. 13, 1996.Applicant
- USSN 08/752,490, filed Nov. 13, 1996.Applicant
- USSN 08/748,645, filed Nov. 13, 1996.Applicant
- “The Big Picture (Accessing Information on Remote Data Management System,” UNIX Review, v. 7, n. 8, p. 38(7) (Aug. 1989).Applicant
- User Manual for Connectivity Pack for the HP 95LX, Hewlett Packard Company (1991).Applicant
- User Manual for PC-Link for the B.O.S.S. and the PC-Link for the B.O.S.S., Traveling Software, Inc. (1989).Applicant
- “Logical Connectivity: Applications, Requirements, Architecture, and Research Agenda,” Stuart Madnick & Y. Richard Wang, MIT, Systems Sciences, 1991 Hawaii Int'l, vol. 1, IEEE (Jun. 1991).Applicant
- “Open Network Computing—Technical Overview,” Sun Technical Report, Microsystems, Inc., pp. 1-32 (1987).Applicant
- Organizer Link II Operation Manual, Sharp Electronics Corporation.Applicant