Making updates disk-I/O friendly using SSDs

Proceedings of the VLDB Endowment

Volumn 6, Issue 11, 2013, Pages 997-1008

  Sadoghi, Mohammad ^a   Ross, Kenneth A ^a,b   Canim, Mustafa ^a   Bhattacharjee, Bishwaranjan ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b Howard Hughes Medical Institute   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL STORAGE; MAINTENANCE;

ANALYTICAL QUERIES; BATCHING TECHNIQUES; INDEX DATA STRUCTURES; INDEX MAINTENANCE; OPEN SOURCE PROJECTS; OPERATIONAL DATA STORES; STORAGE HIERARCHY; TRANSACTION THROUGHPUT;

COST REDUCTION;

EID: 84891094945     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2536222.2536226     Document Type: Article

References (56)

1. BioPostgres: Data management for computational biology. http://www.biopostgres.org/.
2. IBM DB2 Database for Linux, UNIX, and Windows. www.ibm.com/software/data/db2/linux-unix-windows/.
3. IBM DB2 with BLU Acceleration. www.ibm.com/software/data/ db2/linux-unix-windows/db2-blu-acceleration/.
4. OpenFTS: Open source full text search engine. http://openfts.sourceforge.net/.
5. PostGIS: Geographic information systems. http://postgis.refractions.net/.
6. PostgreSQL: Open source object-relational database system. http://www.postgresql.org/.
7. YAGO2: High-quality knowledge base. http://www.mpi-inf.mpg.de/yago-naga/yago/.
8. D. Agrawal, D. Ganesan, R. K. Sitaraman, Y. Diao, and S. Singh. Lazy-adaptive tree: An optimized index structure for flash devices. PVLDB, 2(1):361-372, 2009.
9. C.-H. Ang and K.-P. Tan. The interval B-tree. Inf. Process. Lett., 53(2):85-89, Jan. 1995.
10. R. Arpaci-Dusseau and A. Arpaci-Dusseau. Operating Systems: Three Easy Pieces. Arpaci-Dusseau Books, 0.5 edition, 2012.
11. M. Athanassoulis, S. Chen, A. Ailamaki, P. B. Gibbons, and R. Stoica. MaSM: efficient online updates in data warehouses. In SIGMOD Conference, pages 865-876, 2011.
12. B. Becker, S. Gschwind, T. Ohler, B. Seeger, and P. Widmayer. An asymptotically optimal multiversion B-Tree. VLDB J., 5(4):264-275, 1996.
13. B. Bhattacharjee, L. Lim, T. Malkemus, G. Mihaila, K. Ross, S. Lau, C. McArthur, Z. Toth, and R. Sherkat. Efficient index compression in DB2 LUW. Proc. VLDB Endow., 2(2):1462-1473, Aug. 2009.
14. B. Bhattacharjee, T. Malkemus, S. Lau, S. Mckeough, J.-A. Kirton, R. V. Boeschoten, and J. Kennedy. Efficient bulk deletes for multi dimensionally clustered tables in DB2. In VLDB, pages 1197-1206, 2007.
15. B. Bhattacharjee, K. A. Ross, C. A. Lang, G. A. Mihaila, and M. Banikazemi. Enhancing recovery using an SSD buffer pool extension. In DaMoN, pages 10-16, 2011.
16. T. Bozkaya and M. Özsoyoǧlu. Indexing valid time intervals. Lecture Notes in Computer Science, 1460:541-550, 1998.
17. M. Canim, B. Bhattacharjee, G. A. Mihaila, C. A. Lang, and K. A. Ross. An object placement advisor for DB2 using solid state storage. PVLDB, 2(2):1318-1329, 2009.
18. M. Canim, G. A. Mihaila, B. Bhattacharjee, K. A. Ross, and C. A. Lang. SSD bufferpool extensions for database systems. PVLDB, 3(2):1435-1446, 2010.
19. S. Chaudhuri and V. Narasayya. Automating statistics management for query optimizers. IEEE Trans. on Knowl. and Data Eng., 13(1):7-20, Jan. 2001.
20. S. Chaudhuri and V. R. Narasayya. An efficient cost-driven index selection tool for microsoft SQL server. In Proceedings of the 23rd International Conference on Very Large Data Bases, VLDB '97, pages 146-155, San Francisco, CA, USA, 1997. Morgan Kaufmann Publishers Inc.
21. F. Chen, T. Luo, and X. Zhang. CAFTL: A content-aware flash translation layer enhancing the lifespan of flash memory based solid state drives. In FAST, pages 77-90, 2011.
22. S. Chen. Time travel query or bi-temporal. In DB2 for z/OS Technical Forum, 2010.
23. J. Do, D. Zhang, J. M. Patel, D. J. DeWitt, J. F. Naughton, and A. Halverson. Turbocharging DBMS buffer pool using SSDs. In Proceedings of the 2011 ACM SIGMOD International Conference on Management of data, SIGMOD '11, pages 1113-1124, New York, NY, USA, 2011. ACM.
24. A. J. Dou, S. Lin, and V. Kalogeraki. Real-time querying of historical data in flash-equipped sensor devices. In IEEE Real-Time Systems Symposium, pages 335-344, 2008.
25. G. Drossel. Methodologies for calculating SSD usable life. In Storage Developer Conference, 2009.
26. R. Elmasri, G. T. J. Wuu, and V. Kouramajian. The time index and the monotonic B+-tree. In Temporal Databases, pages 433-456. 1993.
27. Fusion-io breaks one billion IOPS barrier. http://www.fusionio.com/press-releases/ fusion-io-breaks-one-billion-iops-barrier/.
28. H. Garcia-Molina, J. D. Ullman, and J. Widom. Database Systems: The Complete Book. Prentice Hall Press, Upper Saddle River, NJ, USA, 2 edition, 2008.
29. The GiST indexing project. http://gist.cs.berkeley.edu/.
30. H. Gunadhi and A. Segev. Efficient indexing methods for temporal relations. IEEE Trans. on Knowledge and Data Eng., 5(3):496, June 1993.
31. J. M. Hellerstein, J. F. Naughton, and A. Pfeffer. Generalized search trees for database systems. In Proceedings of the 21th International Conference on Very Large Data Bases, VLDB '95, pages 562-573, San Francisco, CA, USA, 1995. Morgan Kaufmann Publishers Inc.
32. F. D. Hinshaw, C. S. Harris, and S. K. Sarin. Controlling visibility in multi-version database systems, 2007. US 7305386 Patent, Netezza Corporation.
33. D. Hitz, J. Lau, and M. Malcolm. File system design for an NFS file server appliance. In Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference, WTEC'94, pages 19-19, Berkeley, CA, USA, 1994. USENIX Association.
34. DB2 10 for z/OS. ftp://public.dhe.ibm.com/software/ systemz/whitepapers/DB210_for_zOS_Upgrade_ebook.pdf.
35. W. H. Inmon. Building the Operational Data Store. John Wiley & Sons, Inc., New York, NY, USA, 2nd edition, 1999.
36. K. Jouini and G. Jomier. Indexing multiversion databases. In Proceedings of the sixteenth ACM conference on Conference on information and knowledge management, CIKM '07, pages 915-918, New York, NY, USA, 2007. ACM.
37. W.-H. Kang, S.-W. Lee, and B. Moon. Flash-based extended cache for higher throughput and faster recovery. PVLDB, 5(11):1615-1626, 2012.
38. P.-A. Larson, S. Blanas, C. Diaconu, C. Freedman, J. M. Patel, and M. Zwilling. High-performance concurrency control mechanisms for main-memory databases. Proc. VLDB Endow., 5(4):298-309, Dec. 2011.
39. J. J. Levandoski, D. B. Lomet, and S. Sengupta. The Bw-Tree: A B-tree for new hardware platforms. In Proceedings of the 2013 IEEE 29th International Conference on Data Engineering, ICDE '13, Washington, DC, USA, 2013. IEEE Computer Society.
40. A. Leventhal. Flash storage memory. Commun. ACM, 51(7):47-51, July 2008.
41. Y. Li, B. He, Q. Luo, and K. Yi. Tree indexing on flash disks. In Proceedings of the 2009 IEEE International Conference on Data Engineering, ICDE '09, pages 1303-1306, Washington, DC, USA, 2009. IEEE Computer Society.
42. D. Lomet, R. Barga, M. F. Mokbel, G. Shegalov, R. Wang, and Y. Zhu. Immortal DB: transaction time support for SQL server. In Proceedings of the 2005 ACM SIGMOD international conference on Management of data, SIGMOD '05, pages 939-941, New York, NY, USA, 2005. ACM.
43. D. Lomet, M. Hong, R. Nehme, and R. Zhang. Transaction time indexing with version compression. Proc. VLDB Endow., 1(1):870-881, Aug. 2008.
44. E. Omiecinski, W. Liu, and I. F. Akyildiz. Analysis of a deferred and incremental update strategy for secondary indexes. Inf. Syst., 16(3):345-356, 1991.
45. P. E. O'Neil, E. Cheng, D. Gawlick, and E. J. O'Neil. The log-structured merge-tree (LSM-Tree). Acta Inf., 33(4):351-385, 1996.
46. Oracle database 11g workspace manager overview. http://www.oracle.com/technetwork/database/ twp-appdev-workspace-manager-11g-128289.pdf.
47. Oracle total recall/flashback data archive. http://www.oracle.com/technetwork/issue-archive/2008/ 08-jul/flashback-data-archive-whitepaper-129145.pdf.
48. M. Rosenblum and J. K. Ousterhout. The design and implementation of a log-structured file system. ACM Trans. Comput. Syst., 10(1):26-52, Feb. 1992.
49. Salzberg and Tsotras. Comparison of access methods for time-evolving data. CSURV: Computing Surveys, 31, 1999.
50. C. M. Saracco, M. Nicola, and L. Gandhi. A matter of time: Temporal data management in DB2 for z/OS, 2010.
51. R. Sears and R. Ramakrishnan. bLSM: a general purpose log structured merge tree. In SIGMOD Conference, pages 217-228, 2012.
52. H. Shen, B. Chin, and O. H. Lu. The TP-Index: A dynamic and efficient indexing mechanism for temporal databases. In In Proceedings of the Tenth International Conference on Data Engineering, pages 274-281. IEEE, 1994.
53. R. T. Snodgrass. A case study of temporal data, 2010. Teradata Corporation.
54. TPC-H, decision support benchmark. http://www.tpc.org/tpch/.
55. H. T. Vo, S. Wang, D. Agrawal, G. Chen, and B. C. Ooi. LogBase: A scalable log-structured database system in the cloud. PVLDB, 5(10):1004-1015, 2012.
56. C.-H. Wu, T.-W. Kuo, and L.-P. Chang. An efficient B-tree layer implementation for flash-memory storage systems. ACM Trans. Embedded Comput. Syst., 6(3), 2007.