loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
16th International Conference on Pattern Recognition (ICPR'02) - Volume 2
GraphGrep: A Fast and Universal Method for Querying Graphs
Quebec City, QC, Canada
August 11-August 15
ISBN: 0-7695-1695-X
Rosalba Giugno, University of Catania
Dennis Shasha, New York University
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.
Citation:
Rosalba Giugno, Dennis Shasha, "GraphGrep: A Fast and Universal Method for Querying Graphs," icpr, vol. 2, pp.20112, 16th International Conference on Pattern Recognition (ICPR'02) - Volume 2, 2002
Usage of this product signifies your acceptance of the Terms of Use.