Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

ICPR
2002
IEEE

favoriteEmaildiscussreport

222views computer vision» more ICPR 2002»

GraphGrep: A Fast and Universal Method for Querying Graphs

14 years 5 months ago

GraphGrep: A Fast and Universal Method for Querying Graphs

Download cs.nyu.edu

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

Real-time Traffic

Computer Vision | ICPR 2002 | Query Language Glide | Single Node | Variable-length Wildcards |

claim paper

Related Content

» Application of Kernel Functions for Accurate Similarity Search in Large Chemical Databases

» GraphFind enhancing graph searching by low support data mining techniques

» Graph Indexing A Frequent Structurebased Approach

» MQuery Fast Graph Query via Semantic Indexing for Mobile Context

» Finding Underlying Connections A Fast GraphBased Method for Link Analysis and Collaboratio...

» Approximate Shortest Path Queries Using Voronoi Duals

» Ghash towards fast kernelbased similarity search in large graph databases

» Neighborhood based fast graph search in large networks

» Fast besteffort pattern matching in large attributed graphs

Post Info
More Details (n/a)

Added	09 Nov 2009
Updated	09 Nov 2009
Type	Conference
Year	2002
Where	ICPR
Authors	Rosalba Giugno, Dennis Shasha

Comments (0)