초록 ▼

A method for caching information objects is provided. Information objects are stored in portions of a non-volatile storage device called arenas, which are contiguous regions from which space is allocated in parallel. Objects are contiguously allocated within an arena and are mapped to directory tabl

A method for caching information objects is provided. Information objects are stored in portions of a non-volatile storage device called arenas, which are contiguous regions from which space is allocated in parallel. Objects are contiguously allocated within an arena and are mapped to directory tables that provide an efficient search mechanism. Each object is identified by a name key and a content key. The name key is constructed by applying a hash function to the composition of the name or URL of the object along with implicit or explicit context about the request. The content key is constructed by applying a hash function to the entire contents of the object data. Buckets and blocks in the directory tables store tags and subkeys derived from the keys. Since duplicate objects that have different names will hash to the same content key, the cache can detect duplicate objects even though they have different names, and store only one copy of the object. As a result, cache storage usage is dramatically reduced, and tracking object aliases is not required. The disclosure also encompasses a computer apparatus, computer program product, and computer data signal embodied in a carrier wave that are configured similarly.

대표청구항 ▼

[ What is claimed is:] [1.]1. A method of delivering an information object to a client from a cache at a server, comprising the steps of:(A) establishing a cache table in a memory of the server, the cache table mapping name key values to vectors of alternates, wherein said information object is asso

[ What is claimed is:] [1.]1. A method of delivering an information object to a client from a cache at a server, comprising the steps of:(A) establishing a cache table in a memory of the server, the cache table mapping name key values to vectors of alternates, wherein said information object is associated with a name key value that said cache table maps to a particular vector of said vectors of alternates;(B) computing a content key that uniquely identifies the information object by applying a hash function to the information object; and(C) storing the content key in one of the alternates of said particular vector of alternates;(D) computing another content key that uniquely identifies another information object by applying a hash function to said other information object, wherein said other information object is associated with said name key value; and(E) storing the other content key in another one of said alternates of said particular vector of alternates.