We propose a new approach to querying graph databases. Our approach balances competing goals of expressive power, language clarity and computational complexity. A distinctive feature of our approach is the ability to express properties of minimal (e.g. shortest) and maximal (e.g. most valuable) paths satisfying given criteria. To express complex properties in a modular way, we introduce labelling-generating ontologies. The resulting formalism is computationally attractive - queries can be answered in non-deterministic logarithmic space in the size of the database.
@article{arxiv.2002.04460,
title = {Modular Path Queries with Arithmetic},
author = {Jakub Michaliszyn and Jan Otop and Piotr Wieczorek},
journal= {arXiv preprint arXiv:2002.04460},
year = {2023}
}
Comments
arXiv admin note: text overlap with arXiv:1710.04419