Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Fast Search for Dynamic Multi-Relational Graphs   Acting on time-critical events by processing ever growing social media or
news streams is a major technical challenge. Many of these data sources can be
modeled as multi-relational graphs. Continuous queries or techniques to search
for rare events that typically arise in monitoring applications have been
studied extensively for relational databases. This work is dedicated to answer
the question that emerges naturally: how can we efficiently execute a
continuous query on a dynamic graph? This paper presents an exact subgraph
search algorithm that exploits the temporal characteristics of representative
queries for online news or social media monitoring. The algorithm is based on a
novel data structure called the Subgraph Join Tree (SJ-Tree) that leverages the
structural and semantic characteristics of the underlying multi-relational
graph. The paper concludes with extensive experimentation on several real-world
datasets that demonstrates the validity of this approach.

34
The categories of this paper are: chem-ph
7
The categories of this paper are: hep-th
29
The categories of this paper are: funct-an
14
The categories of this paper are: math-ph
27
The categories of this paper are: comp-gas
23
The categories of this paper are: solv-int
33
The categories of this paper are: plasm-ph
9
The categories of this paper are: nlin
24
The categories of this paper are: dg-ga
25
The categories of this paper are: patt-sol
5
The categories of this paper are: gr-qc
28
The categories of this paper are: alg-geom
15
The categories of this paper are: nucl-ex
36
The categories of this paper are: cmp-lg
30
The categories of this paper are: q-alg
2
The categories of this paper are: math