Query without constraints

[mtarchini]

Hi! `For our graph anomaly detection research we will be testing your code...can someone pass a query graph without specifying the edge and node labels? If i query
e 0 1 0 0 0 0
q 0
will it find any endge?

Thank you

Mattia Tarchini

[Sh-Fang]

Actually, in your example both the edge label 0 and the node label 0 can be considered as valid labels — they are simply set to the value 0.

So the query is not really “without labels,” but rather “with labels equal to 0.” Whether it matches anything depends on whether the data graph you are querying against also contains nodes and edges with label 0.

[mtarchini]

So there is no way to not specify values for labels?

[Sh-Fang]

Yes, it must be specified

[mtarchini]

"Yes, there is a way to not specify values for labels" or "Yes, there is no way to not specify values for labels"?
Thank you for your support.

[Sh-Fang]

Your query data must include edge labels and node labels (even if they are 0), because the program reads the data in sequence. If these label data are missing, the program will throw an error.

[mtarchini]

Thank you very much, another question, can the query be without time constraint? the b -line.
Also in the query examples ( sparse dense etc,) what do the lines TC1 and TC2 stand for?

[Sh-Fang]

The line of TC{x} does not follow the TCMatch data standard, it is required by another algorithm, which is Timing, and the Timing is the baseline algorithm in our experiments.