An efficient multi-tier Tablet Server Storage architecture

Proceedings of the 2nd ACM Symposium on Cloud Computing, SOCC 2011

Volumn , Issue , 2011, Pages

  Spillane, Richard P ^a   Shetty, Pradeep J ^a   Zadok, Erez ^a   Dixit, Sagar ^a   Archak, Shrikar ^a  

^a STONY BROOK UNIVERSITY   (United States)

Author keywords

ACM proceedings; Log structured merge trees; Multitier storage; Tablet Server

Indexed keywords

ACM PROCEEDINGS; BLOOM FILTERS; CACHE-OBLIVIOUS ALGORITHMS; EXISTING SYSTEMS; INPUT SIZE; LOG-STRUCTURED MERGE TREES; MAGNETIC DISK; MULTI-TIER; SOFTWARE SYSTEMS; STORAGE LAYERS; STORAGE TECHNOLOGY; STRUCTURED DATA;

ALGORITHMS; CLOUD COMPUTING; CLUSTER COMPUTING; DATA STRUCTURES; DISTRIBUTED DATABASE SYSTEMS; SCALABILITY; SEMANTICS; VIRTUAL STORAGE;

MAGNETIC STORAGE;

EID: 82155168677     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2038916.2038917     Document Type: Conference Paper

References (68)

1. Azza Abouzeid, Kamil Bajda-Pawlikowski, Daniel Abadi, Avi Silberschatz, and Alexander Rasin. Hadoopdb: an architectural hybrid of mapreduce and dbms technologies for analytical workloads. Proc. VLDB Endow., 2:922-933, August 2009.
2. D. Agrawal, D. Ganesan, R. Sitaraman, Y. Diao, and S. Singh. Lazy-adaptive tree: an optimized index structure for flash devices. Proc. VLDB Endow., 2(1):361-372, 2009.
3. D. G. Andersen, J. Franklin, M. Kaminsky, A. Phanishayee, L. Tan, and V. Vasudevan. FAWN: A Fast Array of Wimpy Nodes. In Proceedings of the 22nd ACM Symposium on Operating Systems Principles (SOSP '2009), pages 1-14. ACM SIGOPS, October 2009.
4. Eric Anderson and Joseph Tucek. Efficiency matters! SIGOPS Oper. Syst. Rev., 44:40-45, March 2010.
5. The Apache Foundation. Hadoop, January 2010. http://hadoop.apache.org.
6. L. Arge. The buffer tree: A new technique for optimal i/o-algorithms (extended abstract). In University of Aarhus, pages 334-345. Springer-Verlag, 1995.
7. M. A. Bender, M. Farach-Colton, J. T. Fineman, Y. R. Fogel, B. C. Kuszmaul, and J.Nelson. Cache-oblivious streaming b-trees. In SPAA '07: Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures, pages 81-92, New York, NY, USA, 2007. ACM. (Pubitemid 47568557)
8. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13(7):422-426, 1970.
9. M. Cao, T. Y. TsâǍ Ź o, B. Pulavarty, S. Bhattacharya, A. Dilger, and A. Tomas. State of the Art: Where we are with the Ext3 filesystem. In Proceedings of the Linux Symposium, Ottawa, ON, Canada, July 2005.
10. 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: Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation, pages 15-15, Berkeley, CA, USA, 2006. USENIX Association.
11. B. Chazelle and L. J. Guibas. Fractional cascading: A data structuring technique with geometric applications. In Proceedings of the 12th Colloquium on Automata, Languages and Programming, pages 90-100, London, UK, 1985. Springer-Verlag.
12. D. Comer. The Ubiquitous B-Tree. ACM Computing Surveys, 11(2):121-137, June 1979.
13. Brian F. Cooper, Adam Silberstein, Erwin Tam, Raghu Ramakrishnan, and Russell Sears. Benchmarking cloud serving systems with ycsb. In Proceedings of the 1st ACM symposium on Cloud computing, SoCC '10, pages 143-154, New York, NY, USA, 2010. ACM.
14. Ewa Deelman, Gurmeet Singh, Miron Livny, Bruce Berriman, and John Good. The cost of doing science on the cloud: the montage example. In Proceedings of the 2008 ACM/IEEE conference on Supercomputing, SC '08, pages 50:1-50:12, Piscataway, NJ, USA, 2008. IEEE Press.
15. Cassandra Documentation. Getting started. http: //wiki.apache.org/ cassandra/GettingStarteda,2011.
16. HBase Documentation. Hbase: Bigtable-like structured storage for hadoop hdfs. http://wiki.apache.org/hadoop/Hbasea,2011.
17. W. Dong, F. Douglis, K. Li, H. Patterson, S. Reddy, and P. Shilane. Tradeoffs in scalable data routing for deduplication clusters. In Proceedings of the 9th USENIX Conference on File and Storage Technologies, San Jose, California, USA, 2011.
18. Bruno Dumon. Visualizing hbase flushes and compaction. http://outerthought.org/blog/465-ot.html, February 2011.
19. E. D. Demaine. Cache-Oblivious Algorithms and Data Structures, 1999.
20. J. Ellis. Re: Worst case iops to read a row, April 2010. http://cassandra-user-incubator-apache-org.3065146.n2.nabble.com/ Worst-case-iops-toread-a-row-td4874216.html.
21. FusionIO. IODrive octal datasheet. http: //www.fusionio.com/data-sheets/ iodrive-octal/.
22. B. S. Gill. On Multi-level Exclusive Caching: Offline Optimality and Why promotions are better than demotions. In FAST '08: Proccedings of the 6th conference on File and storage technologies, Berkeley, CA, USA, 2008. USENIX Association.
23. G. Graefe. Write-optimized b-trees. In VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases, pages 672-683. VLDB Endowment, 2004.
24. J. Gray and A. Reuter. Transaction Processing: Concepts and Techniques. Morgan Kaufmann, San Mateo, CA, 1993.
25. F. Hady. Integrating NAND Flash into the Storage Hierarchy ...Research or Product Design?, 2009. http://csl.cse.psu.edu/wish2009fiinvitetalk1.html.
26. D. Hitz, J. Lau, and M. Malcolm. File System Design for an NFS File Server Appliance. In Proceedings of the USENIX Winter Technical Conference, pages 235-245, San Francisco, CA, January 1994. USENIX Association.
27. Hypertable. Hypertable. http://www.hypertable.org, 2011.
28. IBM. Hierarchical Storage Management. www.ibm.com/servers/eserver/ iseries/hsmcomp/,2004.
29. Intel Inc. Over-provisioning an intel ssd. Technical Report 324441-001, Intel Inc., October 2010. cache-www.intel.com/cd/00/00/45/95/459555fi459555.pdf.
30. D. Jung, J. Kim, S. Park, J. Kang, and J. Lee. FASS: A Flash-Aware Swap System. In Proc. of International Workshop on Software Support for Portable Storage (IWSSPS), 2005.
31. R. Kothiyal, V. Tarasov, P. Sehgal, and E. Zadok. Energy and Performance Evaluation of Lossless File Data Compression on Server Systems. In Proceedings of the 2nd Israeli Experimental Systems Conference (ACM SYSTOR '09), Haifa, Israel, May 2009. ACM.
32. Hans-Peter Kriegel, Peer Kröger, Christiaan Hendrikus Van Der Meijden, Henriette Obermaier, Joris Peters, and Matthias Renz. Towards archaeo-informatics: scientific data management for archaeobiology. In Proceedings of the 22nd international conference on Scientific and statistical database management, SSDBM'10, pages 169-177, Berlin, Heidelberg, 2010. Springer-Verlag.
33. Avinash Lakshman and Prashant Malik. Cassandra: structured storage system on a p2p network. In Proceedings of the 28th ACM symposium on Principles of distributed computing, PODC '09, pages 5-5, New York, NY, USA, 2009. ACM.
34. A. Leventhal. Flash storage memory. Communications of the ACM, 51(7):47-51, 2008.
35. Y. Li, B. He, Q. Luo, and K. Yi. Tree indexing on flash disks. In ICDE '09: Proceedings of the 2009 IEEE International Conference on Data Engineering, pages 1303-1306, Washington, DC, USA, 2009. IEEE Computer Society.
36. B. Liskov, A. Adya, M. Castro, S. Ghemawat, R. Gruber, U. Maheshwari, A. C. Myers, M. Day, and L. Shrira. Safe and efficient sharing of persistent objects in thor. In SIGMOD '96: Proceedings of the 1996 ACM SIGMOD international conference on Management of data, pages 318-329, New York, NY, USA, 1996. ACM. (Pubitemid 126440779)
37. Wei Lu, Jared Jackson, and Roger Barga. Azureblast: a case study of developing science applications on the cloud. In Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing, HPDC '10, pages 413-420, New York, NY, USA, 2010. ACM.
38. nd symposium on Operating systems principles, pages 147-160, New York, NY, USA, 2009. ACM.
39. M. K. McKusick, W. N. Joy, S. J. Leffler, and R. S. Fabry. A fast file system for UNIX. ACM Transactions on Computer Systems, 2(3):181-197, August 1984.
40. C. Mohan, D. Haderle, B. Lindsay, H. Pirahesh, and P. Schwarz. ARIES: a transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging. ACM Trans. Database Syst., 17(1):94-162, 1992. (Pubitemid 23609944)
41. Beomseok Nam, Henrique Andrade, and Alan Sussman. Multiple range query optimization with distributed cache indexing. In Proceedings of the 2006 ACM/IEEE conference on Supercomputing, SC '06, New York, NY, USA, 2006. ACM.
42. S. Nath and A. Kansal. FlashDB: Dynamic Self-tuning Database for NAND Flash. Technical Report MSR-TR-2006-168, Microsoft Research, November 2006.
43. National Radio Astronomy Observatory. Innovations in data-intensive astronomy. http://www.nrao.edu/meetings/bigdata/,April 2011.
44. P. O'Neil, E. Cheng, D. Gawlick, and E. O'Neil. The log-structured merge-tree (LSM-tree). Acta Inf., 33(4):351-385, 1996. (Pubitemid 126331527)
45. Oracle. Database administrator's reference. http://download.oracle.com/ docs/cd/B19306fi01/server.102/b15658/tuning.htm,March 2009.
46. R. Orlandic. Effective management of hierarchical storage using two levels of data clustering. Mass Storage Systems, IEEE Symposium on, 0:270, 2003.
47. Andrew Pavlo, Erik Paulson, Alexander Rasin, Daniel J. Abadi, David J. DeWitt, Samuel Madden, and Michael Stonebraker. A comparison of approaches to large-scale data analysis. In Proceedings of the 35th SIGMOD international conference on Management of data, SIGMOD '09, pages 165-178, New York, NY, USA, 2009. ACM.
48. H. Payer, M. A. A. Sanvido, Z. Z. Bandic, and C. M. Kirsch. Combo Drive: Optimizing Cost and Performance in a Heterogeneous Storage Device. In Proc. Workshop on Integrating Solid-state Memory into the Storage Hierarchy (WISH), 2009. http: //csl.cse.psu.edu/wish2009fipapers/Payer.pdf.
49. Eric Perlman, Randal Burns, Yi Li, and Charles Meneveau. Data exploration of turbulence simulations using a database cluster. In Proceedings of the 2007 ACM/IEEE conference on Supercomputing, SC '07, pages 23:1-23:11, New York, NY, USA, 2007. ACM.
50. PostgreSQL Global Development Team. PostgreSQL. http://www.postgresql. org, 2011.
51. M. Rosenblum and J. K. Ousterhout. The design and implementation of a log-structured file system. In Proceedings of 13th ACM Symposium on Operating Systems Principles, pages 1-15, Asilomar Conference Center, Pacific Grove, CA, October 1991. Association for Computing Machinery SIGOPS.
52. J. Rydningcom and M. Shirer. Worldwide hard disk drive 2010-2014 forecast: Sowing the seeds of change for enterprise applications. IDC Study 222797, www.idc.com, May 2010.
53. M. Saxena and M. M. Swift. Flashvm: Revisiting the virtual memory hierarchy, 2009.
54. Michael C. Schatz. Cloud computing and the dna data race. Nature Biotechnology, 28:691-693, 2010.
55. R. Sears and E. Brewer. Stasis: Flexible Transactional Storage. In Proceedings of the 7th Symposium on Operating Systems Design and Implementation (OSDI 2006), Seattle, WA, November 2006. ACM SIGOPS.
56. R. Sears, M. Callaghan, and E. Brewer. Rose: Compressed, log-structured replication. In Proceedings of the VLDB Endowment, volume 1, Auckland, New Zealand, 2008.
57. P. Sehgal, V. Tarasov, and E. Zadok. Evaluating Performance and Energy in File System Server Workloads extensions. In Proceedings of the Eighth USENIX Conference on File and Storage Technologies (FAST '10), pages 253-266, San Jose, CA, February 2010. USENIX Association.
58. P. Sehgal, V. Tarasov, and E. Zadok. Optimizing Energy and Performance for Server-Class File System Workloads. ACM Transactions on Storage (TOS), 6(3), September 2010.
59. L. Shrira, B. Liskov, M. Castro, and A. Adya. How to scale transactional storage systems. In EW 7: Proceedings of the 7th workshop on ACM SIGOPS European workshop, pages 121-127, New York, NY, USA, 1996. ACM.
60. Sleepycat Software, Inc. Berkeley DB Reference Guide, 4.3.27 edition, December 2004. www.oracle.com/technology/documentation/berkeley-db/db/apific/ frame.html.
61. Keith A. Smith. File system benchmarks. http://www.eecs.harvard.edu/ ~keith/usenix96/,1996.
62. R. Spillane, S. Dixit, S. Archak, S. Bhanage, and E. Zadok. Exporting kernel page caching for efficient user-level I/O. In Proceedings of the 26th International IEEE Symposium on Mass Storage Systems and Technologies, Incline Village, Nevada, May 2010. IEEE.
63. R. Spillane, R. Sears, C. Yalamanchili, S. Gaikwad, M. Chinni, and E. Zadok. Story Book: An Efficient Extensible Provenance Framework. In Proceedings of the first USENIX workshop on the Theory and Practice of Provenance (TAPP '09), San Francisco, CA, February 2009. USENIX Association.
64. R. P. Spillane, S. Gaikwad, E. Zadok, C. P. Wright, and M. Chinni. Enabling transactional file access via lightweight kernel extensions. In Proceedings of the Seventh USENIX Conference on File and Storage Technologies (FAST '09), pages 29-42, San Francisco, CA, February 2009. USENIX Association.
65. A. Traeger, N. Joukov, C. P. Wright, and E. Zadok. A Nine Year Study of File System and Storage Benchmarking. ACM Transactions on Storage (TOS), 4(2):25-80, May 2008.
66. Vertica. The Vertica Analytic Database. http://vertica.com,March 2010.
67. A. Wang, G. Kuenning, P. Reiher, and G. Popek. The conquest file system: Better performance through a disk/persistent-ram hybrid design. Trans. Storage, 2(3):309-348, 2006. (Pubitemid 44656447)
68. B. Zhu, K. Li, and H. Patterson. Avoiding the disk bottleneck in the data domain deduplication file system. In Proceedings of the 6th USENIX Conference on File and Storage Technologies, San Jose, California, USA, 2008.