TripleID-C: Low Cost Compressed Representation for RDF Query Processing in GPUs

C. Phongpensri, Pisit Makpaisit
{"title":"TripleID-C: Low Cost Compressed Representation for RDF Query Processing in GPUs","authors":"C. Phongpensri, Pisit Makpaisit","doi":"10.1145/3149457.3155322","DOIUrl":null,"url":null,"abstract":"Resource Description Framework (RDF) is a standard format for representing information linkage around the Internet. It uses Internationalized Resources Identifier (IRI) which refers to an external information. Typically, an RDF data is serialized as a large text file which contains millions of relationships. This paper proposes a compact representation for a query processing, called TripleID-C, for large RDF data processing in Graphic Processing Units (GPU). The representation is based on TripleID which is converted from RDF data format. Then TripleID format is converted to TripleID-C which is derived from either compressed rows or compressed column format. TripleID-C is a compressed format whose size is only 5-10% of the traditional NT file, and is about 20-30% of the traditonal TripleID and is about 50-60% of original HDT. We also address how to speedup the conversion process by adjusting data structure usages and using multithreads, where the conversion process can run faster by 30 times compared to the original one.","PeriodicalId":314778,"journal":{"name":"Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3149457.3155322","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Resource Description Framework (RDF) is a standard format for representing information linkage around the Internet. It uses Internationalized Resources Identifier (IRI) which refers to an external information. Typically, an RDF data is serialized as a large text file which contains millions of relationships. This paper proposes a compact representation for a query processing, called TripleID-C, for large RDF data processing in Graphic Processing Units (GPU). The representation is based on TripleID which is converted from RDF data format. Then TripleID format is converted to TripleID-C which is derived from either compressed rows or compressed column format. TripleID-C is a compressed format whose size is only 5-10% of the traditional NT file, and is about 20-30% of the traditonal TripleID and is about 50-60% of original HDT. We also address how to speedup the conversion process by adjusting data structure usages and using multithreads, where the conversion process can run faster by 30 times compared to the original one.
TripleID-C: gpu中RDF查询处理的低成本压缩表示
资源描述框架(RDF)是表示Internet上信息链接的标准格式。它使用引用外部信息的国际化资源标识符(IRI)。通常,RDF数据被序列化为包含数百万个关系的大型文本文件。本文提出了一种用于图形处理单元(GPU)中大型RDF数据处理的查询处理的紧凑表示,称为TripleID-C。这种表示基于TripleID,它是从RDF数据格式转换而来的。然后将TripleID格式转换为TripleID- c,后者派生自压缩的行或压缩的列格式。TripleID- c是一种压缩格式,其大小仅为传统NT文件的5-10%,约为传统TripleID文件的20-30%,约为原始HDT文件的50-60%。我们还讨论了如何通过调整数据结构使用和使用多线程来加速转换过程,其中转换过程的运行速度比原始转换过程快30倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信