Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soinin...
Exploiting the emerging reality of affordable multi-core architeces through providing programmers with simple abstractions that would enable them to easily turn their sequential p...
In the last few years an interest in native XML databases has surfaced. With other authors we argue that such databases need their own provisions for concurrency control since tra...
The Deuteronomy system supports efficient and scalable ACID transactions in the cloud by decomposing functions of a database storage engine kernel into: (a) a transactional compon...
Justin J. Levandoski, David B. Lomet, Mohamed F. M...
In this paper we focus on the issue of repository transactions. Similar to database objects repository objects can be accessed form multiple clients simultaneously. The organizati...