𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient multiway radix search trees

✍ Scribed by Úlfar Erlingsson; Mukkai Krishnamoorthy; T.V. Raman

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
551 KB
Volume
60
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

✦ Synopsis

We present a new scheme for building static search trees, using multiway radix search. We apply this method to me problem of code generation for switch statements in imperative languages. For sparse case sets, the method has an advantage over existing methods, empirically requiring fewer than three branches for me average search. We give timing results that show that in practice our method runs faster man other methods on large sparse case sets.

📜 SIMILAR VOLUMES

Efficient rebalancing of chromatic searc
Efficient rebalancing of chromatic search trees
✍ Joan Boyar; Kim S. Larsen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 827 KB

Chromatic trees were defined by Nurmi and Soisalon-Soininen, as a new type of binary search tree for databases. The aim is to improve runtime performance by allowing a greater degree of concurrency, which, in turn, is obtained by uncoupling updating from rebalancing. This also allows rebalancing to

New efficient breadth-first/level traver
New efficient breadth-first/level traversal tree search method for the design and upgrade of sensor networks
✍ Duy Quang Nguyen; Miguel J. Bagajewicz 📂 Article 📅 2010 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 427 KB 👁 2 views

## Abstract This work studies the problem of optimally locating sensors for monitoring chemical processes, formally known as the sensor network design and upgrade problem. This problem is an integer programming problem and has been solved to global optimality only using tree search methods using de