Large language models (LLMs), such as ChatGPT and LLaMA, are creating significant
advancements in natural language processing, due to their strong text encoding/decoding …

The world is becoming a more conjunct place and the number of data sources such as
social networks, online transactions, web search engines, and mobile devices is increasing …

Cyber threat intelligence (CTI) is being used to search for indicators of attacks that might
have compromised an enterprise network for a long time without being discovered. To have …

In this paper, we study the problem of subgraph matching that extracts all subgraph
isomorphic embeddings of a query graph q in a large data graph G. The existing algorithms …

Subgraph matching (or subgraph isomorphism) is one of the fundamental problems in graph
analysis. Extensive research has been done to develop practical solutions for subgraph …

Given a query graph q and a data graph g, the subgraph isomorphism search finds all
occurrences of q in g and is considered one of the most fundamental query types for many …

We study the performance of eight representative in-memory subgraph matching algorithms.
Specifically, we put QuickSI, GraphQL, CFL, CECI, DP-iso, RI and VF2++ in a common …

Mining frequent subgraphs is an important operation on graphs; it is defined as finding all
subgraphs that appear frequently in a database according to a given frequency threshold …

Balanced graph partitioning in the streaming setting is a key problem to enable scalable and
efficient computations on massive graph data such as web graphs, knowledge graphs, and …

RDF question/answering (Q/A) allows users to ask questions in natural languages over a
knowledge base represented by RDF. To answer a national language question, the existing …