Sciweavers

Share
ICPR
2002
IEEE

GraphGrep: A Fast and Universal Method for Querying Graphs

11 years 3 months ago
GraphGrep: A Fast and Universal Method for Querying Graphs
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 hs 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.
Rosalba Giugno, Dennis Shasha
Added 09 Nov 2009
Updated 09 Nov 2009
Type Conference
Year 2002
Where ICPR
Authors Rosalba Giugno, Dennis Shasha
Comments (0)
books