暂无分享,去创建一个
Beng Chin Ooi | H. V. Jagadish | Weng-Fai Wong | Zhongle Xie | Qingchao Cai | B. Ooi | H. Jagadish | W. Wong | Qingchao Cai | Zhongle Xie
[1] Erez Petrank,et al. A lock-free B+tree , 2012, SPAA '12.
[2] Kenneth A. Ross,et al. Implementing database operations using SIMD instructions , 2002, SIGMOD '02.
[3] Michel Raynal,et al. No Hot Spot Non-blocking Skip List , 2013, 2013 IEEE 33rd International Conference on Distributed Computing Systems.
[4] Adam Silberstein,et al. Benchmarking cloud serving systems with YCSB , 2010, SoCC '10.
[5] Wolfgang Lehner,et al. ERIS: A NUMA-Aware In-Memory Storage Engine for Analytical Workload , 2014, ADMS@VLDB.
[6] Craig Freedman,et al. Hekaton: SQL server's memory-optimized OLTP engine , 2013, SIGMOD '13.
[7] Eddie Kohler,et al. Cache craftiness for fast multicore key-value storage , 2012, EuroSys '12.
[8] Kenneth A. Ross,et al. Making B+-Trees Cache Conscious in Main Memory , 2000, SIGMOD Conference.
[9] Todd C. Mowry,et al. Improving index performance through prefetching , 2001, SIGMOD '01.
[10] Eddie Kohler,et al. Speedy transactions in multicore in-memory databases , 2013, SOSP.
[11] Pradeep Dubey,et al. PALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors , 2011, Proc. VLDB Endow..
[12] Gustavo Alonso,et al. Main-memory hash joins on multi-core CPUs: Tuning to the underlying hardware , 2012, 2013 IEEE 29th International Conference on Data Engineering (ICDE).
[13] Sudipta Sengupta,et al. Indexing on modern hardware: hekaton and beyond , 2014, SIGMOD Conference.
[14] Alfons Kemper,et al. Massively Parallel Sort-Merge Joins in Main Memory Multi-Core Database Systems , 2012, Proc. VLDB Endow..
[15] Alexandra Fedorova,et al. A case for NUMA-aware contention management on multicore systems , 2010, 2010 19th International Conference on Parallel Architectures and Compilation Techniques (PACT).
[16] Maurice Herlihy,et al. Wait-free synchronization , 1991, TOPL.
[17] S. B. Yao,et al. Efficient locking for concurrent operations on B-trees , 1981, TODS.
[18] James Aspnes,et al. Skip graphs , 2003, SODA '03.
[19] Faith Ellen,et al. Pragmatic primitives for non-blocking data structures , 2013, PODC '13.
[20] Ippokratis Pandis,et al. NUMA-aware algorithms: the case of data shuffling , 2013, CIDR.
[21] Sudipta Sengupta,et al. The Bw-Tree: A B-tree for new hardware platforms , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).
[22] David B. Lomet,et al. Simple, robust and highly concurrent b-trees with node deletion , 2004, Proceedings. 20th International Conference on Data Engineering.
[23] Maurice Herlihy,et al. The Art of Multiprocessor Programming, Revised Reprint , 2012 .
[24] Pradeep Dubey,et al. FAST: fast architecture sensitive tree search on modern CPUs and GPUs , 2010, SIGMOD Conference.
[25] Gustavo Alonso,et al. Multi-Core, Main-Memory Joins: Sort vs. Hash Revisited , 2013, Proc. VLDB Endow..
[26] Viktor Leis,et al. Massively Parallel NUMA-aware Hash Joins , 2013, IMDM@VLDB.
[27] Norman May,et al. Scaling Up Concurrent Main-Memory Column-Store Scans: Towards Adaptive NUMA-aware Data and Task Placement , 2015, Proc. VLDB Endow..
[28] Anastasia Ailamaki,et al. ATraPos: Adaptive transaction processing on hardware Islands , 2014, 2014 IEEE 30th International Conference on Data Engineering.
[29] Douglas Comer,et al. Ubiquitous B-Tree , 1979, CSUR.
[30] Kenneth A. Ross,et al. Making B+- trees cache conscious in main memory , 2000, SIGMOD '00.
[31] Michael Stonebraker,et al. H-store: a high-performance, distributed main memory transaction processing system , 2008, Proc. VLDB Endow..
[32] Pradeep Dubey,et al. Efficient implementation of sorting on multi-core SIMD CPU architecture , 2008, Proc. VLDB Endow..
[33] Ittai Abraham,et al. Skip B-Trees , 2005, OPODIS.
[34] Kenneth A. Ross,et al. Cache Conscious Indexing for Decision-Support in Main Memory , 1999, VLDB.
[35] Jignesh M. Patel,et al. Effect of node size on the performance of cache-conscious B+-trees , 2003, SIGMETRICS '03.
[36] William Pugh,et al. Skip Lists: A Probabilistic Alternative to Balanced Trees , 1989, WADS.
[37] Alfons Kemper,et al. HyPer: A hybrid OLTP&OLAP main memory database system based on virtual memory snapshots , 2011, 2011 IEEE 27th International Conference on Data Engineering.
[38] Wolfgang Lehner,et al. Efficient transaction processing in SAP HANA database: the end of a column store myth , 2012, SIGMOD Conference.