Answering “Why Empty?” and “Why So Many?” queries in graph databases

作者：

Highlights：

• We propose “Why?” queries to handle unexpected results in graph databases.

• We develop subgraph-based solutions for “Why Empty?” and “Why So Many?” queries.

• Processing of weakly-connected graphs and spanning tree increases quality.

• Single run and restart strategies increase performance.

摘要

•We propose “Why?” queries to handle unexpected results in graph databases.•We develop subgraph-based solutions for “Why Empty?” and “Why So Many?” queries.•Processing of weakly-connected graphs and spanning tree increases quality.•Single run and restart strategies increase performance.

论文关键词：Graph databases,“Why?” query,“Why Empty?” query,“Why So Few?” query,“Why Not?” query,“Why So Many?” query

论文评审过程：Received 30 October 2014, Revised 27 May 2015, Accepted 15 June 2015, Available online 8 July 2015, Version of Record 19 October 2015.

论文官网地址：https://doi.org/10.1016/j.jcss.2015.06.007