✦ LIBER ✦

AVL Trees with Relaxed Balance

✍ Scribed by Kim S. Larsen

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 185 KB
Volume: 61
Category: Article
ISSN: 0022-0000
DOI: 10.1006/jcss.2000.1705

No coin nor oath required. For personal study only.

✦ Synopsis

The idea of relaxed balance is to uncouple the rebalancing in search trees from the updating in order to speed up request processing in main-memory databases. In this paper, we describe a relaxed version of AVL trees. We prove that each update gives rise to at most a logarithmic number of rebalancing operations and that the number of rebalancing operations in the semidynamic case is amortized constant.

📜 SIMILAR VOLUMES

Embedding Large Complete Binary Trees in

Embedding Large Complete Binary Trees in Hypercubes with Load Balancing

✍ Kemal Efe 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 211 KB

In the next section we present basic definitions and notations where the criterion of optimality is defined and related to the concept of ''normal'' algorithms. In Section 3 we present an optimal embedding method that balances the processor loads. In Section 4 we present a nonoptimal embedding metho

A study on the glycaemic balance in stre

A study on the glycaemic balance in streptozotocin-diabetic rats treated with an aqueous extract of Ficus carica (fig tree) leaves

✍ C. Pérez; E. Domínguez; J. M. Ramiro; A. Romero; J. E. Campillo; M. D. Torres 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB 👁 2 views

The hypoglycaemic effect of an aqueous extract of Ficus cariCa leaves was studied in streptozotocin-diabetic rats. The extract induced a significant hypoglycaemic effect after either oral-or intraperitoneal (i.p.) administration. Body weight loss was prevented in treated diabetic rats and the surviv