Extended high dimensional indexing approach for reachability queries on very large graphs

作者：

Highlights：

• We propose a strategy to improve FELINE’s negative cut index.

• We introduce LYNX, a novel indexing approach for reachability queries.

• Computational results compare LYNX’s performance with state-of-the-art algorithms.

摘要

•We propose a strategy to improve FELINE’s negative cut index.•We introduce LYNX, a novel indexing approach for reachability queries.•Computational results compare LYNX’s performance with state-of-the-art algorithms.

论文关键词：Directed acyclic graphs,Topological sorts,Reachability queries,Graph indexing

论文评审过程：Received 8 October 2019, Revised 8 March 2021, Accepted 24 March 2021, Available online 24 April 2021, Version of Record 18 May 2021.

论文官网地址：https://doi.org/10.1016/j.eswa.2021.114962