In-memory performance for big data

Proceedings of the VLDB Endowment

Volumn 8, Issue 1, 2014, Pages 37-48

  Graefe, Goetz ^a   Volos, Haris ^a   Kimura, Hideaki ^a   Kuno, Harumi ^a   Tucek, Joseph ^a   Lillibridge, Mark ^a   Veitch, Alistair ^b  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER STORAGE; DIGITAL STORAGE; LAKES;

APPLICATION OBJECTS; EXPERIMENTAL EVALUATION; GRACEFUL PERFORMANCE DEGRADATIONS; MEMORY DATABASE; MEMORY DESIGN; MEMORY PERFORMANCE; MEMORY-RESIDENT; SECONDARY STORAGE;

BIG DATA;

EID: 84906699523     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2735461.2735465     Document Type: Article

References (41)

1. T. Anderson. Microsoft SQL Server 14 man: Ǹothing stops a Hekaton transaction'. http://www.theregister.co.uk/2013/06/03/microsoft_sql_server_14_teched/, 2013.
2. M. P. Atkinson, K. Chisholm, W. P. Cockshott, and R. Marshall. Algorithms for a Persistent Heap. Softw., Pract. Exper., 13(3):259-271, 1983.
3. M. J. Carey, D. J. DeWitt, M. J. Franklin, N. E. Hall, M. L. McAuliffe, J. F. Naughton, D. T. Schuh, M. H. Solomon, C. K. Tan, O. G. Tsatalos, S. J. White, and M. J. Zwilling. Shoring up persistent applications. In SIGMOD, pages 383-394, 1994.
4. J. DeBrabant, A. Pavlo, S. Tu, M. Stonebraker, and S. B. Zdonik. Anti-Caching: A New Approach to Database Management System Architecture. PVLDB, 6(14):1942-1953, 2013.
5. C. Diaconu, C. Freedman, E. Ismert, P.-A. Larson, P. Mittal, R. Stonecipher, N. Verma, and M. Zwilling. Hekaton: SQL Servers̀ memory-optimized OLTP engine. SIGMOD, 2013.
6. FAL Labs. Tokyo Cabinet: a modern implementation of DBM. http://fallabs.com/tokyocabinet/.
7. F. Funke, A. Kemper, and T. Neumann. Compacting Transactional Data in Hybrid OLTP & OLAP Databases. PVLDB, 5(11):1424-1435, 2012.
8. H. Garcia-Molina, J. D. Ullman, and J. Widom. Database system implementation, volume 654. Prentice Hall Upper Saddle River, NJ, 2000.
9. G. Graefe. A Survey of B-tree Locking Techniques. ACM TODS, 35(2):16:1-16:26, 2010.
10. G. Graefe. Modern B-tree techniques. Foundations and Trends in Databases, 3(4):203-402, 2011.
11. G. Graefe. A Survey of B-tree Logging and Recovery Techniques. ACM TODS, 37(1):1:1-1:35, 2012.
12. G. Graefe, H. Kimura, and H. Kuno. Foster B-Trees. ACM Transactions on Database Systems (TODS), 2012.
13. SAP HANA. http://www.saphana.com/.
14. S. Harizopoulos, D. Abadi, S. Madden, and M. Stonebraker. OLTP Through the Looking Glass, and What We Found There. In SIGMOD, 2008.
15. A. L. Hosking and J. E. B. Moss. Object Fault Handling for Persistent Programming Languages: A Performance Evaluation. In OOPSLA, pages 288-303, 1993.
16. R. Johnson, I. Pandis, N. Hardavellas, A. Ailamaki, and B. Falsafi. Shore-MT: a scalable storage manager for the multicore era. In EDBT, pages 24-35, 2009.
17. R. Johnson, I. Pandis, R. Stoica, M. Athanassoulis, and A. Ailamaki. Aether: a scalable approach to logging. Proceedings of the VLDB Endowment, 3(1-2):681-692, 2010.
18. H. Jung, H. Han, A. D. Fekete, G. Heiser, and H. Y. Yeom. A scalable lock manager for multicores. In SIGMOD, pages 73-84. ACM, 2013.
19. T. Kaehler and G. Krasner. LOOM: Large Object-Oriented Memory for Smalltalk-80 Systems. In S. B. Zdonik and D. Maier, editors, Readings in Object-Oriented Database Systems, pages 298-307. Kaufmann, San Mateo, CA, 1990.
20. A. Kemper and D. Kossmann. Adaptable Pointer Swizzling Strategies in Object Bases. In ICDE, pages 155-162, 1993.
21. A. Kemper and D. Kossmann. Dual-Buffering Strategies in Object Bases. In VLDB, pages 427-438, 1994.
22. A. Kemper and D. Kossmann. Adaptable Pointer Swizzling Strategies in Object Bases: Design, Realization, and Quantitative Analysis. VLDB J., 4(3):519-566, 1995.
23. K. Küspert. Fehlererkennung und Fehlerbehandlung in Speicherungsstrukturen von Datenbanksystemen. Informatik-Fachberichte. Springer-Verlag, 1985.
24. T. J. Lehman and M. J. Carey. A study of index structures for main memory database management systems. In VLDB, VLDB '86, pages 294-303, San Francisco, CA, USA, 1986. Morgan Kaufmann Publishers Inc.
25. J. J. Levandoski, P.-A. Larson, and R. Stoica. Identifying hot and cold data in main-memory databases. In ICDE, pages 26-37, 2013.
26. M. L. McAuliffe and M. H. Solomon. A trace-based simulation of pointer swizzling techniques. In ICDE, pages 52-61, 1995.
27. C. Mohan. Disk read-write optimizations and data integrity in transaction systems using write-ahead logging. In ICDE, pages 324-331, 1995.
28. MonetDB. http://www.monetdb.org/.
29. J. E. B. Moss. Working with persistent objects: To swizzle or not to swizzle. IEEE Trans. Software Eng., 18(8):657-673, 1992.
30. V. F. Nicola, A. Dan, and D. M. Dias. Analysis of the generalized clock buffer replacement scheme for database transaction processing. SIGMETRICS Perform. Eval. Rev., 20(1):35-46, June 1992.
31. Oracle TimesTen In-Memory Database. http://www.oracle.com/technetwork/products/timesten/overview/index.html.
32. I. Pandis, R. Johnson, N. Hardavellas, and A. Ailamaki. Data-oriented transaction execution. PVLDB, 3(1):928-939, 2010.
33. I. Pandis, P. Tozun, R. Johnson, and A. Ailamaki. PLP: Page latch-free shared-everything OLTP. PVLDB, 2011.
34. S. Park. Personal Communication, 2013.
35. S. Park, T. Kelly, and K. Shen. Failure-atomic msync(): A simple and effcient mechanism for preserving the integrity of durable data. In EuroSys '13, 2013.
36. A. J. Smith. Sequentiality and Prefetching in Database Systems. ACM TODS, 3(3):223-247, Sept. 1978.
37. R. Stoica and A. Ailamaki. Enabling effcient OS paging for main-memory OLTP databases. In DaMoN, page 7, 2013.
38. S. Tu, W. Zheng, E. Kohler, B. Liskov, and S. Madden. Speedy transactions in multicore in-memory databases. In Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, pages 18-32. ACM, 2013.
39. VoltDB. http://www.voltdb.com.
40. S. J. White and D. J. DeWitt. QuickStore: A high performance mapped object store, volume 23. ACM, 1994.
41. P. Wilson and S. V. Kakkad. Pointer swizzling at page fault time: Effciently and compatibly supporting huge address spaces on standard hardware. In Computer Architecture News, pages 364-377, 1992.