A succinct data structure for self-indexing ternary relations (Q2397150): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jda.2016.10.002 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2540110816 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1707.02759 / rank | |||
Normal rank | |||
| 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 | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JDA.2016.10.002 / rank | |||
Normal rank | |||
Latest revision as of 09:34, 18 December 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
