A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Filters
LSM-based Storage Techniques: A Survey
[article]
2019
arXiv
pre-print
In this paper, we provide a survey of recent research efforts on LSM-trees so that readers can learn the state-of-the-art in LSM-based storage techniques. ...
Recently, the Log-Structured Merge-tree (LSM-tree) has been widely adopted for use in the storage layer of modern NoSQL systems. ...
Chair) of UC Irvine. ...
arXiv:1812.07527v2
fatcat:cr6ancmllfdwrkxbowqtxy27gm
Enabling low tail latency on multicore key-value stores
2020
Proceedings of the VLDB Endowment
Throughout the paper we discuss these and other design decisions of RStore that differ from those of more traditional systems. ...
Our evaluation shows that RStore scales its throughput with an increasing number of cores while maintaining a robust behavior with low and predictable latency. ...
Finally, we thank Thomas Willhalm, Otto Bruggeman and Heinrich Teiken for providing the hardware and technical support for the experiments. ...
doi:10.14778/3384345.3384356
fatcat:o4esmmmrmnbuxky4blarwuxixa
An Empirical Guide to the Behavior and Use of Scalable Persistent Memory
[article]
2019
arXiv
pre-print
With our improved understanding, we then explore the performance of prior art in application-level software for persistent memory, taking note of where their performance was influenced by our guidelines ...
After nearly a decade of anticipation, scalable nonvolatile memory DIMMs are finally commercially available with the release of Intel's 3D XPoint DIMM. ...
Copyright © 2019 the authors. Uncommitted changes ...
arXiv:1908.03583v1
fatcat:vdni6qh2wnhwfo7mfzmudv7faa
C-store: a column-oriented DBMS
[chapter]
2018
Making Databases Work: the Pragmatic Wisdom of Michael Stonebraker
Among the many differences in its design are: storage of data by column rather than by row, careful coding and packing of objects into storage including main memory during query processing, storing an ...
This paper presents the design of a read-optimized relational DBMS that contrasts sharply with most current systems, which are write-optimized. ...
This work was supported by the National Science Foundation under NSF Grant numbers IIS-0086057 and IIS-0325525. ...
doi:10.1145/3226595.3226638
fatcat:wpvluugvpfchtk2zzgibvizuc4
A practical concurrent index for solid-state drives
2012
Proceedings of the 21st ACM international conference on Information and knowledge management - CIKM '12
Our evaluation confirms significant performance advantages of our approach over less sophisticated ones, and brings out insights on data structure design and OLTP performance tuning on solid-state drives ...
There have been various proposals of indexes specialized for these devices, but to make such indexes practical, we must address the issue of concurrency control. ...
An efficient b-tree layer for flash-memory storage systems. In RTCSA, 2003. From the number of data entries, it is straightforward to calculate the number of blocks. [19] P. E. O'Neil, E. Cheng, D. ...
doi:10.1145/2396761.2398437
dblp:conf/cikm/ThonangiB012
fatcat:q6habe2h6bhtpmnprg62t6rdsa
Flash-aware Database Management Systems
2020
Besides these advantages, an important role in establishment and quick proliferation of Flash storage was played by the black-box design of SSDs, which guaranteed their backwards compatibility with the ...
FTL is a set of Flash management tasks that typically run on device and mask the native behavior of Flash memory. ...
For instance, log-structured file systems and storage engines based on LSM-Trees. ...
doi:10.25534/tuprints-00014476
fatcat:bhbbyleitnb6vhywjbf7khdp7q