C. Bizer and A. Schultz, The Berlin SPARQL Benchmark, Int. J. Semantic Web Inf. Syst, vol.5, issue.2, 2009.

S. Campinas, R. Delbru, and G. Tummarello, Efficiency and precision trade-offs in graph summary algorithms, IDEAS, 2013.

M. P. Consens, V. Fionda, S. Khatchadourian, and G. Pirrò, S+EPPs: Construct and explore bisimulation summaries + optimize navigational queries; all on existing SPARQL systems (demonstration), vol.8, 2015.

F. ?ejla?ebiri´c?ejla??ejla?ebiri´?ejla?ebiri´c, P. Goasdoué, I. Guzewicz, and . Manolescu, Compact Summaries of Rich Heterogeneous Graphs, Sejla Cebiric, François Goasdoué, Haridimos Kondylakis, Dimitris Kotzinos, Ioana Manolescu, Georgia Troullinou, and Mussab Zneika. Summarizing Semantic Graphs: A Survey. The VLDB Journal, 2018.

F. ?ejla?ebiri´c?ejla??ejla?ebiri´?ejla?ebiri´c, I. Goasdoué, and . Manolescu, Query-oriented summarization of RDF graphs, BICOD, 2015.

F. ?ejla?ebiri´c?ejla??ejla?ebiri´?ejla?ebiri´c, I. Goasdoué, and . Manolescu, Query-oriented summarization of RDF graphs (demonstration), vol.8, 2015.

F. ?ejla?ebiri´c?ejla??ejla?ebiri´?ejla?ebiri´c, I. Goasdoué, and . Manolescu, A framework for efficient representative summarization of RDF graphs, ISWC (poster), 2017.

Q. Chen, A. Lim, and K. Ong, D(K )-index: An adaptive structural summary for graph-structured data, SIGMOD, 2003.

M. P. Consens, R. J. Miller, F. Rizzolo, and A. A. Vaisman, Exploring XML web collections with DescribeX. TWEB, vol.4, issue.3, 2010.

F. Goasdoué, P. Guzewicz, and I. Manolescu, Incremental structural summarization of RDF graphs (demo), EDBT 2019, 2019.

P. Guzewicz and I. Manolescu, Quotient RDF Summaries Based on Type Hierarchies, DESWeb (Data Engineering meets the Semantic Web) Workshop, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01721163

A. Gubichev and T. Neumann, Exploiting the query structure for efficient join ordering in SPARQL queries, EDBT, 2014.

R. Goldman and J. Widom, Dataguides: Enabling query formulation and optimization in semistructured databases, VLDB, 1997.

M. R. Henzinger, T. A. Henzinger, and P. W. Kopke, Computing simulations on finite and infinite graphs, FOCS, 1995.

R. Kaushik, P. Bohannon, J. F. Naughton, and H. F. Korth, Covering indexes for branching path queries, SIGMOD, 2002.

S. Khatchadourian and M. P. Consens, Constructing bisimulation summaries on a multi-core graph processing framework, GRADES, 2015.

T. Milo and D. Suciu, Index structures for path expressions, ICDT, 1999.

T. Neumann and G. Moerkotte, Characteristic sets: Accurate cardinality estimation for RDF queries with multiple joins, ICDE, 2011.

A. Schätzle, A. Neu, G. Lausen, and M. Przyjacielzablocki, Large-scale bisimulation of RDF graphs, SWIM, 2013.

T. Tran, G. Ladwig, and S. Rudolph, Managing structured and semistructured RDF data using structure indexes, IEEE TKDE, vol.25, issue.9, 2013.