IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v21y2011i2d10.1007_s10878-009-9221-1.html
   My bibliography  Save this article

Efficient algorithms for supergraph query processing on graph databases

Author

Listed:
  • Shuo Zhang

    (Harbin Institute of Technology)

  • Xiaofeng Gao

    (University of Texas at Dallas)

  • Weili Wu

    (University of Texas at Dallas)

  • Jianzhong Li

    (Harbin Institute of Technology)

  • Hong Gao

    (Harbin Institute of Technology)

Abstract

We study the problem of processing supergraph queries on graph databases. A graph database D is a large set of graphs. A supergraph query q on D is to retrieve all the graphs in D such that q is a supergraph of them. The large number of graphs in databases and the NP-completeness of subgraph isomorphism testing make it challenging to efficiently processing supergraph queries. In this paper, a new approach to processing supergraph queries is proposed. Specifically, a method for compactly organizing graph databases is first presented. Common subgraphs of the graphs in a database are stored only once in the compact organization of the database, in order to reduce the overall cost of subgraph isomorphism testings from the stored graphs to queries during query processing. Then, an exact algorithm and an approximate algorithm for generating the significant feature set with optimal order are proposed, followed by the algorithms for indices construction on graph databases. The optimal order on the feature set is to reduce the number of subgraph isomorphism testings during query processing. Based on the compact organization of graph databases, a novel algorithm for testing subgraph isomorphisms from multiple graphs to one graph is presented. Finally, based on all the above techniques, a query processing method is proposed. Analytical and experimental results show that the proposed algorithms outperform the existing similar algorithms by one to two orders of magnitude.

Suggested Citation

  • Shuo Zhang & Xiaofeng Gao & Weili Wu & Jianzhong Li & Hong Gao, 2011. "Efficient algorithms for supergraph query processing on graph databases," Journal of Combinatorial Optimization, Springer, vol. 21(2), pages 159-191, February.
    • Handle: RePEc:spr:jcomop:v:21:y:2011:i:2:d:10.1007_s10878-009-9221-1
    DOI: 10.1007/s10878-009-9221-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-009-9221-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-009-9221-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:21:y:2011:i:2:d:10.1007_s10878-009-9221-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.