SWORD: Scalable workload-aware data placement for transactional workloads

ACM International Conference Proceeding Series

Volumn , Issue , 2013, Pages 430-441

  Quamar, Abdul ^a   Kumar, K Ashwin ^a   Deshpande, Amol ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

data placement; database as a service; graph partitioning; quorums; replication

Indexed keywords

DATA PLACEMENT; DATABASE-AS-A-SERVICE; GRAPH PARTITIONING; QUORUMS; REPLICATION;

COMPUTER SYSTEMS; QUERY PROCESSING; RELATIONAL DATABASE SYSTEMS;

COST REDUCTION;

EID: 84876805954     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2452376.2452427     Document Type: Conference Paper

References (26)

1. hMetis: a hypergraph partitioning package, http://glaros.dtc.umn.edu/ gkhome/metis/hmetis/overview.
2. C. Ayka, B.Cambazoglu, and U. Bora. Multi-level direct k-way hypergraph partitioning with multiple constraints and fixed vertices. J. Parallel Distrib. Comput., 2008.
3. J. Baker, C. Bond, J. Corbett, J. J. Furman, A. Khorlin, J. Larson, J. M. Leon, Y. Li, A. Lloyd, and V. Yushprakh. Megastore: Providing scalable, highly available storage for interactive services. In CIDR, 2011.
4. N. Bruno, S. Chaudhuri, A. C. Konig, V. R. Narasayya, R. Ramamurthy, and M. Syamala. Autoadmin project at Microsoft Research: Lessons learned. IEEE Data Eng. Bull., 2011.
5. G. Buehrer and K. Chellapilla. A scalable pattern mining approach to web graph compression with communities. In WSDM, 2008.
6. F. Chang, J. Dean, S. Ghemawat, W. C. Hsieh, D. A. Wallach, M. Burrows, T. Chandra, A. Fikes, and R. E. Gruber. Bigtable: a distributed storage system for structured data. In OSDI '06.
7. C. Curino, Y. Zhang, E. P. C. Jones, and S. Madden. Schism: a workload-driven approach to database replication and partitioning. PVLDB, September 2010.
8. D. J. Dewitt and J. Gray. Parallel database systems: the future of high performance database systems. Communications of the ACM, 1992.
9. S. Fortunato. Community detection in graphs. Physics Reports, 2010.
10. J. Gray, P. Helland, P. E. O'Neil, and D. Shasha. The dangers of replication and a solution. In SIGMOD, 1996.
11. J. Gray and L. Lamport. Consensus on transaction commit. ACM Transactions on Database Systems, 2003.
12. E. P. C. Jones, D. J. Abadi, and S. Madden. Low overhead concurrency control for partitioned main memory databases. In SIGMOD, 2010.
13. R. Kallman, H. Kimura, J. Natkins, A. Pavlo, A. Rasin, S. Zdonik, E. P. Jones, S. Madden, M. Stonebraker, Y. Zhang, J. Hugg, and D. J. Abadi. H-store: a high-performance, distributed main memory transaction processing system. PVLDB, 2008.
14. C. Karande, K. Chellapilla, and R. Andersen. Speeding up algorithms on compressed web graphs. In WSDM, 2009.
15. B. Kemme and A. Gustavo. Database replication: a tale of research across communities. PVLDB, September 2010.
16. B. Kemme, R. Jiménez-Peris, and M. Patiño-Martínez. Database Replication. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, 2010.
17. K. A. Kumar, A. Deshpande, and S. Khuller. Data placement and replica selection for improving colocation in distributed environments. Unpublished manuscript, 2012.
18. A. Lakshman and P. Malik. Cassandra: Structured storage system on a P2P network. In PODC '09.
19. S. Navlakha, R. Rastogi, and N. Shrivastava. Graph summarization with bounded error. In SIGMOD, 2008.
20. R. Nehme and N. Bruno. Automated partitioning design in parallel database systems. In SIGMOD, 2011.
21. A. Pavlo, C. Curino, and S. Zdonik. Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems. In SIGMOD, 2012.
22. J. R. Peris, M. P. Martinez, G. Alonso, and B. Kemme. Are quorums an alternative for data replication? ACM TODS, 28(3) 2003.
23. R. J. Peris and M. P. Martinez. How to select a replication protocol according to scalability, availability and communication overhead. In SRDS, 2001.
24. R. J. Peris, M. P. Martnez, B. Kemme, and G. Alonso. How to select a replication protocol according to scalability, availability, and communication overhead. IEEE Symposium on RDS, 2001.
25. A. L. Tatarowicz, C. Curino, E. P. C. Jones, and S. Madden. Lookup tables: Fine-grained partitioning for distributed databases. In ICDE, 2011.
26. X. Wang, A. Smalter, J. Huan, and G. H. Lushington. G-hash: towards fast kernel-based similarity search in large graph databases. In EDBT, 2009.