GraphGrep: A fast and universal method for querying graphs

Rosalba Giugno, Dennis Shasha

Research output: Contribution to journalArticle

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 Graph-Grep 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.

Original languageEnglish (US)
Pages (from-to)112-115
Number of pages4
JournalProceedings - International Conference on Pattern Recognition
Volume16
Issue number2
StatePublished - 2002

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition

Fingerprint Dive into the research topics of 'GraphGrep: A fast and universal method for querying graphs'. Together they form a unique fingerprint.

  • Cite this