✦ LIBER ✦

Concurrency and recovery for index trees

✍ Scribed by David Lomet; Betty Salzberg

Book ID: 106234849
Publisher: Springer-Verlag
Year: 1997
Tongue: English
Weight: 164 KB
Volume: 6
Category: Article
ISSN: 1066-8888
DOI: 10.1007/s007780050042

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Concurrency control and recovery for bal

Concurrency control and recovery for balanced B-link trees

✍ Ibrahim Jaluta; Seppo Sippu; Eljas Soisalon-Soininen 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 295 KB

The hB(^Pi)-tree: a multi-attribute inde

The hB(^Pi)-tree: a multi-attribute index supporting concurrency, recovery and node consolidation

✍ Georgios Evangelidis; David Lomet; Betty Salzberg 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 307 KB

B-tree concurrency control and recovery

B-tree concurrency control and recovery in page-server database systems

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

Relaxed avl trees, main-memory databases

Relaxed avl trees, main-memory databases and concurrency

✍ Nurmi, Otto; Soislon-Soininen, Eljas; Wood, Derick 📂 Article 📅 1996 🏛 Taylor and Francis Group 🌐 English ⚖ 1022 KB

Weighted Binary Trees for Concurrent Sea

Weighted Binary Trees for Concurrent Searching

✍ David Cohen; Michael L. Fredman 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 225 KB

A traditional cost measure for binary search trees is given by weighted path length, which measures the expected cost of a single random search. In this paper, we investigate a generalization, the k-cost, which is suitable for applications involving independent parallel processors each utilizing a c

A Concurrency Buffer Control in B-Trees

A Concurrency Buffer Control in B-Trees for Flash-Memory Storage Systems

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