Towards the design of correct, scalable, and interoperable caching algorithms

在计算机系统中，为了提高性能，缓存被广泛用于将数据存储在更靠近使用位置的地方。已经提出并开发了许多缓存协议/算法来缓存从存储大多数业务数据的关系数据库（db）检索到的数据。不同的缓存支持不同的数据访问属性，这取决于应用程序和缓存的复杂程度。由于许多应用程序发出事务，它们可能会相互干扰，从而导致数据损坏。因此，缓存算法控制事务对缓存数据的访问，以便为应用程序提供一致的数据视图。由于分布式环境中存在许多活动通信组件，因此很难设计提供一致数据视图的缓存算法，而且还没有创建可扩展的算法。此外，缓存算法之间不兼容，不能互操作。该项目将解决在此类缓存算法的设计和实现中出现的一些重要问题：

Caching is being used pervasively in computer systems to store data closer to where it is used in order to improve performance. Many caching protocols/algorithms have been proposed and developed to cache data retrieved from relational databases (DBs) that store most business data. Different caches support different data access properties, depending on applications and cache sophistication. Because many applications issue transactions they may interfere with each other resulting in corrupted data. Consequently, caching algorithms control access to the cached data by transactions in order to provide applications with a consistent view of data. Because of the many active communicating components in the distributed environment, the design of caching algorithms that provide consistent view of data is difficult and scalable algorithms are yet to be created. Furthermore, the caching algorithms are not compatible with each other and cannot interoperate. This project will address a number of important problems that arise in the design and implementation of such caching algorithms: