The design and implementation of a log-structured file system
ACM Transactions on Computer Systems (TOCS)
DBMSs on a Modern Processor: Where Does Time Go?
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Write amplification analysis in flash-based solid state drives
SYSTOR '09 Proceedings of SYSTOR 2009: The Israeli Experimental Systems Conference
HYRISE: a main memory hybrid storage engine
Proceedings of the VLDB Endowment
SkimpyStash: RAM space skimpy key-value store on flash-based storage
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
HyPer: A hybrid OLTP&OLAP main memory database system based on virtual memory snapshots
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Hekaton: SQL server's memory-optimized OLTP engine
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Identifying hot and cold data in main-memory databases
ICDE '13 Proceedings of the 2013 IEEE International Conference on Data Engineering (ICDE 2013)
The Bw-Tree: A B-tree for new hardware platforms
ICDE '13 Proceedings of the 2013 IEEE International Conference on Data Engineering (ICDE 2013)
| Hi-index | 0.00 |
Database platform support for efficient ranking can have positive performance implications for a number of rank-aware applications, including data exploration, social network analysis, and keyword search. This talk highlights two pieces of work where ranking appears in the research area of database architectures for new hardware. First, we highlight the Bw-tree, a new high-performance B+-tree supporting sorted key-sequential access. The Bw-tree is re-architected to run efficiently on new hardware: its in-memory operations are completely latch-free, removing blocking behavior while also improving multi-core cache behavior, while its storage layer implements a novel log-structured flash storage layer for that exploits fast sequential writes and mitigates adverse performance impact of random writes. Second, we highlight a new classification technique for identifying âĂIJcoldâĂİ (infrequently accessed) data in main-memory database systems. Using a log of sampled record accesses, our technique estimates record access frequencies using exponential smoothing. This classification approach is very efficient: it is able to accurately identify hot and cold records among 1M records in sub-second time from a log of 1B record accesses on a workstation class machine.