Show simple item record

dc.contributor.authorÁlvarez García, Sandra
dc.contributor.authorBernardo, Guillermo de
dc.contributor.authorBrisaboa, Nieves R.
dc.contributor.authorNavarro, Gonzalo
dc.date.accessioned2017-02-20T18:31:46Z
dc.date.issued2016-10-27
dc.identifier.citationSandra Alvarez-Garcia, Guillermo de Bernardo, Nieves R. Brisaboa, Gonzalo Navarro A succint data structure for self-indexing ternary relations. To appear in Journal of Discrete Algorithms (2016). DOI: 10.1016/j.jda.2016.10.002.es_ES
dc.identifier.issn1570-8667
dc.identifier.issn1468-0904
dc.identifier.urihttp://hdl.handle.net/2183/18148
dc.descriptionThe final publication is available via http://dx.doi.org/10.1016/j.jda.2016.10.002es_ES
dc.description.abstract[Abstract] The representation of binary relations has been intensively studied and many different theoretical and practical representations have been proposed to answer the usual queries in multiple domains. However, ternary relations have not received as much attention, even though many real-world applications require the processing of ternary relations. In this paper we present a new compressed and self-indexed data structure that we call Interleaved K2-tree (IK2-tree), designed to compactly represent and efficiently query general ternary relations. The IK2-tree is an evolution of an existing data structure, the K2-tree [6], initially designed to represent Web graphs and later applied to other domains. The IK2-tree is able to extend the K2-tree to represent a ternary relation, based on the idea of decomposing it into a collection of binary relations but providing indexing capabilities in all the three dimensions. We present different ways to use IK2-tree to model different types of ternary relations using as reference two typical domains: RDF and Temporal Graphs. We also experimentally evaluate our representations comparing them in space usage and performance with other solutions of the state of the art.es_ES
dc.description.sponsorshipMinisterio de Economía y Competitividad; TIN2013-46238-C4-3-Res_ES
dc.description.sponsorshipXunta de Galicia; GRC2013/053es_ES
dc.description.sponsorshipChile. Núcleo Milenio Información y Coordinación en Redes; ICM/FIC RC130003es_ES
dc.description.sponsorshipChile.Fondo Nacional de Desarrollo Científico y Tecnológico; 1-140796es_ES
dc.language.isoenges_ES
dc.publisherElsevier BVes_ES
dc.relationinfo:eu-repo/grantAgreement/EU/H2020/690941es_ES
dc.relation.urihttp://dx.doi.org/10.1016/j.jda.2016.10.002es_ES
dc.rightsAtribución-NoComercial-SinDerivadas 3.0 Españaes_ES
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/*
dc.subjectCompressed data structureses_ES
dc.subjectTernary relationses_ES
dc.subjectRDFes_ES
dc.subjectTemporal graphses_ES
dc.subjectK2-treees_ES
dc.titleA succinct data structure for self-indexing ternary relationses_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.rights.accessinfo:eu-repo/semantics/embargoedAccesses_ES
dc.date.embargoEndDate2018-10-27es_ES
dc.date.embargoLift2018-10-27
UDC.journalTitleJournal of Discrete Algorithmses_ES
dc.identifier.doi10.1016/j.jda.2016.10.002


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record