Cache craftiness for fast multicore key-value storage

EuroSys'12 - Proceedings of the EuroSys 2012 Conference

Volumn , Issue , 2012, Pages 183-196

  Mao, Yandong ^a   Kohler, Eddie ^b   Morris, Robert ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

In memory; Key value; Multicore; Persistent

Indexed keywords

CHECK POINTING; FAN-OUT; HASH TABLE; IN-MEMORY; KEY-VALUE; LOOKUPS; MULTI CORE; OPTIMISTIC CONCURRENCY; PERSISTENT; PREFETCHING; SHARED DATA STRUCTURE; TREE NODES;

CONCURRENCY CONTROL; DATA STRUCTURES; FORESTRY;

DYNAMIC RANDOM ACCESS STORAGE;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DATA BASES; PROBLEM SOLVING;

EID: 84860592643     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2168836.2168855     Document Type: Conference Paper

References (35)

1. Sharding for startups. http://www.startuplessonslearned.com/2009/01/ sharding-for-startups.html.
2. MongoDB. http://mongodb.com.
3. Redis. http://redis.io.
4. Cassandra @ Twitter: An interview with Ryan King. http://nosql.mypopescu. com/post/407159447/cassandra-twitter-an-interview-with-ryan-king.
5. VoltDB, the NewSQL database for high velocity applications. http://voltdb.com.
6. R. Bayer and E. McCreight. Organization and maintenance of large ordered indices. In Proc. 1970 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control, SIGFIDET '70, pages 107-141.
7. R. Bayer and K. Unterauer. Prefix B-Trees. ACM Transactions on Database Systems, 2(1):11-26, Mar. 1977.
8. P. Bohannon, P. McIlroy, and R. Rastogi. Main-memory index structures with fixed-size partial keys. SIGMOD Record, 30: 163-174, May 2001.
9. N. G. Bronson, J. Casper, H. Chafi, and K. Olukotun. A practical concurrent binary search tree. In Proc. 15th ACM PPoPP Symposium, Bangalore, India, 2010.
10. *TIME: Highly scalable OLTP DBMS for managing update-intensive stream workload. In Proc. 30th VLDB Conference, pages 1033-1044, 2004.
11. S. K. Cha, S. Hwang, K. Kim, and K. Kwon. Cacheconscious concurrency control of main-memory indexes on shared-memory multiprocessor systems. In Proc. 27th VLDB Conference, 2001.
12. 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. ACM Transactions on Computer Systems, 26:4:1-4:26, June 2008.
13. S. Chen, P. B. Gibbons, and T. C. Mowry. Improving index performance through prefetching. In Proc. 2001 SIGMOD Conference, pages 235-246.
14. J. Cieslewicz and K. A. Ross. Data partitioning on chip multiprocessors. In Proc. 4th International Workshop on Data Management on New Hardware, DaMoN '08, pages 25-34, New York, NY, USA, 2008.
15. J. Cieslewicz, K. A. Ross, K. Satsumi, and Y. Ye. Automatic contention detection and amelioration for data-intensive operations. In Proc. 2010 SIGMOD Conference, pages 483-494.
16. B. F. Cooper, A. Silberstein, E. Tam, R. Ramakrishnan, and R. Sears. Benchmarking cloud serving systems with YCSB. In Proc. 1st ACM Symposium on Cloud Computing, SoCC '10, pages 143-154, New York, NY, USA, 2010.
17. G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels. Dynamo: Amazon's highly available key-value store. In Proc. 21st ACM SOSP, pages 205-220, 2007. (Pubitemid 351429377)
18. B. Fitzpatrick. LiveJournal's backend - a history of scaling. http://www.danga.com/words/2005-oscon/oscon-2005.pdf.
19. K. Fraser. Practical lock-freedom. Technical Report UCAM-CL-TR-579, University of Cambridge Computer Laboratory, 2004.
20. E. Fredkin. Trie memory. Communications of the ACM, 3: 490-499, September 1960.
21. N. Hardavellas, I. Pandis, R. Johnson, N. G. Mancheril, A. Ailamaki, and B. Falsafi. Database servers on chip multiprocessors: Limitations and opportunities. In 3rd Biennial Conference on Innovative Data Systems Research (CIDR), Asilomar, Califormnia, USA, January 2007.
22. K. A. Hua and C. Lee. Handling data skew in multiprocessor database computers using partition tuning. In Proc. 17th VLDB Conference, pages 525-535, 1991.
23. J. Hugg. Key-value benchmarking. http://voltdb.com/company/blog/key- value-benchmarking.
24. R. Johnson, I. Pandis, N. Hardavellas, A. Ailamaki, and B. Falsafi. Shore-MT: A scalable storage manager for the multicore era. In Proc. 12th International Conference on Extending Database Technology: Advances in Database Technology, pages 24-35, New York, NY, USA, 2009.
25. R. Kallman, H. Kimura, J. Natkins, A. Pavlo, A. Rasin, S. Zdonik, E. P. C. Jones, S. Madden, M. Stonebraker, Y. Zhang, J. Hugg, and D. J. Abadi. H-Store: A highperformance, distributed main memory transaction processing system. Proc. VLDB Endowment, 1:1496-1499, August 2008.
26. A. Lakshman and P. Malik. Cassandra: A decentralized structured storage system. ACM SIGOPS Operating System Review, 44:35-40, April 2010.
27. P. L. Lehman and S. B. Yao. Efficient locking for concurrent operations on B-trees. ACM Transactions on Database Systems, 6(4):650-670, 1981.
28. P. E. McKenney, D. Sarma, A. Arcangeli, A. Kleen, O. Krieger, and R. Russell. Read-copy update. In Proc. 2002 Ottawa Linux Symposium, pages 338-367, 2002.
29. C. Nyberg, T. Barclay, Z. Cvetanovic, J. Gray, and D. Lomet. AlphaSort: A cache-sensitive parallel external sort. The VLDB Journal, 4(4):603-627, 1995.
30. J. Rao and K. A. Ross. Making B+-trees cache conscious in main memory. SIGMOD Record, 29:475-486, May 2000.
31. K. A. Ross. Optimizing read convoys in main-memory query processing. In Proc. 6th International Workshop on Data Management on New Hardware, DaMoN '10, pages 27-33, New York, NY, USA, 2010. ACM.
32. S. Schneider, C. D. Antonopoulos, and D. S. Nikolopoulos. Scalable locality-conscious multithreaded memory allocation. In Proc. 5th International Symposium on Memory Management, ISMM '06, pages 84-94. ACM, 2006. (Pubitemid 46609209)
33. S. Sen and R. E. Tarjan. Deletion without rebalancing in balanced binary trees. In Proc. 21st SODA, pages 1490-1499, 2010.
34. J. Sewall, J. Chhugani, C. Kim, N. Satish, and P. Dubey. PALM: Parallel architecture-friendly latch-free modifications to B+ trees on many-core processors. Proc. VLDB Endowment, 4(11):795-806, August 2011.
35. M. Stonebraker, S. Madden, J. D. Abadi, S. Harizopoulos, N. Hachem, and P. Helland. The end of an architectural era: (it's time for a complete rewrite). In Proc. 33rd VLDB Conference, pages 1150-1160, 2007.