Date range determination for cached date driven values

• US 20070230283A1
• Filed: 03/29/2006
• Published: 10/04/2007
• Est. Priority Date: 03/29/2006
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Castaneda, Frank, Zanter, David
• Application Number:
  US11/392,137
• Publication Number:
  US 20070230283A1
• Time in Patent Office: Days
• US Class Current: 368/29
• CPC Class Codes: G06Q 10/10 Office automation; Time management

Abstract

Embodiments of the present invention address deficiencies of the art in respect to filtering and caching recurring date driven data and provide a method, system and computer program product for data range determination for cached date driven values. In one embodiment of the invention, a date driven date selective retrieval method for recurrences in date driven data can include defining a date range, retrieving exactly three cached instances for each of the recurrences in the date driven data, selecting only those recurrences that fall within the date range according to the three cached instances for each of the recurrences, and adding the selected recurrences to a subset of the date driven values, and otherwise excluding remaining ones of the recurrences from the subset.

Claims

1. A date driven date selective retrieval method for recurrences in date driven data, the method comprising:

defining a date range;

retrieving exactly three cached instances for each of the recurrences in the date driven data;

selecting only those recurrences that fall within the date range according to the three cached instances for each of the recurrences; and

,

adding the selected recurrences to a subset of the date driven values, and otherwise excluding remaining ones of the recurrences from the subset.

2. The method of claim 1, wherein defining the date range comprises defining a date range as bounded by an earliest point in time (LW) and a latest point in time (RW).

3. The method of claim 2, wherein retrieving exactly three cached instances for each of the recurrences in the date driven data, comprises:

retrieving a first cached instance in the recurrence (V1) that occurs before a designated point in the date range;

retrieving a first instance in the recurrence that occurs after the designated point (V2); and

,

retrieving a last instance in the recurrence (V3).

4. The method of claim 3, wherein retrieving exactly three cached instances for each of the recurrences in the date driven data, comprises:

identifying a special circumstance where the first instance of the recurrence that occurs after the designated point is the last instance of the recurrence; and

,

retrieving the last three instances of the recurrence.

5. The method of claim 3, wherein retrieving exactly three cached instances for each of the recurrences in the date driven data, comprises:

identifying a special circumstance where the first instance of the recurrence that occurs before the designated point is the last instance of the recurrence; and

,

retrieving the last three instances of the recurrence.

6. The method of claim 3, wherein retrieving exactly three cached instances for each of the recurrences in the date driven data, comprises:

identifying a special circumstance where the first instance of the recurrence occurs after the designated point; and

,

retrieving the first two instances and the last instance of the recurrence.

7. The method of claim 3, wherein selecting only those recurrences that fall within the date range according to the three cached instances for each of the recurrences, comprises:

evaluating only a group of the recurrences having a V3 that is later than LW and a V1 that is earlier than RW and either a V1 that is later than LW or a V2 that is earlier than RW;

selecting recurrences from the group having a V2 that is later than the LW of the date range;

further selecting recurrences from the group having a V3 that is later than the LW of the date range and earlier than the RW of the date range; and

,

deferring a selection of all other recurrences from the group to a full evaluation.

8. The method of claim 1, further comprising performing a synchronization of the subset with at least one communicatively coupled client computing device.

9. A data processing system configured for date driven data management, the system comprising:

a data store of date driven values;

a cache of recurrence instances, the cache comprising exactly three instances for each recurrence among the date driven values in the data store; and

,

date range determination logic comprising program code enabled to filter the date recurrences in a filtered subset to meet an established date range utilizing only the three instances for each recurrence in the cache.

10. The system of claim 9, wherein the date driven values comprise time/date sensitive instances selected from the group consisting of events, tasks, electronic mail, and inventory.

11. The system of claim 9, wherein the three instances for each recurrence comprise:

a first cached instance in the recurrence (V1) that occurs before a designated point in the date range;

a first instance in the recurrence that occurs after the designated point (V2); and

,

a last instance in the recurrence (V3).

12. The system of claim 9, further comprising a synchronization engine configured to synchronize the filtered subset with a plurality of communicatively coupled client devices.

13. A computer program product comprising a computer usable medium embodying computer usable program code for date driven date selective retrieval for recurrences in date driven data, the computer program product including:

computer usable program code for defining a date range;

computer usable program code for retrieving exactly three cached instances for each of the recurrences in the date driven data;

computer usable program code for selecting only those recurrences that fall within the date range according to the three cached instances for each of the recurrences; and

,

computer usable program code for adding the selected recurrences to a subset of the date driven values, and otherwise excluding remaining ones of the recurrences from the subset.

14. The computer program product of claim 13, wherein the computer usable program code for defining the date range comprises computer usable program code for defining a date range as bounded by an earliest point in time (LW) and a latest point in time (RW).

15. The computer program product of claim 14, wherein the computer usable program code for retrieving exactly three cached instances for each of the recurrences in the date driven data, comprises:

computer usable program code for retrieving a first cached instance in the recurrence (V1) that occurs before a designated point in the date range;

computer usable program code for retrieving a first instance in the recurrence that occurs after the designated point (V2); and

,

computer usable program code for retrieving a last instance in the recurrence (V3).

16. The computer program product of claim 15, wherein the computer usable program code for retrieving exactly three cached instances for each of the recurrences in the date driven data, comprises:

computer usable program code for identifying a special circumstance where the first instance of the recurrence that occurs after the designated point is the last instance of the recurrence; and

,

computer usable program code for retrieving the last three instances of the recurrence.

17. The computer program product of claim 15, wherein the computer usable program code for retrieving exactly three cached instances for each of the recurrences in the date driven data, comprises:

computer usable program code for identifying a special circumstance where the first instance of the recurrence that occurs before the designated point is the last instance of the recurrence; and

,

computer usable program code for retrieving the last three instances of the recurrence.

18. The computer program product of claim 15, wherein the computer usable program code for retrieving exactly three cached instances for each of the recurrences in the date driven data, comprises:

computer usable program code for identifying a special circumstance where the first instance of the recurrence occurs after the designated point; and

,

computer usable program code for retrieving the first two instances and the last instance of the recurrence.

19. The computer program product of claim 15, wherein the computer usable program code for selecting only those recurrences that fall within the date range according to the three cached instances for each of the recurrences, comprises:

computer usable program code for evaluating only a group of the recurrences having a V3 that is later than LW and a V1 that is earlier than RW and either a V1 that is later than LW or a V2 that is earlier than RW;

computer usable program code for selecting recurrences from the group having a V2 that is later than the LW of the date range;

computer usable program code for further selecting recurrences from the group having a V3 that is later than the LW of the date range and earlier than the RW of the date range; and

,

computer usable program code for deferring a selection of all other recurrences from the group to a full evaluation.

20. The computer program product of claim 13, further comprising computer usable program code for performing a synchronization of the subset with at least one communicatively coupled client computing device.