• Cite Icon1
  • https://doi.org/10.4018/978-1-60566-010-3.ch114Copy DOI Icon

Efficient Graph Matching

  • Jan 1, 2009
  • Diego Reforgiato Recupero
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Application domains such as bioinformatics and web technology represent complex objects as graphs where nodes represent basic objects (i.e. atoms, web pages etc.) and edges model relations among them. In biochemical databases proteins are naturally represented as labeled graphs: the nodes are atoms and the edges are chemical links. In computer vision, graphs can be used to represent images at different levels of abstraction. In a low-level representation (Pailloncy, Deruyver, & Jolion, 1999), the nodes of a graph correspond to pixels and the edges to spatial relations between pixels. At higher levels of description (Hong & Huang, 2001), nodes are image regions and edges are spatial relations among them. In a Web graph (Deutsch, Fernandez, Florescu, Levy, & Suciu, 1999) nodes are web pages and edges are links between them. In all these domains, substructure queries that search for all exact or approximate occurrences of a given query graph in the graphs of the database can be useful. Research efforts in graph searching have taken three directions: the first is to study matching algorithms for particular graph structures (planar graphs, bounded valence graphs and association graphs); the second is to use elaborate tricks to reduce the number of generated matching maps (Cordella, Foggia, Sansone, & Vento, 2004); and the third is, since graph searching problem is NP-complete, to provide polynomial approximate algorithms. In the context of querying in a database of graphs many of the existing methods are designed for specific applications. For example, several querying methods for semi-structured databases have been proposed. In addition, commercial products and academic projects (Kelley 2002) for subgraph searching in biochemical databases are available. These two examples have a different underlying data model (a web-page database is a large graph whereas a biochemical database is a collection of graphs). In these two applications regular path expressions and indexing methods are used during query time to respectively locate substructures in the database and to avoid unnecessary traversals of the database. In general graph databases, there are some searching methods where the data graph and the query graph must have the same size. Other methods allow the query to be considerably smaller than the database graphs. A common idea in the above algorithms is to index the subgraph matches in the database and organize them in suitable data structures.

Similar Papers
  • Conference Article
  • Citations66

Shortest path queries in planar graphs

  • May 01, 2000
  • Danny Z Chen +1
  • Conference Article
  • Citations4

Efficient answering of why-not questions in similar graph matching

  • May 01, 2016
  • Md Saiful Islam +2
  • Research Article
  • Citations1

Understanding Student Errors in Graph Query Formulation

  • Jun 09, 2025
  • ACM Transactions on Computing Education
  • Amedeo Pachera +3
  • Conference Article
  • Citations2

From graph data extraction to graph layout: Web information visualization

  • Jun 01, 2010
  • Wei Lai +1
  • Research Article
  • Citations8

Controlling the robots of Web search engines

  • Jun 01, 2001
  • ACM SIGMETRICS Performance Evaluation Review
  • J Talim +3
  • Conference Article
  • Citations3

Interactive Path Query Specification on Graph Databases

  • Aug 28, 2015
  • HAL (Le Centre pour la Communication Scientifique Directe)
  • Angela Bonifati +2
  • Book Chapter
  • Citations3

Connectivity of the Thai Web Graph

  • Apr 26, 2008
  • Kulwadee Somboonviwat +2
  • Research Article
  • Citations32

Privacy-Preserving Graph Matching Query Supporting Quick Subgraph Extraction

  • May 01, 2024
  • IEEE Transactions on Dependable and Secure Computing
  • Xinrui Ge +2
  • Research Article
  • Citations13

Retrieving keyworded subgraphs with graph ranking score

  • Aug 30, 2011
  • Expert Systems with Applications
  • Seung Kim +4
  • Research Article
  • Citations391

On graph query optimization in large networks

  • Sep 01, 2010
  • Proceedings of the VLDB Endowment
  • Peixiang Zhao +1
  • Research Article
  • Citations2

FGDB: a comprehensive graph database of ligand fragments from the Protein Data Bank

  • Jun 27, 2022
  • Database: The Journal of Biological Databases and Curation
  • Daniele Toti +3
  • Conference Article
  • Citations37

Extracting link spam using biased random walks from spam seed sets

  • May 08, 2007
  • Baoning Wu +1
  • Conference Article
  • Citations14

The powerrank web link analysis algorithm

  • Jan 01, 2004
  • Yizhou Lu +6
  • Conference Article
  • Citations39

Machine Learning Based Cross-Site Scripting Detection in Online Social Network

  • Aug 01, 2014
  • Rui Wang +3
  • Research Article
  • Citations8

Synergistic graph and SQL analytics inside IBM Db2

  • Aug 01, 2019
  • Proceedings of the VLDB Endowment
  • Yuanyuan Tian +5
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.