Filters








603 Hits in 5.7 sec

A Compact In-Memory Dictionary for RDF Data [chapter]

Hamid R. Bazoobandi, Steven de Rooij, Jacopo Urbani, Annette ten Teije, Frank van Harmelen, Henri Bal
2015 Lecture Notes in Computer Science  
While almost all dictionary compression techniques focus on static RDF data, we present a compact in-memory RDF dictionary for dynamic and streaming data.  ...  In our approach, we address the existing limitations of Tries for RDF data, and propose a new variant of Trie which contains some optimizations explicitly designed to improve the performance on RDF data  ...  RDFVault: An In-Memory Dictionary Optimized for RDF Data In the previous section we analyzed the existing Trie variants and showed why none of them is ideal for RDF.  ... 
doi:10.1007/978-3-319-18818-8_13 fatcat:ieh53rfpcvgyjoac6yiii2w4tu

Lightweighting the Web of Data through Compact RDF/HDT [chapter]

Javier D. Fernández, Miguel A. Martínez-Prieto, Mario Arias, Claudio Gutierrez, Sandra Álvarez-García, Nieves R. Brisaboa
2011 Lecture Notes in Computer Science  
The HDT format addresses these problems through a compact RDF representation, that partitions and efficiently represents three components: Header (metadata), Dictionary (strings occurring in the dataset  ...  This paper revisits the format and exploits the latest findings in triples indexing for querying, exchanging and visualizing RDF information at large scale. 4 http://www.w3.org/TR/REC-rdf-syntax/ 5  ...  The format RDF/HDT (Header-Dictionary-Triples) arises as a compact alternative to the plain formats for serializing RDF in the current Web of Data, moving forward to a data-centric scheme.  ... 
doi:10.1007/978-3-642-25274-7_49 fatcat:7lsyo6wimjddpkqjmxpihbjkmm

Compact Representation of Large RDF Data Sets for Publishing and Exchange [chapter]

Javier D. Fernández, Miguel A. Martínez-Prieto, Claudio Gutierrez
2010 Lecture Notes in Computer Science  
Experiments show that data sets can be compacted in HDT by more than fifteen times the current naive representation, improving parsing and processing while keeping a consistent publication scheme.  ...  This paper presents a novel RDF representation (HDT) which takes advantage of the structural properties of RDF graphs for splitting and representing, efficiently, three components of RDF data: Header,  ...  Compacting RDF with HDT: Practical Aspects HDT allows RDF data sets to be represented in a compact form, with no restriction on how it should be implemented.  ... 
doi:10.1007/978-3-642-17746-0_13 fatcat:4udastz765er7f5pk7sniacqfy

Efficient Dictionary Compression for Processing RDF Big Data Using Google BigQuery

Omer Dawelbeit, Rachel McCrindle
2016 2016 IEEE Global Communications Conference (GLOBECOM)  
In this paper we present and evaluate a novel and efficient dictionary compression algorithm which is faster, generates small dictionaries that can fit in memory and results in better compression rate  ...  The Resource Description Framework (RDF) data model, is used on the Web to express billions of structured statements in a wide range of topics, including government, publications, life sciences, etc.  ...  ACKNOWLEDGMENT We would like to thank Google Inc. for providing us with credits to run experiments on the Google Cloud Platform.  ... 
doi:10.1109/glocom.2016.7841775 dblp:conf/globecom/DawelbeitM16 fatcat:hwpucy72xfbgve4jartsnoihle

Compressed k2-Triples for Full-In-Memory RDF Engines [article]

Sandra Álvarez-García and Nieves R. Brisaboa and Javier D. Fernández and Miguel A. Martínez-Prieto
2011 arXiv   pre-print
Although this is a realistic philosophy for global data publishing, its query performance is diminished when the RDF engines (behind the endpoints) manage these huge datasets.  ...  This paper addresses this problem by a compact indexed RDF structure (called k2-triples) applying compact k2-tree structures to the well-known vertical-partitioning technique.  ...  RDF is a cornerstone in this Web of Data providing a graph-based data model for structuring and linking data which describes facts of the world (Bizer, Heath and Berners-Lee, 2009 ).  ... 
arXiv:1105.4004v1 fatcat:7cdxkxnakrfvnoq557odzlrhmy

Large RDF representation framework for GPUs case study key-value storage and binary triple pattern

Chidchanok Choksuchat, Chantana Chantrapornchai
2013 2013 International Computer Science and Engineering Conference (ICSEC)  
In this paper, we present the experimental framework which operates the search of RDF data in GPUs. We explore the use of triple storages for query processing in GPUs.  ...  The triple search space is large and impossible to load into GPU memory to perform the parallel search. Proper representations are studied to storage data in GPUs for an effective search.  ...  We compare to the other compression method as HDT that is another compacted format for RDF exchanging.  ... 
doi:10.1109/icsec.2013.6694745 fatcat:7in3rkicpbekdllbpi4n5fzjuy

A Comparison of Data Structures to Manage URIs on the Web of Data [chapter]

Ruslan Mavlyutov, Marcin Wylot, Philippe Cudre-Mauroux
2015 Lecture Notes in Computer Science  
We evaluate a series of data structures in term of their read/write performance and memory consumption.  ...  Uniform Resource Identifiers (URIs) are one of the corner stones of the Web; They are also exceedingly important on the Web of data, since RDF graphs and Linked Data both heavily rely on URIs to uniquely  ...  Acknowledgement This work was funded in part by the Swiss National Science Foundation under grant numbers PP00P2 128459 and 200021 143649.  ... 
doi:10.1007/978-3-319-18818-8_9 fatcat:t5keacim25db3dfwkuusgus43m

Exchange and Consumption of Huge RDF Data [chapter]

Miguel A. Martínez-Prieto, Mario Arias Gallego, Javier D. Fernández
2012 Lecture Notes in Computer Science  
A first approach to lightweight data exchange is a compact (binary) RDF serialization format called HDT.  ...  This results in a painful task requiring a great effort in terms of time and computational resources.  ...  We particularly wish to thank Claudio Gutierrez, for his continued motivation and selfless help, and the Database Lab (Univ. of A Coruña) for lending us the servers for our experiments.  ... 
doi:10.1007/978-3-642-30284-8_36 fatcat:tyhk622z4re2hmvf33ilutewca

HDTCat: let's make HDT scale [article]

Dennis Diefenbach, Josée M. Giménez-García
2018 arXiv   pre-print
HDT (Header, Dictionary, Triples) is a serialization for RDF.  ...  HDT has become very popular in the last years because it allows to store RDF data with a small disk footprint, while remaining at the same time queriable.  ...  Acknowledgements: We would like to thank Pedro Migliatti for executing part of the experiments as well as Javier D. Fernández for the helpful discussions with him.  ... 
arXiv:1809.06859v1 fatcat:kmpvzknvunaujaxnlfo6ykgebq

Knowledge Graph Management on the Edge [article]

Weiqin Xu and Olivier Curé and Philippe Calvez
2020 arXiv   pre-print
In this paper, we present SuccinctEdge, a compact, decompression-free, self-index, in-memory RDF store that can answer SPARQL queries, including those requiring reasoning services associated to some ontology  ...  We consider that knowledge graph management systems have a key role to play in this context due to their data integration and reasoning features.  ...  RELATED WORK Header Dictionary Triples (HDT) 8 [6] is a compact data structure and binary serialization for RDF data.  ... 
arXiv:2012.07108v1 fatcat:5jt3xm5xg5ge5kbt36sxpuwxum

TripleBit

Pingpeng Yuan, Pu Liu, Buwen Wu, Hai Jin, Wenya Zhang, Ling Liu
2013 Proceedings of the VLDB Endowment  
In this paper, we present TripleBit, a fast and compact system for storing and accessing RDF data. The design of TripleBit has three salient features.  ...  A grant challenge of managing this huge RDF data is how to access this big RDF data efficiently.  ...  ACKNOWLEDGMENTS We would like to thank all reviewers for their valuable suggestions. The research is supported by National Science Foundation of China (61073096) and 863 Program (No.2012AA011003).  ... 
doi:10.14778/2536349.2536352 fatcat:2rbcj25a3jfivm4k7qd657m6ve

WaterFowl: A Compact, Self-indexed and Inference-Enabled Immutable RDF Store [chapter]

Olivier Curé, Guillaume Blin, Dominique Revuz, David Célestin Faye
2014 Lecture Notes in Computer Science  
In this paper we present WaterFowl, a novel approach for the storage of RDF triples that addresses scalability issues through compression.  ...  The architecture of our prototype, largely based on the use of succinct data structures, enables the representation of triples in a self-indexed, compact manner without requiring decompression at query  ...  Each database instance regroups a set of dictionaries and a dataset represented in a compact, self-indexed manner using some succinct data structures.  ... 
doi:10.1007/978-3-319-07443-6_21 fatcat:7pdrbaimtrbi3bng47fh23c4ce

Binary RDF representation for publication and exchange ( HDT )

Javier D. Fernández, Miguel A. Martínez-Prieto, Claudio Gutiérrez, Axel Polleres, Mario Arias
2013 Journal of Web Semantics  
of RDF datasets: Header information, a Dictionary, and the actual Triples structure (thus called HDT).  ...  This scenario calls for efficient formats for publication and exchange. This article presents a binary RDF representation addressing these issues.  ...  a compact RDF structure.  ... 
doi:10.1016/j.websem.2013.01.002 fatcat:ptgndc7nbngafcsgaqlfa55ami

RDF compression

Javier D. Fernández, Claudio Gutierrez, Miguel A. Martínez-Prieto
2010 Proceedings of the 19th international conference on World wide web - WWW '10  
We present basic approaches to compress RDF data and test them with three well-known, real-world RDF data sets.  ...  This paper studies the compressibility of RDF data sets.  ...  Compression appears as a natural choice for exchanging this type of data in order to achieve a better time/space tradeoff, or for storing it modularly, as data dictionary plus the graph itself.  ... 
doi:10.1145/1772690.1772819 dblp:conf/www/FernandezGM10 fatcat:iq3xisum5renjpmyvwf35jbfqe

Compression of RDF dictionaries

Miguel A. Martínez-Prieto, Javier D. Fernández, Rodrigo Cánovas
2012 Proceedings of the 27th Annual ACM Symposium on Applied Computing - SAC '12  
We propose a novel technique: Dcomp, which can be tuned to represent the dictionary in compressed space (22−64%) and to perform in a few microseconds (1−50µs).  ...  The use of dictionaries is a common practice among those applications performing on huge RDF datasets.  ...  We also thank to the Database Lab (Univ. of A Coruña, Spain) for lending us its servers for our experiments.  ... 
doi:10.1145/2245276.2245343 dblp:conf/sac/Martinez-PrietoFC12 fatcat:eh2oicovznel5pnvtvte3auy7m
« Previous Showing results 1 — 15 out of 603 results