Abstract

As discussed in the preceding chapters, client data caching is a fundamental technique for obtaining high performance and scalability in a page server DBMS. Since caching is a form of replication, a protocol is required to ensure that cached copies do not cause transaction semantics to be violated. In this chapter, we first describe the problem of cache consistency maintenance. We then provide a detailed taxonomy that organizes the design space for cache consistency maintenance algorithms. Finally, three families of algorithms are described in greater detail. The performance of these algorithms is explored in the subsequent chapter.1

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call