Method for Caching Ordered Data Without Using Unique Keys
Original Publication Date: 2004-Jul-07
Included in the Prior Art Database: 2004-Jul-07
The Method for Caching Ordered Data Without Using Unique Keys allows ordered data in a database to be cached in memory and retrieval using any key desired. The hash function for the retrieval keys does not map exactly to the keys in the cache. Rather, the hash function is actually a search function to allow any retrieval key to match a key in the cache.