Selective caching: a persistent memory approach for multi-dimensional index structures

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Distributed and Parallel Databases Pub Date : 2020-04-01 DOI:10.1109/ICDEW49219.2020.00010
M. Jibril, Philipp Götze, David Broneske, K. Sattler
{"title":"Selective caching: a persistent memory approach for multi-dimensional index structures","authors":"M. Jibril, Philipp Götze, David Broneske, K. Sattler","doi":"10.1109/ICDEW49219.2020.00010","DOIUrl":null,"url":null,"abstract":"After the introduction of Persistent Memory in the form of Intel’s Optane DC Persistent Memory on the market in 2019, it has found its way into manifold applications and systems. As Google and other cloud infrastructure providers are starting to incorporate Persistent Memory into their portfolio, it is only logical that cloud applications have to exploit its inherent properties. Persistent Memory can serve as a DRAM substitute, but guarantees persistence at the cost of compromised read/write performance compared to standard DRAM. These properties particularly affect the performance of index structures, since they are subject to frequent updates and queries. However, adapting each and every index structure to exploit the properties of Persistent Memory is tedious. Hence, we require a general technique that hides this access gap, e.g., by using DRAM caching strategies. To exploit Persistent Memory properties for analytical index structures, we propose selective caching . It is based on a mixture of dynamic and static caching of tree nodes in DRAM to reach near-DRAM access speeds for index structures. In this paper, we evaluate selective caching on the OLAP-optimized main-memory index structure Elf, because its memory layout allows for an easy caching. Our experiments show that if configured well, selective caching with a suitable replacement strategy can keep pace with pure DRAM storage of Elf while guaranteeing persistence. These results are also reflected when selective caching is used for parallel workloads.","PeriodicalId":50568,"journal":{"name":"Distributed and Parallel Databases","volume":"40 1","pages":"47-66"},"PeriodicalIF":1.5000,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/ICDEW49219.2020.00010","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Distributed and Parallel Databases","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1109/ICDEW49219.2020.00010","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 3

Abstract

After the introduction of Persistent Memory in the form of Intel’s Optane DC Persistent Memory on the market in 2019, it has found its way into manifold applications and systems. As Google and other cloud infrastructure providers are starting to incorporate Persistent Memory into their portfolio, it is only logical that cloud applications have to exploit its inherent properties. Persistent Memory can serve as a DRAM substitute, but guarantees persistence at the cost of compromised read/write performance compared to standard DRAM. These properties particularly affect the performance of index structures, since they are subject to frequent updates and queries. However, adapting each and every index structure to exploit the properties of Persistent Memory is tedious. Hence, we require a general technique that hides this access gap, e.g., by using DRAM caching strategies. To exploit Persistent Memory properties for analytical index structures, we propose selective caching . It is based on a mixture of dynamic and static caching of tree nodes in DRAM to reach near-DRAM access speeds for index structures. In this paper, we evaluate selective caching on the OLAP-optimized main-memory index structure Elf, because its memory layout allows for an easy caching. Our experiments show that if configured well, selective caching with a suitable replacement strategy can keep pace with pure DRAM storage of Elf while guaranteeing persistence. These results are also reflected when selective caching is used for parallel workloads.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
选择性缓存:用于多维索引结构的持久内存方法
在2019年以英特尔Optane DC Persistent Memory的形式在市场上推出Persistent Memory之后,它已经进入了多种应用和系统。随着b谷歌和其他云基础设施提供商开始将持久性内存整合到他们的产品组合中,云应用程序必须利用其固有属性是合乎逻辑的。持久性内存可以作为DRAM的替代品,但与标准DRAM相比,它以牺牲读/写性能为代价来保证持久性。这些属性特别影响索引结构的性能,因为它们受到频繁更新和查询的影响。然而,调整每个索引结构来利用持久性内存的属性是很繁琐的。因此,我们需要一种通用的技术来隐藏这种访问间隙,例如,通过使用DRAM缓存策略。为了利用分析索引结构的持久内存属性,我们提出了选择性缓存。它基于DRAM中树节点的动态和静态缓存的混合,以达到接近DRAM的索引结构访问速度。在本文中,我们评估了olap优化的主内存索引结构Elf上的选择性缓存,因为它的内存布局允许简单的缓存。我们的实验表明,如果配置得当,具有合适替换策略的选择性缓存可以与Elf的纯DRAM存储保持同步,同时保证持久性。当对并行工作负载使用选择性缓存时,也会反映出这些结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Distributed and Parallel Databases
Distributed and Parallel Databases 工程技术-计算机:理论方法
CiteScore
3.50
自引率
0.00%
发文量
17
审稿时长
>12 weeks
期刊介绍: Distributed and Parallel Databases publishes papers in all the traditional as well as most emerging areas of database research, including: Availability and reliability; Benchmarking and performance evaluation, and tuning; Big Data Storage and Processing; Cloud Computing and Database-as-a-Service; Crowdsourcing; Data curation, annotation and provenance; Data integration, metadata Management, and interoperability; Data models, semantics, query languages; Data mining and knowledge discovery; Data privacy, security, trust; Data provenance, workflows, Scientific Data Management; Data visualization and interactive data exploration; Data warehousing, OLAP, Analytics; Graph data management, RDF, social networks; Information Extraction and Data Cleaning; Middleware and Workflow Management; Modern Hardware and In-Memory Database Systems; Query Processing and Optimization; Semantic Web and open data; Social Networks; Storage, indexing, and physical database design; Streams, sensor networks, and complex event processing; Strings, Texts, and Keyword Search; Spatial, temporal, and spatio-temporal databases; Transaction processing; Uncertain, probabilistic, and approximate databases.
期刊最新文献
zk-Oracle: trusted off-chain compute and storage for decentralized applications Parallel continuous skyline query over high-dimensional data stream windows A blockchain datastore for scalable IoT workloads using data decaying Flexible fingerprint cuckoo filter for information retrieval optimization in distributed network Federated computation: a survey of concepts and challenges
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1