Efficient processing of label-constraint reachability queries in large graphs

作者：

Highlights：

• We propose an interesting query model, called Label-Constraint Reachability (LCR) query, over a large directed graph. .

• We design a novel algorithm for answering LCR queries in a large graph.

• We design some efficient index structures to answer LCR queries.

摘要

Highlights•We propose an interesting query model, called Label-Constraint Reachability (LCR) query, over a large directed graph. .•We design a novel algorithm for answering LCR queries in a large graph.•We design some efficient index structures to answer LCR queries.

论文关键词：Graph database,Reachability query

论文评审过程：Received 22 November 2012, Revised 13 June 2013, Accepted 1 October 2013, Available online 18 October 2013.

论文官网地址：https://doi.org/10.1016/j.is.2013.10.003