{"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.