Graph data modeling and querying arises in many practical application domains such as
social and biological networks where the primary focus is on concepts and their …

RDF datasets with billions of triples are no longer unusual and continue to grow constantly
(eg LOD cloud) driven by the inherent flexibility of RDF that allows to represent very diverse …

In many applications, it is convenient to substitute a large data graph with a smaller
homomorphic graph. This paper investigates approaches for summarising massive data …

We demonstrate S+ EPPs, a system that provides fast con-struction of bisimulation
summaries using graph analyticsplatforms, and then enhances existing SPARQL engines …

In this paper, we present, to our knowledge, the first known I/O efficient solutions for
computing the k-bisimulation partition of a massive directed graph, and performing …

Coupled similarity is a notion of equivalence for systems with internal actions. It has
outstanding applications in contexts where internal choices must transparently be distributed …

Querying large data graphs has brought the attention of the research community. Many
solutions were proposed, such as Oracle Semantic Technologies, Virtuoso, RDF3X, and C …

Simulation and its variants (eg, bisimulation and degree-preserving simulation) are useful in
a wide spectrum of applications. However, all simulation variants are coarse" yes-or-no" …

Bisimulation summaries of graph data have multiple applications, including facilitating graph
exploration and enabling query optimization techniques, but efficient, scalable, summary …

Bisimulation is a basic graph reduction operation, which plays a key role in a wide range of
graph analytical applications. While there are many algorithms dedicated to computing …