𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Data replication in static tree structures

✍ Scribed by Susanne E Hambrusch; Chuan-Ming Liu

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
133 KB
Volume
86
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The complexity of static data replicatio
The complexity of static data replication in data grids
✍ UroΕ‘ Čibej; BoΕ‘tjan Slivnik; Borut Robič πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 161 KB

Data replication is a well-known technique used in distributed computing to improve access to data and/or system fault-tolerance. Recently, studies of its applications to grid computing have also been initiated. In this article we describe data replication on data grids as a static optimization prob

Optimal approximations of nonlinear payo
Optimal approximations of nonlinear payoffs in static replication
✍ Qiang Liu πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 134 KB

## Abstract Static replication of nonlinear payoffs by line segments (or equivalently vanilla options) is an important hedging method, which unfortunately is only an approximation. If the strike prices of options are adjustable (for OTC options), two optimal approximations can be defined for replic

Digital Access to Comparison-Based Tree
Digital Access to Comparison-Based Tree Data Structures and Algorithms
✍ Salvador Roura πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 280 KB

This paper presents a simple method of building tree data structures, which only requires visiting log N nodes and comparing D digits per search or update, where N is the number of keys and D is the length of the keys. These bounds hold independently of the order of the updates and of the digits of

Dynamic data replication in LCG 2008
Dynamic data replication in LCG 2008
✍ C. Nicholson; D. G. Cameron; A. T. Doyle; A. P. Millar; K. Stockinger πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 297 KB