Adding regular expressions to graph reachability and pattern queries

Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Yinghui Wu

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

It is increasingly common to find graphs in which edges are of different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries and a class of graph patterns, in which an edge is specified with a regular expression of a certain form, expressing the connectivity of a data graph via edges of various types. In addition, we define graph pattern matching based on a revised notion of graph simulation. On graphs in emerging applications such as social networks, we show that these queries are capable of finding more sensible information than their traditional counterparts. Better still, their increased expressive power does not come with extra complexity. Indeed, (1) we investigate their containment and minimization problems, and show that these fundamental problems are in quadratic time for reachability queries and are in cubic time for pattern queries. (2) We develop an algorithm for answering reachability queries, in quadratic time as for their traditional counterpart. (3) We provide two cubic-time algorithms for evaluating graph pattern queries, as opposed to the NP-completeness of graph pattern matching via subgraph isomorphism. (4) The effectiveness and efficiency of these algorithms are experimentally verified using real-life data and synthetic data.

Original languageEnglish
Pages (from-to)313-338
Number of pages26
JournalFrontiers of Computer Science in China
Volume6
Issue number3
DOIs
Publication statusPublished - 1 Jun 2012

Fingerprint

Regular Expressions
Reachability
Pattern matching
Query
Graph in graph theory
Pattern Matching
NP-completeness
Expressive Power
Synthetic Data
Minimization Problem
Social Networks
Subgraph
Isomorphism
Connectivity

Keywords

  • containment
  • equivalence
  • graph pattern queries
  • graph reachability
  • minimization
  • regular expressions

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Adding regular expressions to graph reachability and pattern queries. / Fan, Wenfei; Li, Jianzhong; Ma, Shuai; Tang, Nan; Wu, Yinghui.

In: Frontiers of Computer Science in China, Vol. 6, No. 3, 01.06.2012, p. 313-338.

Research output: Contribution to journalArticle

Fan, Wenfei ; Li, Jianzhong ; Ma, Shuai ; Tang, Nan ; Wu, Yinghui. / Adding regular expressions to graph reachability and pattern queries. In: Frontiers of Computer Science in China. 2012 ; Vol. 6, No. 3. pp. 313-338.
@article{777986fd47764836bfb574027cc0f14a,
title = "Adding regular expressions to graph reachability and pattern queries",
abstract = "It is increasingly common to find graphs in which edges are of different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries and a class of graph patterns, in which an edge is specified with a regular expression of a certain form, expressing the connectivity of a data graph via edges of various types. In addition, we define graph pattern matching based on a revised notion of graph simulation. On graphs in emerging applications such as social networks, we show that these queries are capable of finding more sensible information than their traditional counterparts. Better still, their increased expressive power does not come with extra complexity. Indeed, (1) we investigate their containment and minimization problems, and show that these fundamental problems are in quadratic time for reachability queries and are in cubic time for pattern queries. (2) We develop an algorithm for answering reachability queries, in quadratic time as for their traditional counterpart. (3) We provide two cubic-time algorithms for evaluating graph pattern queries, as opposed to the NP-completeness of graph pattern matching via subgraph isomorphism. (4) The effectiveness and efficiency of these algorithms are experimentally verified using real-life data and synthetic data.",
keywords = "containment, equivalence, graph pattern queries, graph reachability, minimization, regular expressions",
author = "Wenfei Fan and Jianzhong Li and Shuai Ma and Nan Tang and Yinghui Wu",
year = "2012",
month = "6",
day = "1",
doi = "10.1007/s11704-012-1312-y",
language = "English",
volume = "6",
pages = "313--338",
journal = "Frontiers of Computer Science",
issn = "2095-2228",
publisher = "Springer Science + Business Media",
number = "3",

}

TY - JOUR

T1 - Adding regular expressions to graph reachability and pattern queries

AU - Fan, Wenfei

AU - Li, Jianzhong

AU - Ma, Shuai

AU - Tang, Nan

AU - Wu, Yinghui

PY - 2012/6/1

Y1 - 2012/6/1

N2 - It is increasingly common to find graphs in which edges are of different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries and a class of graph patterns, in which an edge is specified with a regular expression of a certain form, expressing the connectivity of a data graph via edges of various types. In addition, we define graph pattern matching based on a revised notion of graph simulation. On graphs in emerging applications such as social networks, we show that these queries are capable of finding more sensible information than their traditional counterparts. Better still, their increased expressive power does not come with extra complexity. Indeed, (1) we investigate their containment and minimization problems, and show that these fundamental problems are in quadratic time for reachability queries and are in cubic time for pattern queries. (2) We develop an algorithm for answering reachability queries, in quadratic time as for their traditional counterpart. (3) We provide two cubic-time algorithms for evaluating graph pattern queries, as opposed to the NP-completeness of graph pattern matching via subgraph isomorphism. (4) The effectiveness and efficiency of these algorithms are experimentally verified using real-life data and synthetic data.

AB - It is increasingly common to find graphs in which edges are of different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries and a class of graph patterns, in which an edge is specified with a regular expression of a certain form, expressing the connectivity of a data graph via edges of various types. In addition, we define graph pattern matching based on a revised notion of graph simulation. On graphs in emerging applications such as social networks, we show that these queries are capable of finding more sensible information than their traditional counterparts. Better still, their increased expressive power does not come with extra complexity. Indeed, (1) we investigate their containment and minimization problems, and show that these fundamental problems are in quadratic time for reachability queries and are in cubic time for pattern queries. (2) We develop an algorithm for answering reachability queries, in quadratic time as for their traditional counterpart. (3) We provide two cubic-time algorithms for evaluating graph pattern queries, as opposed to the NP-completeness of graph pattern matching via subgraph isomorphism. (4) The effectiveness and efficiency of these algorithms are experimentally verified using real-life data and synthetic data.

KW - containment

KW - equivalence

KW - graph pattern queries

KW - graph reachability

KW - minimization

KW - regular expressions

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

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

U2 - 10.1007/s11704-012-1312-y

DO - 10.1007/s11704-012-1312-y

M3 - Article

VL - 6

SP - 313

EP - 338

JO - Frontiers of Computer Science

JF - Frontiers of Computer Science

SN - 2095-2228

IS - 3

ER -