GraphGrep

A fast and universal method for querying graphs

Rosalba Giugno, Dennis Shasha

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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)
Title of host publicationProceedings - International Conference on Pattern Recognition
Pages112-115
Number of pages4
Volume16
Edition2
StatePublished - 2002

Fingerprint

Query languages
Molecules

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Vision and Pattern Recognition
  • Hardware and Architecture

Cite this

Giugno, R., & Shasha, D. (2002). GraphGrep: A fast and universal method for querying graphs. In Proceedings - International Conference on Pattern Recognition (2 ed., Vol. 16, pp. 112-115)

GraphGrep : A fast and universal method for querying graphs. / Giugno, Rosalba; Shasha, Dennis.

Proceedings - International Conference on Pattern Recognition. Vol. 16 2. ed. 2002. p. 112-115.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Giugno, R & Shasha, D 2002, GraphGrep: A fast and universal method for querying graphs. in Proceedings - International Conference on Pattern Recognition. 2 edn, vol. 16, pp. 112-115.
Giugno R, Shasha D. GraphGrep: A fast and universal method for querying graphs. In Proceedings - International Conference on Pattern Recognition. 2 ed. Vol. 16. 2002. p. 112-115
Giugno, Rosalba ; Shasha, Dennis. / GraphGrep : A fast and universal method for querying graphs. Proceedings - International Conference on Pattern Recognition. Vol. 16 2. ed. 2002. pp. 112-115
@inproceedings{9e40a1233bd34af7b7efa734bb490755,
title = "GraphGrep: A fast and universal method for querying graphs",
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.",
author = "Rosalba Giugno and Dennis Shasha",
year = "2002",
language = "English (US)",
volume = "16",
pages = "112--115",
booktitle = "Proceedings - International Conference on Pattern Recognition",
edition = "2",

}

TY - GEN

T1 - GraphGrep

T2 - A fast and universal method for querying graphs

AU - Giugno, Rosalba

AU - Shasha, Dennis

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33745521541&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745521541&partnerID=8YFLogxK

M3 - Conference contribution

VL - 16

SP - 112

EP - 115

BT - Proceedings - International Conference on Pattern Recognition

ER -