With its strong coverage, low energy consumption, low cost and great connectivity, the
Internet of Things technology has become the key technology in smart cities. However, faced …

RDF knowledge graphs have attracted increasing attentions these years. However, due to
the schema-free nature of RDF data, it is very difficult for users to have full knowledge of the …

We consider in this paper the similarity search problem that retrieves relevant graphs from a
graph database under the well-known graph edit distance (GED) constraint. Formally, given …

In this work, we propose a new approach to detect anomalous graphs in a stream of directed
and labeled heterogeneous edges. The stream consists of a sequence of edges derived …

Since many graph data are often noisy and incomplete in real applications, it has become
increasingly important to retrieve graphs g in the graph database D that approximately …

A challenging task in the natural language question answering (Q/A for short) over RDF
knowledge graph is how to bridge the gap between unstructured natural language …

Graph similarity is a basic and essential operation in many applications. In this paper, we
are interested in computing graph similarity based on edit distance. Existing graph edit …

Graphs are widely used to model complicated data semantics in many applications in
bioinformatics, chemistry, social networks, pattern recognition, etc. A recent trend is to …

Due to many real applications of graph databases, it has become increasingly important to
retrieve graphs g (in graph database D) that approximately match with query graph q, rather …

State-of-the-art database systems manage and process a variety of complex objects,
including strings and trees. For such objects equality comparisons are often not meaningful …