Where in the world is my data?

Proceedings of the VLDB Endowment

Volumn 4, Issue 11, 2011, Pages 1040-1050

  Kadambi, Sudarshan ^a   Chen, Jianjun ^a   Cooper, Brian F ^a   Lomax, David ^a   Ramakrishnan, Raghu ^a   Silberstein, Adam ^a   Tam, Erwin ^a   GarciaMolina, Hector ^b  

^a YAHOO INC   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SCHEME; CONSTRAINT LANGUAGE; DATACENTER; FACEBOOK; FAST RESPONSE TIME; LARGE-SCALES; POLICY CONSTRAINTS; WEB DATABASE;

EID: 84863737444     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/3402707.3402740     Document Type: Conference Paper

References (26)

1. Akamai. http://www.akamai.com.
2. Hedwig. https://cwiki.apache.org/conuence/display/ZOOKEEPER/HedWig.
3. MySQL 5.0. http://dev.mysql.com/doc/refman/5.0/-en/replication.html.
4. K. Amiri et al. Dbproxy: A dynamic data cache for web appplications. In ICDE, pages 821-831, 2003.
5. S. Annapureddy et al. Shark: Scaling file servers via cooperative caching. In NSDI, 2005.
6. P. Apers. Data allocation in distributed DBMS. ACM TODS, 13(3):263-304, September 1988.
7. M. Cafarella et al. Data management projects at Google. SIGMOD Record, 34-38(1), March 2008.
8. E. Cohen and S. Shenker. Replication strategies in unstructured peer-to-peer networks. In SIGCOMM, pages 177-190, 2002.
9. B. F. Cooper et al. PNUTS: Yahoo!s hosted data serving platform. PVLDB, 1(2):1277-1288, 2008.
10. C. Curino et al. Schism: a workload-driven approach to database replication and partitioning. In VLDB, pages 48-57, 2010.
11. S. Dar et al. Semantic data caching and replacement. In VLDB, pages 330-341, 1996.
12. G. DeCandia et al. Dynamo: Amazon's highly available key-value store. In SOSP, pages 205-220, 2007.
13. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, NY USA, 1979.
14. A. Halevy. Answering queries using views: A survey. VLDB Journal, 10(4):270-294, 2001.
15. M. Korupolu et al. Placement algorithms for hierarchical cooperative caching. In Symposium on Discrete Algorithms, pages 586-595, 1999.
16. D. Kossmann. The state of the art in distributed query processing. ACM Computing Surveys, 32(4):422-469, 2000.
17. D. Kossmann, M. J. Franklin, and G. Drasch. Cache investment: Integrating query optimization and distributed data placement. ACM TODS, 25(4):517-558, December 2000.
18. A. Lakshman, P. Malik, and K. Ranganathan. Cassandra: A structured storage system on a P2P network. In SIGMOD, 2008.
19. W. Litwin and T. J. E. Schwarz. Lh*rs: A high-availability scalable distributed data structure using reed solomon codes. In SIGMOD, pages 237-248, 2000.
20. J. Nielsen. Usability Engineering. Morgan Kaufmann, San Francisco, CA USA, 1994.
21. L. Ramaswamy et al. Cache clouds: Cooperative caching of dynamic documents in edge networks. In ICDCS, pages 229-238, 2005.
22. J. Sidell et al. Data replication in Mariposa. In ICDE, pages 485-495, 1996.
23. A. Silberstein et al. Feeding Frenzy: Selectively materializing users event feeds. In SIGMOD, pages 831-842, 2010.
24. A. Venkataramani, P. Weidmann, and M. Dahlin. Bandwidth constrained placement in a WAN. In PODC, pages 134-143, 2001.
25. O. Wolfson et al. An adaptive data replication algorithm. ACM TODS., 22(2):255-314, 1997.
26. H. Yu and A. Vahdat. Minimal cost replication for availability. In PODC, pages 98-107, 2002.