Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these graph databases, scientists require systems that search for all occurrences of a query graph. To deal efficiently with graph searching, advanced methods for indexing, representation and matching of graphs have been proposed.This paper presents GraphGrepSX. The system implements efficient graph searching algorithms together with an advanced filtering technique.GraphGrepSX is compared with SING, GraphFind, CTree and GCoding. Experiments show that GraphGrepSX outperforms the compared systems on a very large collection of molecular data. In particular, it reduces the size and the time for the construction of large database index and outperforms the most popular systems.

Enhancing Graph Database Indexing By Suffix Tree Structure / Bonnici, Vincenzo; Ferro, A; Giugno, Rosalba; Pulvirenti, A; Shasha, D.. - 6282:(2010), pp. 195-203. (Intervento presentato al convegno PRIB2010 tenutosi a Nijmegen, The Netherlands nel 22nd-24th September 2010) [10.1007/978-3-642-16001-1_17].

Enhancing Graph Database Indexing By Suffix Tree Structure

Bonnici, Vincenzo;
2010-01-01

Abstract

Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these graph databases, scientists require systems that search for all occurrences of a query graph. To deal efficiently with graph searching, advanced methods for indexing, representation and matching of graphs have been proposed.This paper presents GraphGrepSX. The system implements efficient graph searching algorithms together with an advanced filtering technique.GraphGrepSX is compared with SING, GraphFind, CTree and GCoding. Experiments show that GraphGrepSX outperforms the compared systems on a very large collection of molecular data. In particular, it reduces the size and the time for the construction of large database index and outperforms the most popular systems.
2010
3-642-16000-X
Enhancing Graph Database Indexing By Suffix Tree Structure / Bonnici, Vincenzo; Ferro, A; Giugno, Rosalba; Pulvirenti, A; Shasha, D.. - 6282:(2010), pp. 195-203. (Intervento presentato al convegno PRIB2010 tenutosi a Nijmegen, The Netherlands nel 22nd-24th September 2010) [10.1007/978-3-642-16001-1_17].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11381/2901544
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 36
  • ???jsp.display-item.citation.isi??? 24
social impact