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.
Filters
Querying subgraph sets with g-tries
2012
Proceedings of the 2nd ACM SIGMOD Workshop on Databases and Social Networks - DBSocial '12
Preserved Fulltext
We give results of applying g-tries querying to different social networks, showing that we can efficiently find the occurrences of a set containing subgraphs of multiple sizes, outperforming previous methods ...
Using a specialized canonical form and symmetry breaking conditions, a single non-redundant search of the entire set of subgraphs is possible. ...
The definitive version was published in DBSocial'2012, an ACM SIGMOD 2012 Workshop, May 20, Scottsdale, AZ, USA. http://doi.acm.org/10.1145/2304536.2304541 . ...
doi:10.1145/2304536.2304541
dblp:conf/dbsocial/RibeiroS12
fatcat:hcfuluqavvg3noxtwfmcp2krde