Data Storage and Access

• US 20110191544A1
• Filed: 04/24/2009
• Published: 08/04/2011
• Est. Priority Date: 04/24/2008
• Status: Abandoned Application

• Current Assignee: Nokia Corporation
• Original Assignee: Nokia Corporation
• Inventors: Nayan, Neeraj, Naga, Harsha Sathyanarayana
• Application Number:
  US12/989,536
• Publication Number:
  US 20110191544A1
• Time in Patent Office: Days
• US Class Current: 711/133
• CPC Class Codes: G06F 12/0862 with prefetch
• CPC Class Codes: G06F 12/122 of the least frequently used [LFU] type, e.g. with individual count value

Abstract

A data cache wherein contents of the cache are arranged and organised according to a hierarchy. When a member of a first hierarchy is accessed, all contents of that member are copied to the cache. The cache may be arranged according to folders which contain data or blocks of data. A process for caching data using such an arrangement is also provided for.

Claims

1. A method comprising:

(i) identifying a cache object to be included in a cache, said cache object being stored on a storage medium;

(ii) identifying at least one child object related to said cache object; and

(iii) on inclusion of said cache object in said cache, including one or more of said identified child objects in said cache in an order according to criteria specified by a client application.

33. The method of claim 1, comprising one or more of:

including said child objects in said cache in order of creation date; and

including said cache objects in said cache in order of a number of times they have been accessed.

34. The method of claim 1, comprising:

including more than one child object related to said cache object in said cache, and arranging said child objects in blocks.

35. The method of claim 34, wherein at least one of said blocks has a fixed address range.

36. The method of claim 1, comprising:

including an indication of a relation between said cache object and one or more of said identified child objects in said cache;

wherein the indication of the relation between the cache object and the child object comprises a table associated with the cache object, the table comprising entries for at least one child object related to the cache object.

37. The method of claim 36, further comprising populating and managing the cache with reference to the relation.

38. The method of claim 1, comprising:

maintaining a list of cache objects contained within the cache.

39. The method of claim 38, wherein said list is ordered according to at least one of:

a frequency at which said cache objects are accessed; and

how recently the cache objects have been used.

40. The method of claim 1, comprising:

identifying an amount of free space in the cache prior to including the cache object and the child object in the cache;

on determining that there is insufficient space in the cache, identifying a replaceable cache object and deleting one or more child objects associated with the replaceable cache object and/or the replaceable cache object from the cache; and

thereafter, including the cache object and the child object in the cache.

41. The method of claim 40, comprising at least one of:

identifying said replaceable cache object on the basis of a frequency at which cache objects are accessed; and

identifying said replaceable cache object as the object which has been least recently used among all objects of the cache.

42. The method of claim 40, wherein if any of the replaceable cache objects cannot be deleted as their contents have been locked for use by another application, then the method comprises deleting that portion of the replaceable cache object that is not locked.

43. The method according to claim 1 wherein said cache object is a holder for said child objects.

44. The method according to claim 1 wherein said child object comprises one or more related grandchildren objects.

45. The method according to claim 1 wherein the relation between said child object and said related cache object is established by a software application, and wherein said software application is configured to send, receive and edit messages, and wherein said cache objects comprise message folders and said child objects comprise message data.

46. The method according to claim 1 wherein identifying a cache object to be included in the cache comprises recording the access of a folder by a user of the software application.

2-32. -32. (canceled)

47. A data cache for storing a plurality of objects, said data cache comprising at least one cache object and at least one child object wherein said child object is related to said cache object and wherein said cache includes an indication of said relation;

wherein said child objects are included in said cache in an order according to criteria specified by a client application.

48. Apparatus comprising a data cache according to claim 47.

51. A recordable medium for storing program instructions, said instructions being adapted to provide a data cache according to claim 47 or claim 49.

49. A data cache comprising a plurality of cache objects, a subset of said cache objects being related to one another, said cache being adapted to store, delete or replace said subset of said cache objects, wherein said subset comprises more than one cache object and wherein all members of said subset are related to one another;

wherein said subset of said cache objects child objects are included in said data cache in an order according to criteria specified by a client application.

50. Apparatus comprising a data cache according to claim 49.