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

DOI10.1016/J.JCSS.2015.09.001MaRDI QIDQ891672zbMATHOpenAlexWikidataFDO

Authors

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.09.001

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Querying graphs
• On the data complexity of consistent query answering over graph databases
• On the data complexity of consistent query answering over graph databases
• Data engineering in graph databases
• Querying regular graph patterns

Cites work

• Answering ``why empty? and ``why so many? queries in graph databases
• Dynamic class hierarchy management for multi-version ontology-based personalization
• Querying a graph database -- language selection and performance considerations
• Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs

Cited in

(1)

• Guest editors' foreword: Special section on local pattern mining in graph-structured data

This page was built for publication: Foreword: Journal of Computer and System Sciences special issue on query answering on graph-structured data

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