A system and method for sharing resources among application modules includes receiving, on an application including a plurality of modules, a resource from a server; determining a storage position identifier corresponding to an identifier of the resource and indicative of a storage position in a database for storing resources dedicated for the application; and storing the resource in the database based on the determined identifier for sharing among the plurality of modules.
Legal claims defining the scope of protection, as filed with the USPTO.
1. A computer-implemented method for sharing resources among application modules, comprising: receiving a resource on an application implemented on the computer, the application including a plurality of modules; determining a storage position identifier corresponding to an identifier of the resource and indicative of a storage position in a database for storing resources dedicated for the application; and storing the resource in the database based on the determined identifier for sharing among the plurality of modules; and wherein a first of the plurality of modules operates independently from other of the plurality of modules such that data stored on the first module is not accessible by the other of the plurality of modules.
2. The method of claim 1 , wherein the storage position identifier of the stored resource is mapped in an application cache; and the method further comprising retrieving a second resource from the database when it is determined that a storage position identifier of the second resource is included in the application cache.
3. The method of claim 1 , wherein the storage position identifier of the resource is used to determine whether the resource is stored in the database or not.
4. The method of claim 1 , wherein the resource is requested by at least one module of the plurality of modules.
5. The method of claim 1 , wherein the determining the storage position identifier includes converting the identifier of the resource to a format predefined for a plurality of storage position identifiers in the database.
6. The method of claim 1 , wherein the determining the storage position identifier includes identifying a hash value corresponding to the identifier of the resource.
7. The method of claim 1 , wherein the receiving, the determining, and the storing is performed for a predetermined amount of time.
8. The method of claim 1 , wherein the application has access, via the database, to all resources previously requested by any of the plurality of modules, without the application needing to request access to the resources via a server.
9. A computer-implemented method for an optimized application resource retrieval system, the method comprising: establishing, by an application implemented on the computer and including a plurality of browsers, a communications link with a server, wherein the communications link is operable for requesting for a set of resources; providing, in the application, a cache for storing a set of identifiers associated with the set of resources; and linking each identifier in the set of identifiers in the cache to a storage position location in a database, wherein a resource requested by at least two browsers of the plurality of browsers is retrieved from the server once and stored in the database for accessing by other of the plurality of browsers; and wherein the cache stores only resources shared among the plurality of browsers.
10. The method of claim 9 , wherein a first and a second browser of the plurality of browsers are operating independent of each other in the application; and wherein data on one of the at least two of the plurality of browsers is not accessible by the other plurality of browsers.
11. The method of claim 9 , wherein the database is stored in a memory of a computing device in which the application is executing.
12. The method of claim 9 , wherein the one or more resources are stored in a portion of the database isolated for the application.
13. The method of claim 9 , wherein the establishing the communications link with the server is performed upon a positive determination that at least one browser of the plurality of browsers is requesting for a resource.
14. A computing device with a non-transitory computer-readable storage medium having one or more computer-executable instructions to: determine, in an application, whether a resource is stored in a memory based on a storage position identifier corresponding to an identifier of the resource and indicative of a storage position in the memory; and upon a negative determination: request the resource from a server including one or more resources; determine a storage position identifier corresponding to the identifier of the resource; and store the resource in the memory based on the determined storage position identifier for sharing among a plurality of modules included in the application; and wherein a first module of the plurality of modules in the application is operating independently from a second module.
15. The computing device of claim 14 , wherein the plurality of modules included in the application is dependent on configuration by a user of the application.
16. The computing device of claim 14 , further comprising one or more computer-executable instructions configured, in response to determining that the resource is stored in the memory, to retrieve the resource from the memory based on the corresponding storage position identifier.
17. The computing device of claim 14 , wherein the memory is an external memory communicatively connected to the computing device.
18. The computing device of claim 14 , wherein the instructions to determine are configured to be executed upon a positive determination that at least one of the plurality of modules requested the resource.
19. The computing device of claim 14 , wherein the instructions to determine are configured to be executed only during a session of using the application.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
April 19, 2016
May 21, 2019
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.