✦ LIBER ✦

Multiversion concurrency control for the generalized search tree

✍ Scribed by Walter Binder; Adina Mosincat; Samuel Spycher; Ion Constantinescu; Boi Faltings

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 791 KB
Volume: 21
Category: Article
ISSN: 1532-0626
DOI: 10.1002/cpe.1387

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Characterizing Concurrency Control Perfo

Characterizing Concurrency Control Performance for the PIOUS Parallel File System

✍ Steven A. Moyer; V.S. Sunderam 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 276 KB

Parallel file systems employ data declustering to increase I/O throughput. However, because a single read or write operation can generate data accesses on multiple independent storage devices, a concurrency control mechanism must be employed to retain familiar file access semantics. Concurrency cont

The Pessimistic Search and the Straighte

The Pessimistic Search and the Straightening Involution for Trees

✍ William Y.C. Chen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 106 KB

We introduce the idea of pessimistic search on a rooted tree, and develop the straightening involution to relate the inversion polynomial evaluated at q = -1 to the number of even rooted trees. We obtain a differential equation for the inversion polynomial of cyclic trees evaluated at q = -1, a prob

A tabu search heuristic for the Steiner

A tabu search heuristic for the Steiner Tree Problem

✍ Gendreau, Michel; Larochelle, Jean-Francois; Sans�, Brunilde 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 342 KB 👁 2 views

The Steiner Tree Problem (STP) in graphs is a well-known NP-hard problem. It has regained attention due to the introduction of new telecommunication technologies, such as ATM, since it appears as the inherent mathematical structure behind multicast communications. In this paper, we present a tabu se

The generalized tree for state variables

The generalized tree for state variables in linear active networks

✍ Shew-Kin Mark; M. N. S. Swamy 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB

A tabu search algorithm for the Capacita

A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem

✍ Sharaiha, Yazid M.; Gendreau, Michel; Laporte, Gilbert; Osman, Ibrahim H. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 2 views

The Capacitated Shortest Spanning Tree Problem consists of determining a shortest spanning tree in a vertex weighted graph such that the weight of every subtree linked to the root by an edge does not exceed a prescribed capacity. We propose a tabu search heuristic for this problem, as well as dynami