GraphPage: RDF Graph in SSD Pages: Work-in-Progress

Guohua Yan, Renhai Chen, Zhiyong Feng
{"title":"GraphPage: RDF Graph in SSD Pages: Work-in-Progress","authors":"Guohua Yan, Renhai Chen, Zhiyong Feng","doi":"10.1109/CODESISSS51650.2020.9244042","DOIUrl":null,"url":null,"abstract":"SSD has been widely deployed in data centers to provide low access latency with high throughput for large-scale RDF storage system. When performing data query on SSDs, the RDF -based graph data may be sequentially read multiple times due to the semantic gap between the graph and SSD structures. In this paper, we propose a scheme called GraphPage to bridge the semantic gap between RDF graph and SSD. GraphPage partitions the RDF graph into small graphs and directly maps these small graphs into the flash pages. To achieve this, we first expose the internal page organization by redesigning an SSD. By exploring the page-level graph store, we can efficiently reduce the page access times inside SSDs, thus significantly enhancing the query efficiency. We conduct experiments on a real hardware platform. Extensive experiments on synthetic and real datasets show that the proposed strategy improves the performance of data query by more than two times.","PeriodicalId":437802,"journal":{"name":"2020 International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS)","volume":"244 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CODESISSS51650.2020.9244042","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

SSD has been widely deployed in data centers to provide low access latency with high throughput for large-scale RDF storage system. When performing data query on SSDs, the RDF -based graph data may be sequentially read multiple times due to the semantic gap between the graph and SSD structures. In this paper, we propose a scheme called GraphPage to bridge the semantic gap between RDF graph and SSD. GraphPage partitions the RDF graph into small graphs and directly maps these small graphs into the flash pages. To achieve this, we first expose the internal page organization by redesigning an SSD. By exploring the page-level graph store, we can efficiently reduce the page access times inside SSDs, thus significantly enhancing the query efficiency. We conduct experiments on a real hardware platform. Extensive experiments on synthetic and real datasets show that the proposed strategy improves the performance of data query by more than two times.
GraphPage: SSD页面中的RDF图:正在进行中
SSD已广泛应用于数据中心,为大规模RDF存储系统提供低访问延迟和高吞吐量。在SSD上执行数据查询时,由于图形和SSD结构之间的语义差距,基于RDF的图形数据可能被顺序读取多次。在本文中,我们提出了一个称为GraphPage的方案来弥合RDF图和SSD之间的语义鸿沟。GraphPage将RDF图划分为小图,并将这些小图直接映射到flash页面中。为了实现这一点,我们首先通过重新设计SSD来公开内部页面组织。通过探索页面级图存储,我们可以有效地减少ssd内的页面访问次数,从而显著提高查询效率。我们在一个真实的硬件平台上进行实验。在合成数据集和真实数据集上的大量实验表明,该策略将数据查询性能提高了两倍以上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信