Answering ``why empty? and ``why so many? queries in graph databases

DOI10.1016/J.JCSS.2015.06.007zbMath1343.68071OpenAlexW757456028MaRDI QIDQ891677

Elena Vasilyeva, Christof Bornhövd, Maik Thiele, Wolfgang Lehner

Publication date: 17 November 2015

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2015.06.007

zbMATH Keywords

graph databases``why empty? query``why not? query``why so few? query``why so many? query``why? query

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (1)

Foreword: Journal of Computer and System Sciences special issue on query answering on graph-structured data

Cites Work

• Unnamed Item
• Unnamed Item
• A survey of graph edit distance
• Finding a Maximum Clique in an Arbitrary Graph
• Backtrack search algorithms and the maximal common subgraph problem
• An Algorithm for Subgraph Isomorphism
• Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs

This page was built for publication: Answering ``why empty? and ``why so many? queries in graph databases