A succinct data structure for self-indexing ternary relations

Abadi, 2007, Scalable semantic web data management using vertical partitioning, 411

Álvarez-García, 2011, Compressed k2-triples for full-in-memory RDF engines

Barbay, 2012, Succinct representation of labeled graphs, Algorithmica, 62, 224, 10.1007/s00453-010-9452-7

Barbay, 2013, Compact binary relation representations with rich functionality, Inf. Comput., 232, 19, 10.1016/j.ic.2013.10.003

Brisaboa, 2012, Compressed dynamic binary relations, 52

Brisaboa, 2009, K2-trees for compact Web graph representation, 18

Brisaboa, 2013, DACs: bringing direct access to variable-length codes, Inf. Process. Manag., 49, 392, 10.1016/j.ipm.2012.08.003

Claude, 2010, Fast and compact web graph representations, ACM Trans. Web, 4, 16, 10.1145/1841909.1841913

de Bernardo, 2013, Compact querieable representations of raster data, 96

de Bernardo, 2013, Compact data structures for temporal graphs

Manola

Munro, 1996, Tables, 37

Navarro, 2016

Neumann, 2010, The RDF-3X engine for scalable management of RDF data, VLDB J., 19, 91, 10.1007/s00778-009-0165-y

Prud'hommeaux

Ritter, 1997, The GeoTiff data interchange standard for raster geographic images, Int. J. Remote Sens., 18, 1637, 10.1080/014311697218340

Sakr, 2010, Relational processing of RDF queries: a survey, SIGMOD Rec., 38, 23, 10.1145/1815948.1815953

Weiss, 2008, Hexastore: sextuple indexing for semantic web data management, Proc. VLDB Endow., 1, 1008, 10.14778/1453856.1453965