A succinct data structure for self-indexing ternary relations (Q2397150): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Succinct representation of labeled graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Compact binary relation representations with rich functionality / rank | |||
Normal rank | |||
Revision as of 21:06, 13 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A succinct data structure for self-indexing ternary relations |
scientific article |
Statements
A succinct data structure for self-indexing ternary relations (English)
0 references
29 May 2017
0 references
compressed data structures
0 references
ternary relations
0 references
RDF
0 references
temporal graphs
0 references
\(K^2\)-tree
0 references
