Due to its simplicity, efficiency, and efficacy, naive Bayes (NB) has continued to be one of the
top 10 algorithms in the data mining and machine learning community. Of numerous …

The recent adoption of blockchain technologies and open permissionless networks suggest
the importance of peer-to-peer atomic cross-chain transaction protocols. Users should be …

Purpose–The purpose of this paper is to provide a detailed discussion for different types of
graph queries and a different mechanism for indexing and querying graph databases …

In many applications, information is best represented as graphs. In a dynamic world,
information changes and so the graphs representing the information evolve with time. We …

Graphs are commonly used for representing complex structures such as social relationships,
biological interactions, and knowledge bases. In many scenarios, graphs not only represent …

Querying similar graphs in graph databases has been widely studied in graph query
processing in recent years. Existing works mainly focus on subgraph similarity search and …

Supergraph search is a fundamental graph query processing problem. Supergraph search
aims to find all data graphs contained in a given query graph based on the subgraph …

We propose a SPARQL-like language, G-SPARQL, for querying attributed graphs. The
language expresses types of queries which of large interest for applications which model …

Given a query graph q and a data graph G, computing all occurrences of q in G, namely
exact all-matching, is fundamental in graph data analysis with a wide spectrum of real …

Subgraph/supergraph queries although central to graph an-alytics, are costly as they entail
the NP-Complete problem of subgraph isomorphism. We present a fresh solution, the novel …