A succinct data structure for self-indexing ternary relations
Use this link to citehttp://hdl.handle.net/2183/18148
Except where otherwise noted, this item's license is described as Atribución-NoComercial-SinDerivadas 3.0 España
MetadataShow full item record
TitleA succinct data structure for self-indexing ternary relations
Sandra 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.
[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 , 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.
Compressed data structures
The final publication is available via http://dx.doi.org/10.1016/j.jda.2016.10.002
Atribución-NoComercial-SinDerivadas 3.0 España