逻辑链接数据压缩Logical Linked Data Compression |
|
课程网址: | http://videolectures.net/eswc2013_joshi_data/ |
主讲教师: | Amit Krishna Joshi, Laura Hollink |
开课单位: | 莱特州立大学 |
开课时间: | 2013-07-08 |
课程语种: | 英语 |
中文简介: | 关联数据近年来经历了加速增长。随着结构化数据的不断增加,对RDF压缩的需求变得越来越重要。在本研究中,我们为RDF数据集引入了一种新的无损压缩技术,称为基于规则的压缩(RB压缩),它通过从数据集生成一组新的逻辑规则并删除可从这些规则推断出的三元组来压缩数据集。与其他压缩技术不同,我们的方法不仅利用语法冗长和数据冗余,还利用RDF图中存在的语义关联。根据数据集的性质,我们的系统能够在不影响数据完整性的情况下修剪超过原始三元组的50%。 |
课程简介: | Linked data has experienced accelerated growth in recent years. With the continuing proliferation of structured data, demand for RDF compression is becoming increasingly important. In this study, we introduce a novel lossless compression technique for RDF datasets, called Rule Based Compression (RB Compression) that compresses datasets by generating a set of new logical rules from the dataset and removing triples that can be inferred from these rules. Unlike other compression techniques, our approach not only takes advantage of syntactic verbosity and data redundancy but also utilizes semantic associations present in the RDF graph. Depending on the nature of the dataset, our system is able to prune more than 50% of the original triples without affecting data integrity. |
关 键 词: | 关联数据; 结构化数据; 无损压缩技术 |
课程来源: | 视频讲座网 |
最后编审: | 2019-04-14:lxf |
阅读次数: | 37 |