Mostrar o rexistro simple do ítem
Revisiting Compact RDF Stores Based on k2-Trees
dc.contributor.author | Brisaboa, Nieves R. | |
dc.contributor.author | Cerdeira-Pena, Ana | |
dc.contributor.author | Bernardo, Guillermo de | |
dc.contributor.author | Fariña, Antonio | |
dc.date.accessioned | 2023-12-20T10:35:03Z | |
dc.date.available | 2023-12-20T10:35:03Z | |
dc.date.issued | 2020-03 | |
dc.identifier.citation | N. R. Brisaboa, A. Cerdeira-Pena, G. De Bernardo, y A. Fariña, «Revisiting Compact RDF Stores Based on k2-Trees», en 2020 Data Compression Conference (DCC), mar. 2020, pp. 123-132. doi: 10.1109/DCC47342.2020.00020. | es_ES |
dc.identifier.issn | 2375-0359 | |
dc.identifier.uri | http://hdl.handle.net/2183/34574 | |
dc.description | Presented at the 2020 Data Compression Conference (DCC), Snowbird, UT, USA, 24-27 March 2020 | es_ES |
dc.description | © 2020 IEEE. This version of the paper has been accepted for publication. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The final published paper is available online at: https: https://doi.org/10.1109/DCC47342.2020.00020 | es_ES |
dc.description.abstract | [Abstract]: We present a new compact representation to efficiently store and query large RDF datasets in main memory. Our proposal, called BMatrix, is based on the k 2 -tree, a data structure devised to represent binary matrices in a compressed way, and aims at improving the results of previous state-of-the-art alternatives, especially in datasets with a relatively large number of predicates. We introduce our technique, together with some improvements on the basic k 2 -tree that can be applied to our solution in order to boost compression. Experimental results in the flagship RDF dataset DBPedia show that our proposal achieves better compression than existing alternatives, while yielding competitive query times, particularly in the most frequent triple patterns and in queries with unbound predicate, in which we outperform existing solutions | es_ES |
dc.description.sponsorship | Funded by: MICINN-AEI/FEDER-UE RTI2018-098309-B-C32, Xunta de Galicia/GAIN IN848D-2017-2350417; MICINN-AEI/FEDER-UE RTC-2017-5908-7; Xunta de Galicia/FEDER-UE ED431C 2017/58, ED431G/01, IN852A 2018/14; MINECO-AEI/FEDER-UE TIN2016-78011-C4-1- R, TIN2016-77158-C4-3-R, TIN2015-69951-R; EU H2020 MSCA RISE BIRDS: 690941 | es_ES |
dc.description.sponsorship | Xunta de Galicia; IN848D-2017-2350417 | es_ES |
dc.description.sponsorship | Xunta de Galicia; ED431C 2017/58 | es_ES |
dc.description.sponsorship | Xunta de Galicia; ED431G/01 | es_ES |
dc.description.sponsorship | Xunta de Galicia; IN852A 2018/14 | es_ES |
dc.language.iso | eng | es_ES |
dc.publisher | IEEE Xplore | es_ES |
dc.relation | info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/RTI2018-098309-B-C32/ES/BIZDEVOPS-GLOBAL: UN FRAMEWORK TECNOLOGICO Y METODOLOGICO SOSTENIBLE PARA EL DESARROLLO DE SOFTWARE ALINEADO CON EL NEGOCIO EN DEVOPS GLOBAL | es_ES |
dc.relation | info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/RTC-2017-5908-7/ES/STEPS. SOLUCIONES TECNOLÓGICAS PARA LA EVOLUCIÓN EN LA PRESTACIÓN DE SERVICIOS EN CAMPO | es_ES |
dc.relation | info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2013-2016/TIN2016-78011-C4-1-R/ES/DATOS 4.0: RETOS Y SOLUCIONES-UDC | es_ES |
dc.relation | info:eu-repo/grantAgreement/MINECO/Plan Estatal de Investigación Científica y Técnica y de Innovación 2013-2016/TIN2016-77158-C4-3-R/ES/VELOCITY: PROCESADO EFICIENTE DE BIG DATA ESPAZO-TEMPORAL PARA FLATCITY | es_ES |
dc.relation | info:eu-repo/grantAgreement/MINECO/Plan Estatal de Investigación Científica y Técnica y de Innovación 2013-2016/TIN2015-69951-R/ES/ETIQUETADO DE TRAYECTORIAS DE OBJETOS MOVILES PARA SU EXPLOTACION EFICIENTE EN RDF DATA CUBE COMPRIMIDO | es_ES |
dc.relation | eu-repo/grantAgreement/EC/H2020/690941 | es_ES |
dc.relation.uri | https://doi.org/10.1109/DCC47342.2020.00020 | es_ES |
dc.subject | RDF | es_ES |
dc.subject | Compact data structures | es_ES |
dc.subject | K2 trees | es_ES |
dc.title | Revisiting Compact RDF Stores Based on k2-Trees | es_ES |
dc.type | info:eu-repo/semantics/conferenceObject | es_ES |
dc.type | info:eu-repo/semantics/conferenceObject | es_ES |
dc.rights.access | info:eu-repo/semantics/openAccess | es_ES |
UDC.conferenceTitle | 2020 Data Compression Conference (DCC) | es_ES |