This tool aims to match any given query metagraph (i.e., to compute the instances of the metagraph) over a large input graph. For the definition and examples of metagraphs, refer to the citation below. Currently, the tool only works on undirected graphs, where nodes are typed, and edges are untyped (or rather, edge type is a function of the two node types).
Semantic Proximity Search on Graphs with Metagraph-based Learning.
Y. Fang, W. Lin, V. W. Zheng, M. Wu, K. C.-C. Chang and X. Li.
In ICDE 2016, pp. 277--288.
Code and Data
Compiled binary (Linux): Download
Sample datasets are included. The source of these datasets can be found in the above citation.
Command line arguments
The input graph filename. The file is in the Labeled Graph Format. The graph is treated as undirected, and edge types are not considered at the moment.
The maximum number of instances to match, for each query metagraph. The program immediately moves on to the next query after the specified maximum number of instances are found.
The filename to output the metagraph database, which contains a list of processed metagraphs. The file is in the Metagraph Database Format.
The directory name to output matched instances of each metagraph. Make sure you manually create the the directory before running.
Sample command line
We provide any code and/or data on an as-is basis. Use at your own risk.