Name
Abstract | ||
|---|---|---|
Users of websites such as Facebook, Ebay and Yahoo! demand fast response tines, and these sites replicate data across globally distributed datacenters to achieve this. However, it is not necessary to replicate all data to all locations: if a European user's record is never accessed in Asia, it does not make sense to pay the bandwidth and disk costs to maintain an Asian replica.In this paper, we describe mechanisms for selectively replicating large-scale web databases on a record-by-record basis. We introduce a flexible constraint language to specify replication policy constraints. We then present an adaptive scheme for replicating data to where it is most frequently accessed, while respecting policy constraints and using minimal bookkeeping. Experinents using a modified version of our PNUTS system denonstrate our techniques work well. |
Year | Venue | Field |
|---|---|---|
2011 | PROCEEDINGS OF THE VLDB ENDOWMENT | Data mining,Replica,World Wide Web,Computer science,Bandwidth (signal processing),Bookkeeping,Database,Replicate |
DocType | Volume | Issue |
Journal | 4 | 11 |
ISSN | Citations | PageRank |
2150-8097 | 15 | 0.86 |
References | Authors | |
18 | 8 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sudarshan Kadambi | 1 | 56 | 3.23 |
| Jianjun Chen | 2 | 39 | 12.52 |
| Brian F. Cooper | 3 | 2472 | 135.44 |
| David Lomax | 4 | 24 | 1.51 |
| Raghu Ramakrishnan | 5 | 12649 | 2243.05 |
| Adam Silberstein | 6 | 2281 | 111.23 |
| Erwin Tam | 7 | 1121 | 47.33 |
| Héctor García-Molina | 8 | 24359 | 5652.13 |