Results

**1 - 2**of**2**### 1 Introduction Algorithms for the Data Placement Problem

"... We consider the data placement problem introduced by Baev & Rajaraman [1]. We have a set of caches, F, a set of data objects O, and a set of clients D. Each object s ∈ O has a length ls and a cache i ∈ F ..."

Abstract
- Add to MetaCart

We consider the data placement problem introduced by

*Baev*&*Rajaraman*[1]. We have a set of caches, F, a set of data objects O, and a set of clients D. Each object s ∈ O has a length ls and a cache i ∈ F### Algorithms for the Data Placement Problem

"... 1 Introduction We consider the data placement problem introduced by Baev & Rajaraman [1]. We have a set of caches, F, a set of data objects O, and a set of clients D. Each object s 2 O has a length ls and a cache i 2 Fhas capacity ui that limits the total length of data objects that may be store ..."

Abstract
- Add to MetaCart

1 Introduction We consider the data placement problem introduced by

*Baev*&*Rajaraman*[1]. We have a set of caches, F, a set of data objects O, and a set of clients D. Each object s 2 O has a length ls and a cache i 2 Fhas capacity ui that limits the total length of data objects that may**1 - 2**of

**2**