- A data cache does not have fallback or online whitelist namespaces or foreign entries.
- A data cache provides a monotonically increasing numeric version identifier.
- A data cache may have an authorization cookie.
- Every resource managed in a data cache may be configured to process certain (HTTP) protocol methods locally
- Zero or more data caches are automatically associated with a cache host at its creation/load time. A secure data cache group is available to a cache host if its authorization cookie will be sent to an origin server for fetching that cache host [RFC2965].
- The events checking and noupdate are not used. The events cached and updateready are merged in to a single event ready. Events downloading and progress are renamed as fetching and captured. There is no downloading update status for a data cache group.
- No manifest is used. Instead an update transaction encapsulates a set of changes to the cache. An update transaction consists of any number of capture steps or release steps. An application can store a bag of bits independent of a network representation of that resource. This allows storing of off-line resources. The results are not visible until the transaction is committed.
- Update transactions can be performed in workers but not in the background independently of applications.
- It is possible to have only one online transaction but multiple off-line transactions are allowed.
- It is possible to find out the resources added to or removed from cache starting at a certain version.
- A data cache offers applications the ability to get the contents corresponding to a URI.
- The navigator registers a scriptable HTTP interceptor that can off-line respond to arbitrary HTTP requests based on prior (data cache) configuration of the resources in those requests.
- A new header is defined to by-pass data cache in request processing
- A slightly different networking model is required to take into account interception.
I like to solve application problems using the Web (statelessness, hypermedia, self-descriptive representations, and uniform interfaces) to produce an asymptotically tight bound solution!


0 comments:
Post a Comment