A succinct data structure for self-indexing ternary relations

DOI10.1016/J.JDA.2016.10.002zbMath1407.68104arXiv1707.02759OpenAlexW2540110816MaRDI QIDQ2397150

Sandra Alvarez-Garcia, Nieves R. Brisaboa, Guillermo de Bernardo, Gonzalo Navarro

Publication date: 29 May 2017

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.02759

zbMATH Keywords

RDFcompressed data structurestemporal graphsternary relations\(K^2\)-tree

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)

Related Items (2)

A holistic approach to the composition of ternary relations ⋮ Faster dynamic compressed \(d\)-ary relations

Uses Software

• SPARQL

Cites Work

• Compact binary relation representations with rich functionality
• Succinct representation of labeled graphs

This page was built for publication: A succinct data structure for self-indexing ternary relations