Concurrent multidimensional index algorithms in page-server DBMS

In this paper, we present new concurrent R-tree algorithms for page-server database management systems. The algorithms allow for inter-transaction caching of data and index pages, so that a page can reside in a client cache even when no transaction is currently active at the client which reduces the number of client-server interactions and offload server resources (CPU and disks), thus improving client-transaction response time. Cache consistency is guaranteed by an enhanced callback-read locking protocol. Both the concurrency-control and the replica-management protocols operate at the page level.