Dismiss
The InnovationQ application will be updated on Sunday, May 31st from 10am-noon ET. You may experience brief service interruptions during that time.
Browse Prior Art Database

Method for Caching Ordered Data Without Using Unique Keys

IP.com Disclosure Number: IPCOM000029565D
Original Publication Date: 2004-Jul-07
Included in the Prior Art Database: 2004-Jul-07

Publishing Venue

IBM

Abstract

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.