Skip to content

Source codes of "Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction", SIGMOD 2023

Notifications You must be signed in to change notification settings

JackChuengQAQ/CaLiG

Repository files navigation

CaLiG

Run

After compiling cpp file calig.cpp to calig

g++ -O2 ./calig.cpp -o ./calig -std=c++11

run

./calig -d <data_path> -q <query_path> -s <stream_path>
  • <data_path>: use the path of data graph to replace it.
  • <query_path>: use the path of query graph to replace it.
  • <stream_path>: use the path of stream graph to replace it.

Example

./calig -d ./data/test_G -q ./data/test_Q -s ./data/test_S

Format

data graph / query graph

v <id> <label>
...
e <id1> <id2>
...
  • Lines starting with "v" represent vertices;
  • Lines starting with "e" represent edges.

stream

e <id1> <id2>
...
e <-id1-1> <-id2-1>
...
  • e <id1> <id2> represents the addition of the edge (id1, id2);
  • e <-id1-1> <-id2-1> represents the deletion of the edge (id1, id2).

About

Source codes of "Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction", SIGMOD 2023

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages