A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Querying subgraph sets with g-tries
2012
Proceedings of the 2nd ACM SIGMOD Workshop on Databases and Social Networks - DBSocial '12
In this paper we present an universal methodology for finding all the occurrences of a given set of subgraphs in one single larger graph. Past approaches would either enumerate all possible subgraphs of a certain size or query a single subgraph. We use g-tries, a data structure specialized in dealing with subgraph sets. G-Tries store the topological information on a tree that exposes common substructure. Using a specialized canonical form and symmetry breaking conditions, a single non-redundant
doi:10.1145/2304536.2304541
dblp:conf/dbsocial/RibeiroS12
fatcat:hcfuluqavvg3noxtwfmcp2krde