✦ LIBER ✦

Relaxed avl trees, main-memory databases and concurrency

✍ Scribed by Nurmi, Otto; Soislon-Soininen, Eljas; Wood, Derick

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comments on "Concurrent Search and Inser

✍ Gottlieb, A. 📂 Article 📅 1981 🏛 IEEE 🌐 English ⚖ 222 KB

Prefetching J+-Tree: A Cache-Optimized M

✍ Hua Luan; Xiao-Yong Du; Shan Wang 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 746 KB

A Concurrency Buffer Control in B-Trees

✍ Chin-Hsien Wu; Yu-Hsun Lin 📂 Article 📅 2012 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 411 KB

B-tree concurrency control and recovery

✍ Jaluta, Ibrahim; Sippu, Seppo; Soisalon-Soininen, Eljas 📂 Article 📅 2006 🏛 Association for Computing Machinery 🌐 English ⚖ 392 KB

[Lecture Notes in Computer Science] Adva

✍ Hadzilacos, Thanasis; Manolopoulos, Yannis; Roddick, John; Theodoridis, Yannis 📂 Article 📅 2003 🏛 Springer Berlin Heidelberg ⚖ 258 KB

[Lecture Notes in Computer Science] Adva

✍ Kotagiri, Ramamohanarao; Krishna, P. Radha; Mohania, Mukesh; Nantajeewarawat, Ek 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 273 KB