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

DOI10.1016/J.JCSS.2015.06.007MaRDI QIDQ891677zbMATHOpenAlexFDO

Authors Elena Vasilyeva, Maik Thiele, Christof Bornhövd, 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)

Recommendations

• On the data complexity of consistent query answering over graph databases
• On the data complexity of consistent query answering over graph databases
• Querying graphs
• scientific article; zbMATH DE number 1203020
• Fuzzy quality-aware queries to graph databases

Cites work

• scientific article; zbMATH DE number 48148 (Why is no real title available?)
• A survey of graph edit distance
• An Algorithm for Subgraph Isomorphism
• Backtrack search algorithms and the maximal common subgraph problem
• Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs
• Finding a Maximum Clique in an Arbitrary Graph
• Introduction to algorithms

Cited in

(2)

• Tuning fuzzy SPARQL queries
• Foreword: Journal of Computer and System Sciences special issue on query answering on graph-structured data

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q891677)