research-article

A cost model for NDP-aware query optimization for KV-stores

Authors:

Christian Knödler,

Tobias Vinçon,

Arthur Bernhardt,

Leonardo Solis-Vasquez,

Andreas KochAuthors Info & Claims

DAMON '21: Proceedings of the 17th International Workshop on Data Management on New Hardware

Article No.: 12, Pages 1 - 5

https://doi.org/10.1145/3465998.3466013

Published: 20 June 2021 Publication History

Abstract

Many modern DBMS architectures require transferring data from storage to process it afterwards. Given the continuously increasing amounts of data, data transfers quickly become a scalability limiting factor. Near-Data Processing and smart/computational storage emerge as promising trends allowing for decoupled in-situ operation execution, data transfer reduction and better bandwidth utilization. However, not every operation is suitable for an in-situ execution and a careful placement and optimization is needed.

In this paper we present an NDP-aware cost model. It has been implemented in MySQL and evaluated with nKV. We make several observations underscoring the need for optimization.

References

[1]

Ian F. Adams, John Keys, and Michael P. Mesnier. 2019. Respecting the Block Interface - Computational Storage Using Virtual Objects. In Proc. FAST 2019.

[2]

Wei Cao, Yang Liu, and et al. 2020. POLARDB Meets Computational Storage: Efficiently Support Analytical Workloads in Cloud-Native Relational Database. In USENIX FAST. 29--41.

[3]

Arup De, Maya Gokhale, Steven Swanson, and et. al. 2013. Minerva: Accelerating Data Analysis in Next-Generation SSDs. In Proc. FCCM.

Digital Library

[4]

David DeWitt and Jim Gray. 1992. Parallel Database Systems: The Future of High Performance Database Systems. Commun. ACM 35, 6 (June 1992), 85--98.

Digital Library

[5]

Facebook. 2012. Facebook Graph Benchmark. https://github.com/facebookarchive/linkbench.

[6]

Facebook. 2020. RocksDB. https://github.com/facebook/rocksdb.

[7]

Zsolt István, David Sidler, and Gustavo Alonso. 2017. Caribou: Intelligent Distributed Storage. In Proc. VLDB 2017.

Digital Library

[8]

Insoon Jo, Duck-ho Bae, and et al. 2016. YourSQL: A High-Performance Database System Leveraging In-Storage Computing. In Proc. VLDB.

[9]

Sungchan Kim, Hyunok Oh, Chanik Park, Sangyeun Cho, Sang-Won Lee, and Bongki Moon. 2016. In-storage processing of database scans and joins. Inf. Sci. (Ny). 327 (jan 2016), 183--200.

[10]

Gunjae Koo, Kiran Kumar Matam, Te I, H. V. Krishna Giri Narra, Jing Li, Hung-Wei Tseng, Steven Swanson, and Murali Annavaram. 2017. Summarizer: Trading Communication with Computing NearStorage. In Proc. MICRO-50 '17. 219--231.

[11]

Yoshinori Matsunobu, Siying Dong, and Herman Lee. 2020. MyRocks: LSM-Tree Database Storage Engine Serving Facebook's Social Graph. Proc. VLDB Endow. 13, 12 (Aug. 2020), 3217--3230.

Digital Library

[12]

Sang-woo Jun Ming, Arvind, and et al. 2015. BlueDBM: An Appliance for Big Data Analytics. Proc. ISCA (2015).

[13]

OpenSSD Project 2021. COSMOS Project Documentation. OpenSSD Project. http://www.openssd-project.org/wiki/Cosmos_OpenSSD_Technical_Resources.

[14]

Erik Riedel, Christos Faloutsos, Garth A. Gibson, and David Nagle. 2001. Active disks for large-scale data processing. Computer. 34, 6 (2001), 68--74.

Digital Library

[15]

Tobias Vincon, Lukas Weber, Arthur Bernhardt, Andreas Koch, and Ilia Petrov. 2020. nKV: Near-Data Processing with KV-Stores on Native Comp. Storage. In Proc. DaMoN 2020.

[16]

Louis Woods, Zsolt István, and Gustavo Alonso. 2014. Ibex: An Intelligent Storage Engine with Support for Advanced SQL Offloading. Proc. VLDB (2014).

Digital Library

Cited By

Vinçon TKnödler CSolis-Vasquez LBernhardt ATamimi SWeber LStock FKoch APetrov I(2022)Near-data processing in database systems on native computational storage under HTAP workloadsProceedings of the VLDB Endowment10.14778/3547305.354730715:10(1991-2004)Online publication date: 1-Jun-2022
https://dl.acm.org/doi/10.14778/3547305.3547307

Recommendations

A storage computing architecture with multiple NDP devices for accelerating compaction performance in LSM-tree based KV stores
Abstract
In the era of big data, log-structured merge-tree (LSM-tree) based key–value stores (KV stores) have become an effective alternative to the traditional relational database owing to their high performance and scalability. KV stores are ...
FlatLSM: Write-Optimized LSM-Tree for PM-Based KV Stores
The Log-Structured Merge Tree (LSM-Tree) is widely used in key-value (KV) stores because of its excwrite performance. But LSM-Tree-based KV stores still have the overhead of write-ahead log and write stall caused by slow L₀ flush and L₀-L₁ compaction. New ...
Leveraging NVMe SSDs for Building a Fast, Cost-effective, LSM-tree-based KV Store
Key-value (KV) stores support many crucial applications and services. They perform fast in-memory processing but are still often limited by I/O performance. The recent emergence of high-speed commodity non-volatile memory express solid-state drives (NVMe ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

DAMON '21: Proceedings of the 17th International Workshop on Data Management on New Hardware

June 2021

104 pages

ISBN:9781450385565

DOI:10.1145/3465998

Copyright © 2021 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 June 2021

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article
Research
Refereed limited

Funding Sources

BMBF
DFG

Conference

SIGMOD/PODS '21

Sponsor:

SIGMOD

SIGMOD/PODS '21: International Conference on Management of Data

June 20, 2021

Virtual Event, China

Acceptance Rates

DAMON '21 Paper Acceptance Rate 15 of 17 submissions, 88%;

Overall Acceptance Rate 94 of 127 submissions, 74%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
183
Total Downloads

Downloads (Last 12 months)15
Downloads (Last 6 weeks)3

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Vinçon TKnödler CSolis-Vasquez LBernhardt ATamimi SWeber LStock FKoch APetrov I(2022)Near-data processing in database systems on native computational storage under HTAP workloadsProceedings of the VLDB Endowment10.14778/3547305.354730715:10(1991-2004)Online publication date: 1-Jun-2022
https://dl.acm.org/doi/10.14778/3547305.3547307

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents