Existential blank nodes greatly complicate a number of fundamental operations on
Resource Description Framework (RDF) graphs. In particular, the problems of determining if …

In information retrieval, similarity measure or top-k similarity searching had been extensively
researched. Similarity search supports to find the most relevant information in a large-scale …

Nowadays, the increased amount and complexity of connected data stimulated by the
appearance of social networks has shed a new light on the importance of managing such …

Supervised and Unsupervised ML algorithms are widely used over graphs. They use the
structural properties of the data to deliver effective results. It is known that the same …

Graph similarity search algorithms usually leverage the structural properties of a database.
Hence, these algorithms are effective only on some structural variations of the data and are …

People structure and represent their data in many different ways. One factor to consider in
choosing between different representations is how the structure will affect the effectiveness …