Loading [MathJax]/extensions/TeX/color_ieee.js
GraphGrep: A fast and universal method for querying graphs | IEEE Conference Publication | IEEE Xplore

GraphGrep: A fast and universal method for querying graphs

Publisher: IEEE

Abstract:

GraphGrep is an application-independent method for querying graphs, finding all the occurrences of a subgraph in a database of graphs. The interface to GraphGrep is a reg...View more

Abstract:

GraphGrep is an application-independent method for querying graphs, finding all the occurrences of a subgraph in a database of graphs. The interface to GraphGrep is a regular expression graph query language Glide that combines features from Xpath and Smart. Glide incorporates both single node and variable-length wildcards. Our algorithm uses hash-based fingerprinting to represent the graphs in an abstract form and to filter the database. GraphGrep has been tested on databases of size up to 16,000 molecules and performs well in this entire range.
Date of Conference: 11-15 August 2002
Date Added to IEEE Xplore: 10 December 2002
Print ISBN:0-7695-1695-X
Print ISSN: 1051-4651
Publisher: IEEE
Conference Location: Quebec City, QC, Canada

References

References is not available for this document.